Efficient contextual ontological model of $n$-qubit stabilizer quantum mechanics

Abstract

The most well-known tool for studying contextuality in quantum computation is the n-qubit stabilizer state tableau representation. We provide an extension that describes not only the quantum state, but is also outcome deterministic. The extension enables a value assignment to exponentially many Pauli observables, yet remains quadratic in both memory and computational complexity. Furthermore, we show that the mechanisms employed for contextuality and measurement disturbance are wholly separate. The model will be useful for investigating the role of contextuality in $n$-qubit quantum computation.

arXiv commentMinor grammatical corrections. Added a table comparing our model to existing models. Expanded somewhat on the discussion in Conclusions. Added a link to a Python implementation of our model. 6 pages, 1 figure, 1 table

References in corpus (9)

• Improved Simulation of Stabilizer Circuits
• Hidden Variables and the Two Theorems of John Bell
• A Theory of Fault-Tolerant Quantum Computation
• In defense of the epistemic view of quantum states: a toy theory
• Quantum advantage with shallow circuits
• Nonnegative subtheories and quasiprobability representations of qubits
• Efficient classical simulation of the Deutsch-Jozsa and Simon's algorithms
• Quantum cube: A toy model of a qubit
• Quantum Simulation Logic, Oracles, and the Quantum Advantage

Cited by in corpus (7)

• Kochen-Specker Contextuality
• Exploring the boundary of quantum correlations with a time-domain optical processor
• Deterministic Underlying States are incompatible with a Counterfactual account of Lüders' rule
• Sufficiency of the counterfactual account of Lüders' rule to rule out ontological models of quantum mechanics
• Phase Coordinate Uncomputation in Quantum Recursive Fourier Sampling
• Conjugate Logic
• The Contextual Heisenberg Microscope