Discrimination against or in favor of qubits in quantum theory

2020/04/09 by Arkady Bolotin, Bolotin, Arkady
Computer Science · Mathematics · Physics and Astronomy · #FOS: Physical sciences #Mathematical Physics (math-ph) #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph) #math-ph #math.MP #quant-ph

paper · pdf · doi:10.48550/arxiv.2004.04313

24 pages

arxiv created 2020/04/09 · openalex publication_date 2020/04/09 · arxiv updated 2020/04/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Within context of quantum logic, it is possible to assign dispersion-free probabilities to experimental propositions pertaining to qubits. This makes qubits distinct from the rest of quantum systems since the latter do not admit probabilities having only values 0 and 1. The present paper shows that erasing qubit discrimination leads to a model of computation which permits execution of many primitive operations in a massive parallel way. In the paper, it is demonstrated that such a model (that can be called a quantum parallel random-access machine, QPRAM) is quantum mechanically plausible.

Citations

• Quantum states and generalized observables: a simple proof of Gleason's theorem
• The Logic of Quantum Mechanics

Related

• A Generalization of Deutsch's Example
• Quantum Parallelism in Quantum Information Processing
• Architectures for a quantum random access memory
• Equal cost of computation for truth and falsity of experimental quantum propositions necessitates quantum parallel computing
• Quantum parallelism may be limited