1 August 2002 Quantum algorithms
Author Affiliations +
Proceedings Volume 4732, Photonic and Quantum Technologies for Aerospace Applications IV; (2002); doi: 10.1117/12.477420
Event: AeroSense 2002, 2002, Orlando, FL, United States
Abstract
I review a few of the most famous quantum algorithms, and discuss them from a practical perspective. What should a quantum system be able to do, in principle, to qualify as a quantum computer for which these algorithms work? The role of superposition, parallelism, and entanglement is discussed.
© (2002) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Bilha Segev, "Quantum algorithms", Proc. SPIE 4732, Photonic and Quantum Technologies for Aerospace Applications IV, (1 August 2002); doi: 10.1117/12.477420; https://doi.org/10.1117/12.477420
PROCEEDINGS
10 PAGES


SHARE
KEYWORDS
Quantum communications

Quantum computing

Superposition

Fourier transforms

Entangled states

Algorithms

Computing systems

RELATED CONTENT

Vibrational decoherence in ion-trap quantum computers
Proceedings of SPIE (July 06 1998)
Quantum decoherence and qubit devices
Proceedings of SPIE (May 08 2003)
Is quantum parallelism real?
Proceedings of SPIE (April 03 2008)
TUTORIAL: Quantum computing with Rydberg atoms
Proceedings of SPIE (October 24 2005)
Cavity-QED-based quantum computing
Proceedings of SPIE (August 04 2003)

Back to Top