Are Quantum Computing Models Realistic?

Abstract

The commonly used circuit model of quantum computing leaves out the problems of imprecision in the initial state preparation, particle statistics (indistinguishability of particles belonging to the same quantum state), and error correction (current techniques cannot correct all small errors). The initial state in the circuit model computation is obtained by applying potentially imprecise Hadamard gate operations whereas useful quantum computation requires a state with no uncertainty. We review some limitations of the circuit model and speculate on the question if a hierarchy of quantum-type computing models exists.

9 pages with corrections

References in corpus (3)

• On the Power of One Bit of Quantum Information
• Introduction to NMR Quantum Information Processing
• Statistical Constraints on State Preparation for a Quantum Computer

Cited by in corpus (14)

• Information Complexity of Quantum Gates
• Single Neuron Memories and the Network's Proximity Matrix
• Variations on Kak's Three Stage Quantum Cryptography Protocol
• A Quasigroup Based Cryptographic System
• Uncertainty In Quantum Computation
• Difficulties in the Implementation of Quantum Computers
• Memory Capacity of Neural Networks using a Circulant Weight Matrix
• Memory Retrieved from Single Neurons
• Information and Errors in Quantum Teleportation
• Prospects for Quantum Computing
• Neural Network Capacity for Multilevel Inputs
• Representation of Entangled States
• Paradox of Quantum Information
• Information in Quantum Description and Gate Implementation