Quantum description of reality is epistemically incomplete
arXiv:2110.13124 · doi:10.1103/wqhx-qfv1
Abstract
We ask whether the operational quantum description is complete at the level of preparations: can the empirically accessible properties of a finite preparation set be reproduced exactly by a hidden-variable description, or must every such completion contain additional structure that is not operationally accessible? We formalize this through epistemic completeness, a preparation-side notion of classicality requiring exact preservation of empirical preparation-properties by the corresponding ontic quantities obtained by conditioning on the ontic state and allowing all response schemes compatible with positivity and normalization. For the canonical family of set-distinguishability tasks, we prove that every epistemically complete theory satisfies an equality: for every finite preparation set, the average pairwise distinguishability equals the average set-distinguishability. Any nonzero deviation certifies epistemic incompleteness and lower-bounds the excess ontic communication power that every ontic completion must conceal. Because unrestricted classical communication models, and more generally commuting quantum theories, are epistemically complete, every nonzero deviation also yields a quantum communication advantage and witnesses of coherence and measurement incompatibility. We formulate semidefinite-programming relaxations and see-saw lower bounds, and show that quantum theory violates the equality in both directions. The trine and tetrahedral qubit ensembles are numerically certified maximizers for the n=3 and n=4 equalities; their violations persist for arbitrarily low positive visibility and arbitrarily large leakage short of complete disclosure; and the Kochen--Specker ψ-epistemic model exactly saturates the hidden ontic excess for these maximal positive violations. Numerics suggest that the maximal positive deviation increases with the number of preparations.
References in corpus (31)
- Bell nonlocality
- A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
- Contextuality for preparations, transformations, and unsharp measurements
- Bounding the set of quantum correlations
- The lesson of causal discovery algorithms for quantum correlations: Causal explanations of Bell-inequality violations require fine-tuning
- Is the quantum state real? An extended review of -ontology theorems
- Semi-device-independent security of one-way quantum key distribution
- Preparation contextuality powers parity-oblivious multiplexing
- No -epistemic model can fully explain the indistinguishability of quantum states
- Semi-device-independent framework based on natural physical assumptions
- Maximally epistemic interpretations of the quantum state and contextuality
- Algorithm 950: Ncpol2sdpa---Sparse Semidefinite Programming Relaxations for Polynomial Optimization Problems of Noncommuting Variables
- State independent contextuality advances one-way communication
- Communication games reveal preparation contextuality
- Preparation contextuality as an essential feature underlying quantum communication advantage
- Characterising and bounding the set of quantum behaviours in contextuality scenarios
- Informationally restricted quantum correlations
- Informationally restricted correlations: a general framework for classical and quantum systems
- Quantum prescriptions are more ontologically distinct than they are operationally distinguishable
- Noncontextuality Inequalities from Antidistinguishability
- Bounding and simulating contextual correlations in quantum theory
- Solvable Criterion for the Contextuality of any Prepare-and-Measure Scenario
- Self-testing in prepare-and-measure scenarios and a robust version of Wigner's theorem
- A mathematical framework for operational fine tunings
- General Method for Classicality Certification in the Prepare and Measure Scenario
- Tight bounds for antidistinguishability and circulant sets of pure quantum states
- Alternative robust ways of witnessing nonclassicality in the simplest scenario
- Unbounded quantum advantage in communication complexity measured by distinguishability
- Information capacity of quantum communication under natural physical assumptions
- Efficient Computation of Generalized Noncontextual Polytopes and Quantum violation of their Facet Inequalities
- How contextuality and antidistinguishability are related