Certainty and Uncertainty in Quantum Information Processing
arXiv:quant-ph/0702121
Abstract
This survey, aimed at information processing researchers, highlights intriguing but lesser known results, corrects misconceptions, and suggests research areas. Themes include: certainty in quantum algorithms; the "fewer worlds" theory of quantum mechanics; quantum learning; probability theory versus quantum mechanics.
Invited paper accompanying invited talk to AAAI Spring Symposium 2007. Comments, corrections, and suggestions would be most welcome
References in corpus (16)
- Three qubits can be entangled in two inequivalent ways
- Efficient classical simulation of slightly entangled quantum computations
- Measurement-based quantum computation with cluster states
- Strengths and Weaknesses of Quantum Computing
- Exponential algorithmic speedup by quantum walk
- Simulating quantum computation by contracting tensor networks
- Characterizing Entanglement
- Quantum computers can search arbitrarily large databases by a single query
- Cluster-state quantum computation
- Sophisticated quantum search without entanglement
- Approximation by Quantum Circuits
- Quantum walks on quotient graphs
- Improved Bounds on Quantum Learning Algorithms
- Improved quantum algorithms for the ordered search problem via semidefinite programming
- The quantum FFT can be classically simulated
- Are Quantum States Exponentially Long Vectors?