Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physical Review A

Quantum search in a nonclassical database of trapped ions

I. E. Linington, Peter A. Ivanov, Nikolay V. Vitanov

Published Jan 26, 2009• 14 citations
Publisher

Abstract

We propose an implementation of the Grover's search algorithm in a nonclassical database using a linear chain of trapped ions. The database comprises all collective states with two ionic excitations; hence the number of database entries scales quadratically with the number of ions $N$. The system is initialized in an even superposition of all register states, i.e., in the symmetric Dicke state with $N$ ions sharing two excitations. The reflection-about-the-mean operator is produced merely by global addressing of the ion string by an off-resonant pulse with a suitable area, whereas the oracle operator is a control-phase gate. This simplification should allow a demonstration of quantum search in a database of hundreds of elements without needing to synthesize multiqubit quantum gates. The technique does not rely on coherent addition or subtraction of phonons, and hence the ion chain can be sympathetically cooled throughout the process.

DOI
10.1103/physreva.79.012322

Related papers

Scalable quantum search using trapped ions

Svetoslav S. Ivanov, Peter A. Ivanov, I. E. Linington +1 more

We propose a scalable implementation of Grover's quantum search algorithm in a trapped-ion quantum information processor. The system is initialized in an entangled Dicke state by using adiabatic techniques. The inversion-about-average and oracle operators take the form of single off-resonant laser pulses. This is made possible by utilizing the physical symmetries of the trapped-ion linear crystal. The physical realization of the algorithm represents a dramatic simplification: each logical iteration (oracle and inversion about average) requires only two physical interaction steps, in contrast to the large number of concatenated gates required by previous approaches. This not only facilitates the implementation but also increases the overall fidelity of the algorithm.

arXiv:1002.3246•Physical Review A•Apr 29, 2010•24 citations

Simple implementation of a quantum search with trapped ions

Svetoslav S. Ivanov, Peter A. Ivanov, Nikolay V. Vitanov

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

arXiv:0909.5401•Physical Review A•Sep 4, 2008•17 citations

Phonon-mediated entanglement for trapped ion quantum computing

K-A Brickman Soderberg, Christopher R. Monroe

Trapped ions are a near ideal system to study quantum information processing due to the high degree of control over the ion's external confinement and internal degrees of freedom. We demonstrate the key steps necessary for trapped ion quantum computing and focus on phonon-mediated entangling gates. We highlight several key algorithms implemented over the last decade with these gates and give a detailed description of Grover's quantum database search implemented with two trapped ion qubits.

Reports on Progress in Physics•Feb 23, 2010•28 citations

Complete 3-Qubit Grover search on a programmable quantum computer

Caroline Figgatt, Dmitri A Maslov, K. A. Landsman +3 more

The Grover quantum search algorithm is a hallmark application of a quantum computer with a well-known speedup over classical searches of an unsorted database. Here, we report results for a complete three-qubit Grover search algorithm using the scalable quantum computing technology of trapped atomic ions, with better-than-classical performance. Two methods of state marking are used for the oracles: a phase-flip method employed by other experimental demonstrations, and a Boolean method requiring an ancilla qubit that is directly equivalent to the state marking scheme required to perform a classical search. We also report the deterministic implementation of a Toffoli-4 gate, which is used along with Toffoli-3 gates to construct the algorithms; these gates have process fidelities of 70.5% and 89.6%, respectively.

arXiv:1703.10535•Nature Communications•Nov 28, 2017•235 citations

Implementation of Grover's Quantum Search Algorithm with Two Trapped Cadmium Ions.

Kathy-Anne Brickman

Over the past decade, the field of trapped ion quantum computing has emerged as one of the leaders in quantum information processing due the level of manipulation available and the long coherence times possible in the system. As this thesis will demonstrate, all of the necessary building blocks for a quantum computer have been exhibited in ion traps and small scale quantum algorithms have been implemented. In this trapped ion system, quantum bits consist of the first order magnetic field insensitive ground state hyperfine levels of $^{111}$Cd$^+$. The qubits are manipulated via resonant and off-resonant coherent laser interactions. We experimentally realize Grover's quantum search algorithm over a 4 element database with n=2 trapped $^{111}$Cd$^+$ ion qubits. One of the four states is marked, and with a single query it is recovered, on average, with 60% probability. This exceeds the performance of any possible classical search, which can only succeed with 50% probability following a single query. The algorithm consists of two Molmer-Sorensen entangling gates, that utilize bichromatic stimulated Raman transitions to create a spin dependent force, paired with several single-qubit rotations and near-perfect qubit measurements. The spectral arrangement of the Raman beams is tailored to suppress phase noise accumulation between gates. This suppression is critical for reliably performing consecutive operations during the algorithm. Additionally, this thesis discusses the possibility of combining trapped ions with trapped neutral atoms for the purpose studying ultra-cold charge exchange interactions. It may be possible to conceal quantum information, initially prepared in an ionic qubit, inside a pure nuclear spin qubit for the purpose of transportation and storage. As a first step, we present the laser-cooling and confinement of Cd atoms in a magneto-optical trap, and characterize the loading process from the background Cd vapor. The trapping laser drives the $^{1}S_{0}$~$rightarrow$~$^{1}P_{1}$ transition at 229 nm in this two valence electron atom and also photoionizes atoms directly from the $^{1}P_{1}$ state. This photoionization dominates other loss mechanisms and allows a direct measurement of the photoionization cross section.

