Many worlds, the cluster-state quantum computer, and the problem of the preferred basis

DOI10.1016/j.shpsb.2011.11.007zbMath1281.81003arXiv1110.2514OpenAlexW2171064311MaRDI QIDQ2436209

Michael E. Cuffaro

Publication date: 21 February 2014

Published in: Studies in History and Philosophy of Science. Part B. Studies in History and Philosophy of Modern Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.2514

zbMATH Keywords

quantum mechanicsquantum computationcluster stateone-waymany worldsquantum parallelismpreferred basis problemEverettian interpretationmeasurement-basedquantum speed-up

Mathematics Subject Classification ID

General and philosophical questions in quantum theory (81P05) Quantum computation (81P68) Quantum measurement theory, state operations, state preparations (81P15) Physics (00A79) Quantum coherence, entanglement, quantum correlations (81P40)

Related Items (1)

Universality, Invariance, and the Foundations of Computational Complexity in the Light of the Quantum Computer

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Worlds in the Everett interpretation
• A quantum computer only needs one universe
• Everett and structure
• An introduction to many worlds in quantum computation
• Cluster-state quantum computation
• Time, quantum mechanics, and decoherence.
• One complexity theorist's view of quantum computing
• The elusive source of quantum speedup
• UNITARY-CIRCUIT SEMANTICS FOR MEASUREMENT-BASED COMPUTATIONS
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• On the role of entanglement in quantum-computational speed-up
• Quantum Computer Science
• Quantum Computing Explained

This page was built for publication: Many worlds, the cluster-state quantum computer, and the problem of the preferred basis