Implementation of Grover’s quantum search algorithm in a scalable system
Authors:
- 30 November 2005
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 72 (5) , 050306
Abstract
We report the implementation of Grover’s quantum search algorithm in the scalable system of trapped atomic ion quantum bits. Any one of four possible states of a two-qubit memory is marked, and following a single query of the search space, the marked element is successfully recovered with an average probability of 60(2)%. This exceeds the performance of any possible classical search algorithm, which can only succeed with a maximum average probability of 50%.Keywords
All Related Versions
This publication has 27 references indexed in Scilit:
- Implementing Grover’s quantum search on a para-hydrogen based pure state NMR quantum computerChemical Physics Letters, 2004
- Comment on “Grover search with pairs of trapped ions”Physical Review A, 2004
- Grover search with pairs of trapped ionsPhysical Review A, 2001
- Nested quantum search and structured problemsPhysical Review A, 2000
- Grover's search algorithm: An optical approachJournal of Modern Optics, 2000
- Implementation of a quantum search algorithm on a quantum computerNature, 1998
- Experimental Implementation of Fast Quantum SearchingPhysical Review Letters, 1998
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997
- Quantum Mechanics Helps in Searching for a Needle in a HaystackPhysical Review Letters, 1997
- Searching a Quantum Phone BookScience, 1997