•Jan 1, 2007•2 citations

Building and Programming a Universal Ion Trap Quantum Computer

Caroline Figgatt

Quantum computing represents an exciting frontier in the realm of information processing; it is a promising technology that may provide future advances in a wide range of fields, from quantum chemistry to optimization problems. This thesis discusses experimental results for several quantum algorithms performed on a programmable quantum computer consisting of a linear chain of five or seven trapped 171Yb+ atomic clock ions with long coherence times and high gate fidelities. We execute modular one- and two-qubit computation gates through Raman transitions driven by a beat note between counter-propagating beams from a pulsed laser. The system's individual addressing capability provides arbitrary single-qubit rotations as well as all possible two-qubit entangling gates, which are implemented using a pulse-segmentation scheme. The quantum computer can be programmed from a high-level interface to execute arbitrary quantum circuits, and comes with a toolbox of many important composite gates and quantum subroutines. We present experimental results for a complete three-qubit Grover quantum search algorithm, a hallmark application of a quantum computer with a well-known speedup over classical searches of an unsorted database, and report better-than-classical performance. The algorithm is performed for all 8 possible single-result oracles and all 28 possible two-result oracles. All quantum solutions are shown to outperform their classical counterparts. Performing parallel operations will be a powerful capability as deeper circuits on larger, more complex quantum computers present new challenges. Here, we perform a pair of 2-qubit gates simultaneously in a single chain of trapped ions. We employ a pre-calculated pulse shaping scheme that modulates the phase and amplitude of the Raman transitions to drive programmable high-fidelity 2-qubit entangling gates in parallel by coupling to the collective modes of motion of the ion chain. Ensuring the operation yields only spin-spin interactions between the desired pairs, with neither residual spin-motion entanglement nor crosstalk spin-spin entanglement, is a nonlinear constraint problem, and pulse solutions are found using optimization techniques. As an application, we demonstrate the quantum full adder using a depth-4 circuit requiring the use of parallel 2-qubit operations.

