3 April 2008 Is quantum parallelism real?
Author Affiliations +
Abstract
In this paper we raise questions about the reality of computational quantum parallelism. Such questions are important because while quantum theory is rigorously established, the hypothesis that it supports a more powerful model of computation remains speculative. More specifically, we suggest the possibility that the seeming computational parallelism offered by quantum superpositions is actually effected by gate-level parallelism in the reversible implementation of the quantum operator. In other words, when the total number of logic operations is analyzed, quantum computing may not be more powerful than classical. This fact has significant public policy implications with regard to the relative levels of effort that are appropriate for the development of quantumparallel algorithms and associated hardware (i.e., qubit-based) versus quantum-scale classical hardware.
© (2008) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Marco Lanzagorta, Jeffrey Uhlmann, "Is quantum parallelism real?", Proc. SPIE 6976, Quantum Information and Computation VI, 69760W (3 April 2008); doi: 10.1117/12.778019; https://doi.org/10.1117/12.778019
PROCEEDINGS
7 PAGES


SHARE
RELATED CONTENT

Quantum computation
Proceedings of SPIE (September 01 1996)
Quantum algorithms
Proceedings of SPIE (August 01 2002)
Quantum models of Parrondo's games
Proceedings of SPIE (November 13 2002)
Quantum algorithms for optimal graph traversal problems
Proceedings of SPIE (April 25 2007)

Back to Top