arXiv · 2611.21123
Stabilizer-Restricted Antidistinguishability in Quantum Computation with Magic States
Abstract
An antidistinguishing measurement for a family of preparations excludes at least one preparation for every possible outcome, constraining 'classical' representations of these processes, known as ontological models. We develop this connection within quantum computing with magic states (QCM), a universal model of quantum computation. Our constructions use adaptive Pauli measurements on tensor products of single-qubit non stabilizer states, including families associated with the Clifford hierarchy. These constructions yield stabilizer-restricted versions of the Pusey-Barrett-Rudolph theorem: any ontological model reproducing these measurement statistics and satisfying preparation independence must assign disjoint ontic supports to the preparations considered. We demonstrate this obstruction to preparation independence in a concrete ontological model based on convex polytopes used for the classical simulation of QCM.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Selman Ipek. 2026-11-16. Stabilizer-Restricted Antidistinguishability in Quantum Computation with Magic States. https://searcharxiv.com/abs/2611.21123
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.