•Jan 1, 2018•1 citation
We propose an implementation of the Grover's search algorithm in a nonclassical database using a linear chain of trapped ions. The database comprises all collective states with two ionic excitations; hence the number of database entries scales quadratically with the number of ions NNN. The system is initialized in an even superposition of all register states, i.e., in the symmetric Dicke state with NNN ions sharing two excitations. The reflection-about-the-mean operator is produced merely by global addressing of the ion string by an off-resonant pulse with a suitable area, whereas the oracle operator is a control-phase gate. This simplification should allow a demonstration of quantum search in a database of hundreds of elements without needing to synthesize multiqubit quantum gates. The technique does not rely on coherent addition or subtraction of phonons, and hence the ion chain can be sympathetically cooled throughout the process.
We propose a scalable implementation of Grover's quantum search algorithm in a trapped-ion quantum information processor. The system is initialized in an entangled Dicke state by using adiabatic techniques. The inversion-about-average and oracle operators take the form of single off-resonant laser pulses. This is made possible by utilizing the physical symmetries of the trapped-ion linear crystal. The physical realization of the algorithm represents a dramatic simplification: each logical iteration (oracle and inversion about average) requires only two physical interaction steps, in contrast to the large number of concatenated gates required by previous approaches. This not only facilitates the implementation but also increases the overall fidelity of the algorithm.
We propose an ion-trap implementation of Grover's quantum search algorithm for an unstructured database of arbitrary length NNN. 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(N)O(\sqrt{N})O(N​), the same as the number of 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.
Trapped ions are a near ideal system to study quantum information processing due to the high degree of control over the ion's external confinement and internal degrees of freedom. We demonstrate the key steps necessary for trapped ion quantum computing and focus on phonon-mediated entangling gates. We highlight several key algorithms implemented over the last decade with these gates and give a detailed description of Grover's quantum database search implemented with two trapped ion qubits.
The Grover quantum search algorithm is a hallmark application of a quantum computer with a well-known speedup over classical searches of an unsorted database. Here, we report results for a complete three-qubit Grover search algorithm using the scalable quantum computing technology of trapped atomic ions, with better-than-classical performance. Two methods of state marking are used for the oracles: a phase-flip method employed by other experimental demonstrations, and a Boolean method requiring an ancilla qubit that is directly equivalent to the state marking scheme required to perform a classical search. We also report the deterministic implementation of a Toffoli-4 gate, which is used along with Toffoli-3 gates to construct the algorithms; these gates have process fidelities of 70.5% and 89.6%, respectively.
Over the past decade, the field of trapped ion quantum computing has emerged as one of the leaders in quantum information processing due the level of manipulation available and the long coherence times possible in the system. As this thesis will demonstrate, all of the necessary building blocks for a quantum computer have been exhibited in ion traps and small scale quantum algorithms have been implemented. In this trapped ion system, quantum bits consist of the first order magnetic field insensitive ground state hyperfine levels of 111^{111}111Cd+^++. The qubits are manipulated via resonant and off-resonant coherent laser interactions. We experimentally realize Grover's quantum search algorithm over a 4 element database with n=2 trapped 111^{111}111Cd+^++ ion qubits. One of the four states is marked, and with a single query it is recovered, on average, with 60% probability. This exceeds the performance of any possible classical search, which can only succeed with 50% probability following a single query. The algorithm consists of two Molmer-Sorensen entangling gates, that utilize bichromatic stimulated Raman transitions to create a spin dependent force, paired with several single-qubit rotations and near-perfect qubit measurements. The spectral arrangement of the Raman beams is tailored to suppress phase noise accumulation between gates. This suppression is critical for reliably performing consecutive operations during the algorithm. Additionally, this thesis discusses the possibility of combining trapped ions with trapped neutral atoms for the purpose studying ultra-cold charge exchange interactions. It may be possible to conceal quantum information, initially prepared in an ionic qubit, inside a pure nuclear spin qubit for the purpose of transportation and storage. As a first step, we present the laser-cooling and confinement of Cd atoms in a magneto-optical trap, and characterize the loading process from the background Cd vapor. The trapping laser drives the 1S0^{1}S_{0}1S0​~rightarrowrightarrowrightarrow~1P1^{1}P_{1}1P1​ transition at 229 nm in this two valence electron atom and also photoionizes atoms directly from the 1P1^{1}P_{1}1P1​ state. This photoionization dominates other loss mechanisms and allows a direct measurement of the photoionization cross section.
Quantum computing represents an exciting frontier in the realm of information processing; it is a promising technology that may provide future advances in a wide range of fields, from quantum chemistry to optimization problems. This thesis discusses experimental results for several quantum algorithms performed on a programmable quantum computer consisting of a linear chain of five or seven trapped 171Yb+ atomic clock ions with long coherence times and high gate fidelities. We execute modular one- and two-qubit computation gates through Raman transitions driven by a beat note between counter-propagating beams from a pulsed laser. The system's individual addressing capability provides arbitrary single-qubit rotations as well as all possible two-qubit entangling gates, which are implemented using a pulse-segmentation scheme. The quantum computer can be programmed from a high-level interface to execute arbitrary quantum circuits, and comes with a toolbox of many important composite gates and quantum subroutines. We present experimental results for a complete three-qubit Grover quantum search algorithm, a hallmark application of a quantum computer with a well-known speedup over classical searches of an unsorted database, and report better-than-classical performance. The algorithm is performed for all 8 possible single-result oracles and all 28 possible two-result oracles. All quantum solutions are shown to outperform their classical counterparts. Performing parallel operations will be a powerful capability as deeper circuits on larger, more complex quantum computers present new challenges. Here, we perform a pair of 2-qubit gates simultaneously in a single chain of trapped ions. We employ a pre-calculated pulse shaping scheme that modulates the phase and amplitude of the Raman transitions to drive programmable high-fidelity 2-qubit entangling gates in parallel by coupling to the collective modes of motion of the ion chain. Ensuring the operation yields only spin-spin interactions between the desired pairs, with neither residual spin-motion entanglement nor crosstalk spin-spin entanglement, is a nonlinear constraint problem, and pulse solutions are found using optimization techniques. As an application, we demonstrate the quantum full adder using a depth-4 circuit requiring the use of parallel 2-qubit operations.