Simple implementation of a quantum search with trapped ions
arXiv:0909.5401 · doi:10.1103/PhysRevA.78.030301
Abstract
We propose an ion trap implementation of Grover's quantum search algorithm for an unstructured database of arbitrary length N. The experimental implementation is appealingly simple because the linear ion trap allows for a straightforward construction, in a single interaction step and without a multitude of Hadamard transforms, of the reflection operator, which is the engine of the Grover algorithm. Consequently, a dramatic reduction in the number of the required physical steps takes place, to just O(\sqrt{N}), the same as the number of the mathematical steps. The proposed setup allows for demonstration of both the original (probabilistic) Grover search and its deterministic variation, and is remarkably robust to imperfections in the register initialization.
References in corpus (28)
- Quantum Mechanics helps in searching for a needle in a haystack
- Scalable multi-particle entanglement of trapped ions
- Quantum computers can search rapidly by using almost any transformation
- Quantum dynamics of cold trapped ions, with application to quantum computation
- Implementation of a Quantum Search Algorithm on a Nuclear Magnetic Resonance Quantum Computer
- Heating of trapped ions from the quantum ground state
- Grover Algorithm with zero theoretical failure rate
- Cooling the Collective Motion of Trapped Ions to Initialize a Quantum Register
- Implementation of Grover's Quantum Search Algorithm in a Scalable System
- Implementation of quantum search algorithm using classical Fourier optics
- Quantum search without entanglement
- Grover's Quantum Search Algorithm for an Arbitrary Initial Amplitude Distribution
- Implementation of a three-quantum-bit search algorithm
- A Magnetic Resonance Realization of Decoherence-Free Quantum Computation
- Generation of Symmetric Dicke States of Remote Qubits with Linear Optics
- Tavis-Cummings model and collective multi-qubit entanglement in trapped ions
- Coherent pulsed excitation of degenerate multistate systems: Exact analytic solutions
- Engineering of arbitrary U(N) transformations by quantum Householder reflections
- Grover search with pairs of trapped ions
- Tradeoffs in the Quantum Search Algorithm
- Experimental realization of a continuous version of the Grover algorithm
- Robust creation of arbitrary-sized Dicke states using a single laser pulse
- Decoherence-free preparation of Dicke states of trapped ions by collective stimulated Raman adiabatic passage
- Physical realization of coupled Hilbert-space mirrors for quantum-state engineering
- Navigation between quantum states by quantum mirrors
- Selective Control of the Symmetric Dicke Subspace in Trapped Ions
- A General SU(2) Formulation for Quantum Searching with Certainty
- Comment on 'Grover Search with Pairs of Trapped Ions'
Cited by in corpus (8)
- Time-efficient implementation of quantum search with qudits
- Parametrizations of density matrices
- Scalable quantum search using trapped ions
- A single-interaction step implementation of a quantum search in coupled micro-cavities
- Solution to Satisfiability problem by a complete Grover search with trapped ions
- Optimization of probabilistic quantum search algorithm with a priori information
- Fault-tolerant composite Householder reflection
- Fixed-point quantum continuous search algorithm with optimal query complexity