Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Michal Kotowski

dblp:136/4418 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2026
0000-0003-2111-8094ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Emerging computing paradigms · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Emerging computing paradigms
quantum computing and quantum information
1.012026
Pretty Good Simulation of All Quantum Measurements by Projective Measurements · IEEE Trans. Inf. Theory 2026
Emerging computing paradigms › quantum computing and quantum information
quantum measurement
1.012026
Pretty Good Simulation of All Quantum Measurements by Projective Measurements · IEEE Trans. Inf. Theory 2026
Emerging computing paradigms › quantum computer architecture › quantum circuit simulation
circuit cutting
0.312026
Pretty Good Simulation of All Quantum Measurements by Projective Measurements · IEEE Trans. Inf. Theory 2026
Emerging computing paradigms › quantum computer architecture
quantum circuit simulation
0.312026
Pretty Good Simulation of All Quantum Measurements by Projective Measurements · IEEE Trans. Inf. Theory 2026

Methods — techniques the papers use, named apart from their topics

naimark theorem · 1.0kadison–singer problem · 1.0depolarizing noise · 1.0
YearPublicationVenuePosition
2026 Pretty Good Simulation of All Quantum Measurements by Projective Measurements
abstract
In quantum theory, general measurements are described by Positive Operator-Valued Measures (POVMs). We show that for anyd-dimensional system, applying depolarizing noise with constant visibility rendersanyPOVM simulable by a randomized implementation of projective measurements— without auxiliary systems. This constrains the asymptotic advantage of POVMs over projective measurements in tasks such as state discrimination, shadow tomography, and quantum metrology. We further improve known bounds on the visibility range for which noisy pure two-qudit states admit local hidden-variable models under general measurements. As a byproduct, we obtain asymptotically tight bounds on the critical visibility for joint measurability of all POVMs. Technically, we leverage recent results in POVM simulation, the Kadison–Singer problem, and introduce a “dimension-deficient” Naimark theorem. Additionally, we demonstrate that general2N-qubit circuits can be simulated via randomization over circuits onN +1qubits, with constant overhead, suggesting new avenues for circuit knitting in near-term quantum architectures.
Michal Kotowski, Michal Oszmaniec
IEEE Trans. Inf. Theory1