Limitations of Classically-Simulable Measurements for Quantum State Discrimination
arXiv:2310.11323 · doi:10.1103/PhysRevLett.133.010202
Abstract
In the realm of fault-tolerant quantum computing, stabilizer operations play a pivotal role, characterized by their remarkable efficiency in classical simulation. This efficiency sets them apart from non-stabilizer operations within the quantum computational theory. In this Letter, we investigate the limitations of classically-simulable measurements in distinguishing quantum states. We demonstrate that any pure magic state and its orthogonal complement of odd prime dimensions cannot be unambiguously distinguished by stabilizer operations, regardless of how many copies of the states are supplied. We also reveal intrinsic similarities and distinctions between the quantum resource theories of magic states and entanglement in quantum state discrimination. The results emphasize the inherent limitations of classically-simulable measurements and contribute to a deeper understanding of the quantum-classical boundary.
5+8 pages, 1 figure
References in corpus (64)
- Quantum Cryptography
- Quantum Teleportation is a Universal Computational Primitive
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- How to share a quantum secret
- Quantum Resource Theories
- Mixed-state entanglement and distillation: is there a ``bound'' entanglement in nature?
- Quantum Computing with Very Noisy Devices
- Quantum Nonlocality without Entanglement
- Unextendible Product Bases and Bound Entanglement
- Contextuality supplies the magic for quantum computation
- Roads towards fault-tolerant universal quantum computation
- Toward the first quantum simulation with quantum speedup
- The Quantum Chernoff Bound
- Qudits and high-dimensional quantum computing
- The Resource Theory of Stabilizer Computation
- Local Distinguishability of Multipartite Orthogonal Quantum States
- Positive Wigner functions render classical simulation of quantum computation efficient
- Unconditional security proof of long-distance continuous-variable quantum key distribution with discrete modulation
- Application of a resource theory for magic states to fault-tolerant quantum computing
- Negative Quasi-Probability as a Resource for Quantum Computation
- Quantum Data Hiding
- Methodology for quantum logic gate constructions
- Quantum algorithms for algebraic problems
- Quantum state discrimination and its applications
- Hudson's Theorem for finite-dimensional quantum systems
- Trading classical and quantum computational resources
- Asymptotic Error Rates in Quantum Hypothesis Testing
- Hiding bits in Bell states
- General Resource Theories in Quantum Mechanics and Beyond: Operational Characterization via Discrimination Tasks
- Quantum hypothesis testing and the operational interpretation of the quantum Renyi relative entropies
- Hiding classical data in multi-partite quantum states
- Distinguishability of quantum states under restricted families of measurements with an application to quantum data hiding
- Magic state distillation in all prime dimensions using quantum Reed-Muller codes
- Strong Quantum Nonlocality without Entanglement
- Experimental estimation of the dimension of classical and quantum systems
- Dimension witnesses and quantum state discrimination
- Operational Advantage of Quantum Resources in Subchannel Discrimination
- Classicality in discrete Wigner functions
- Discrete Wigner functions and quantum computational speedup
- Fundamental limits to quantum channel discrimination
- Quantifying magic for multi-qubit operations
- A framework for bounding nonlocality of state discrimination
- Efficiently computable bounds for magic state distillation
- Operational relevance of resource theories of quantum measurements
- Local discrimination of mixed states
- Limitations on separable measurements by convex optimization
- Bound States for Magic State Distillation in Fault-Tolerant Quantum Computation
- Distinguishability of Quantum States by Positive Operator-Valued Measures with Positive Partial Transpose
- Phase space simulation method for quantum computation with magic states on qubits
- All quantum resources provide an advantage in exclusion tasks
- More nonlocality with less purity
- Non-negative Wigner functions in prime dimensions
- Operational interpretation of weight-based resource quantifiers in convex quantum resource theories of states
- Resource theory of asymmetric distinguishability
- Ultimate data hiding in quantum mechanics and beyond
- Permutation Symmetry Determines the Discrete Wigner Function
- A hidden variable model for universal quantum computation with magic states on qubits
- Quantum advantage of unitary Clifford circuits with magic state inputs
- Quantifying Qubit Magic Resource with Gottesman-Kitaev-Preskill Encoding
- Indistinguishability of bipartite states by positive-partial-transpose operations in the many-copy scenario
- The operational significance of the quantum resource theory of Buscemi nonlocality
- Discrimination of quantum states under locality constraints in the many-copy setting
- Maximal gap between local and global distinguishability of bipartite quantum states
- LOCC protocols with bounded width per round optimize convex functions