Quantum computing and hidden variables
From MaRDI portal
Publication:3102441
DOI10.1103/PhysRevA.71.032325zbMath1227.81110arXivquant-ph/0408035MaRDI QIDQ3102441
Publication date: 4 December 2011
Published in: Physical Review A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0408035
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (11)
Scaling a Unitary Matrix ⋮ Subspace projection method for unstructured searches with noisy quantum oracles using a signal-based quantum emulation device ⋮ Kolmogorov proof of the Clauser, Horne, Shimony and Holt inequalities ⋮ Divisible quantum dynamics satisfies temporal Tsirelson’s bound ⋮ On the Power of Statistical Zero Knowledge ⋮ A simplified basis for Bell-Kochen-Specker theorems ⋮ On bipartite unitary matrices generating subalgebra-preserving quantum operations ⋮ Clifford gates in the Holant framework ⋮ Quantum deduction rules ⋮ Better and simpler error analysis of the Sinkhorn-Knopp algorithm for matrix scaling ⋮ Quantum approaches to graph colouring
Cites Work
- Unnamed Item
- Unnamed Item
- An automorphism of product measures
- NP is as easy as detecting unique solutions
- Transformations of diffusion and Schrödinger processes
- On the scaling of multidimensional matrices
- Discreteness of area and volume in quantum gravity
- A complete problem for statistical zero knowledge
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
- Quantum computations: algorithms and error correction
- Strengths and Weaknesses of Quantum Computing
- Two-particle interference in standard and Bohmian quantum mechanics
- A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices
- A Suggested Interpretation of the Quantum Theory in Terms of "Hidden" Variables. I
- A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
This page was built for publication: Quantum computing and hidden variables
