Quantum search without entanglement
- 8 December 1999
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 61 (1) , 010301
- https://doi.org/10.1103/physreva.61.010301
Abstract
Entanglement of quantum variables is usually thought to be a prerequisite for obtaining quantum speedups of information processing tasks such as searching databases. This paper presents methods for quantum search that give a speedup over classical methods, but that do not require entanglement. These methods rely instead on interference to provide a speedup. Search without entanglement comes at a cost: although they outperform analogous classical devices, the quantum devices that perform the search are not universal quantum computers and require exponentially greater overhead than a quantum computer that operates using entanglement. Quantum search without entanglement is compared to classical search using waves.Keywords
All Related Versions
This publication has 36 references indexed in Scilit:
- Single quantum querying of a databasePhysical Review A, 1998
- Implementation of a quantum algorithm on a nuclear magnetic resonance quantum computerThe Journal of Chemical Physics, 1998
- Optical simulation of quantum logicPhysical Review A, 1998
- Quantum mechanical interaction-free measurementsFoundations of Physics, 1993
- Information is PhysicalPhysics Today, 1991
- Quantum Mechanical Hamiltonian Models of ComputersaAnnals of the New York Academy of Sciences, 1986
- Computation and physics: Wheeler's meaning circuit?Foundations of Physics, 1986
- Quantum mechanical computersFoundations of Physics, 1986
- Quantum mechanical hamiltonian models of turing machinesJournal of Statistical Physics, 1982
- Uncertainty principle and minimal energy dissipation in the computerInternational Journal of Theoretical Physics, 1982