Implementation of Grover’s quantum search algorithm in a scalable system

2005/10/25 by K. -A. Brickman, Kathy-Anne Brickman, P. C. Haljan +5 · 3 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Computer science #Laser-Matter Interactions and Applications #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum algorithm #Quantum mechanics #Qubit #Scalability #Search algorithm #Theoretical computer science #quant-ph

paper · pdf · doi:10.1103/physreva.72.050306

4 pages, 3 figures, updated error discussion

arxiv created 2005/10/25 · openalex publication_date 2005/11/30 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05

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%.

Citations

• Tight Bounds on Quantum Searching
• Deterministic quantum teleportation with atoms
• Implementing Grover’s quantum search on a para-hydrogen based pure state NMR quantum computer
• Atomic qubit manipulations with an electro-optic modulator
• Elementary gates for quantum computation
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

Cited by

• Counterfactual quantum computation through quantum interrogation
• Quantum Associative Memory with Improved Distributed Queries
• Colloquium: Trapped ions as quantum bits: Essential numerical tools