Quantum computing and hidden variables
From MaRDI portal
Abstract: This paper initiates the study of hidden variables from the discrete, abstract perspective of quantum computing. For us, a hidden-variable theory is simply a way to convert a unitary matrix that maps one quantum state to another, into a stochastic matrix that maps the initial probability distribution to the final one in some fixed basis. We list seven axioms that we might want such a theory to satisfy, and then investigate which of the axioms can be satisfied simultaneously. Toward this end, we construct a new hidden-variable theory that is both robust to small perturbations and indifferent to the identity operation, by exploiting an unexpected connection between unitary matrices and network flows. We also analyze previous hidden-variable theories of Dieks and Schrodinger in terms of our axioms. In a companion paper, we will show that actually sampling the history of a hidden variable under reasonable axioms is at least as hard as solving the Graph Isomorphism problem; and indeed is probably intractable even for quantum computers.
Recommendations
Cites work
- A complete problem for statistical zero knowledge
- A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
- A Suggested Interpretation of the Quantum Theory in Terms of "Hidden" Variables. I
- An automorphism of product measures
- Discreteness of area and volume in quantum gravity
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- NP is as easy as detecting unique solutions
- On the scaling of multidimensional matrices
- Quantum computations: algorithms and error correction
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
- Speakable and unspeakable in quantum mechanics
- Strengths and Weaknesses of Quantum Computing
- Transformations of diffusion and Schrödinger processes
- Two-particle interference in standard and Bohmian quantum mechanics
Cited in
(14)- Quantum deduction rules
- Quantum approaches to graph colouring
- Clifford gates in the Holant framework
- Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling
- Subspace projection method for unstructured searches with noisy quantum oracles using a signal-based quantum emulation device
- Scaling a Unitary Matrix
- Divisible quantum dynamics satisfies temporal Tsirelson's bound
- Kolmogorov proof of the Clauser, Horne, Shimony and Holt inequalities
- A simplified basis for Bell-Kochen-Specker theorems
- On the power of statistical zero knowledge
- On bipartite unitary matrices generating subalgebra-preserving quantum operations
- Quantum computation using action variables
- On the need for large quantum depth
- Oracle separations for non-adaptive collapse-free quantum computing
This page was built for publication: Quantum computing and hidden variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3102441)
