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

arXiv:0809.3053 · Journal of the Optical Society of America B

Implementation of a many-qubit Grover search with trapped ultracold ions

Wan-Li Yang, Hua Wei, Changyong Chen, Mang Feng

Published Sep 25, 2008• 8 citations
arXivHTMLPDF

Abstract

We propose a potentially practical scheme for realization of an n-qubit (n>2) conditional phase flip (CPF) gate and implementation of Grover's search algorithm in an ion-trap system. We demonstrate, both analytically and numerically, that our scheme could be achieved efficiently to find a marked state with high fidelity and high success probability. We also show the merits of the proposal that the increase of the ion number can improve the fidelity and success probability of the CPF gate. The required operations for a Grover search are very close to the capabilities of current ion-trap techniques.

DOI
10.1364/josab.25.001720

Related papers

Implementation of a many-qubit Grover search by cavity QED

Fan Hao-Quan, Yang Wan-Li, Huang Xue-Ren +1 more

We explore the possibility of an N -qubit ( N > 3) Grover search in cavity QED, based on a fast operation of an N -qubit controlled phase-flip with atoms in resonance with the cavity mode. We demonstrate both analytically and numerically that our scheme can be achieved efficiently to find a marked state with high fidelity and high success probability. As an example, a ten-qubit Grover search is simulated specifically under the discussion of experimental feasibility and challenge. We argue that our scheme is applicable to the case involving an arbitrary number of qubits. As cavity decay is involved in our quantum trajectory treatment, we can analytically understand the implementation of a Grover search subject to dissipation, which will be very helpful for relevant experiments.

arXiv:0808.2874•Chinese Physics B•Nov 1, 2009•2 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•253 citations

Scheme forN-Qubit Toffoli Gate by Transport of Trapped Ultracold Ions

Yang Wan-Li, Wei Hua, Changyong Chen

We propose a potentially practical scheme for implementing an n-qubit Toffoli gate by elaborately controlling the transport of ultracold ions through stationary laser beams. Conditioned on the uniform ionic transport velocity, the n-qubit Toffoli gate can be realized with high fidelity and high successful probability under current experimental conditions,which depends on a single resonant interaction with n trapped ions and has constant implementation time with the increase of qubits. We show that the increase of the ion number can improve the fidelity and the successful probability of the Toffoli gate.

Communications in Theoretical Physics•Nov 1, 2008•1 citation

Grover search algorithm in an ion trap system

Zheng Shi-Biao

Two schemes for the implementation of the two-qubit Grover search algorithm in the ion trap system are proposed. These schemes might be experimentally realizable with presently available techniques. The experimental implementation of the schemes would be an important step toward more complex quantum computation in the ion trap system.

Chinese Physics•Oct 31, 2005•12 citations

Efficient implementation of a quantum algorithm with a trapped ion qudit

Xiaoyang Shi, Jasmine Sinanan-Singh, Timothy Burke +2 more

Demonstration of quantum advantage remains challenging due to the increased overhead of controlling large quantum systems. While significant effort has been devoted to qubit-based devices, qudits (d-level systems) offer potential advantages in both hardware efficiency and algorithmic performance. In this paper, we demonstrate multi-tone control of a single trapped ion qudit of up to eight levels, as well as the implementation of Grover’s search algorithm on a qudit with dimensions five and eight, achieving operation fidelity of 96.8(3)% and 69(6)%, respectively, which correspond to 99.9(1)% and 97.1(3) % squared statistical overlap, respectively, with the expected result for a single iteration of the Grover search algorithm. The performance is competitive when compared to qubit-based systems; moreover, the sequence requires only $${{{\mathcal{O}}}}(d)$$ single-qudit gates and no entangling gates. This work highlights the potential of using qudits for efficient implementations of quantum algorithms. The authors demonstrate high-fidelity multi-tone electronic control of trapped-ion qudits up to d=8 levels, enabling efficient SU(d) operations and showcasing advantage by implementing Grover’s search algorithm using encoding in a single qudit, rather than in multiple qubits.

arXiv:2506.09371•Nature Communications•Jan 21, 2026•19 citations

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

Kathy-Anne Brickman, P. C. Haljan, P. J. Lee +3 more

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

arXiv:quant-ph/0510066•Physical Review A•Nov 30, 2005•183 citations
We propose a potentially practical scheme for realization of an n-qubit (n>2) conditional phase flip (CPF) gate and implementation of Grover's search algorithm in an ion-trap system. We demonstrate, both analytically and numerically, that our scheme could be achieved efficiently to find a marked state with high fidelity and high success probability. We also show the merits of the proposal that the increase of the ion number can improve the fidelity and success probability of the CPF gate. The required operations for a Grover search are very close to the capabilities of current ion-trap techniques.
We explore the possibility of an N -qubit ( N > 3) Grover search in cavity QED, based on a fast operation of an N -qubit controlled phase-flip with atoms in resonance with the cavity mode. We demonstrate both analytically and numerically that our scheme can be achieved efficiently to find a marked state with high fidelity and high success probability. As an example, a ten-qubit Grover search is simulated specifically under the discussion of experimental feasibility and challenge. We argue that our scheme is applicable to the case involving an arbitrary number of qubits. As cavity decay is involved in our quantum trajectory treatment, we can analytically understand the implementation of a Grover search subject to dissipation, which will be very helpful for relevant experiments.
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.
We propose a potentially practical scheme for implementing an n-qubit Toffoli gate by elaborately controlling the transport of ultracold ions through stationary laser beams. Conditioned on the uniform ionic transport velocity, the n-qubit Toffoli gate can be realized with high fidelity and high successful probability under current experimental conditions,which depends on a single resonant interaction with n trapped ions and has constant implementation time with the increase of qubits. We show that the increase of the ion number can improve the fidelity and the successful probability of the Toffoli gate.
Demonstration of quantum advantage remains challenging due to the increased overhead of controlling large quantum systems. While significant effort has been devoted to qubit-based devices, qudits (d-level systems) offer potential advantages in both hardware efficiency and algorithmic performance. In this paper, we demonstrate multi-tone control of a single trapped ion qudit of up to eight levels, as well as the implementation of Grover’s search algorithm on a qudit with dimensions five and eight, achieving operation fidelity of 96.8(3)% and 69(6)%, respectively, which correspond to 99.9(1)% and 97.1(3) % squared statistical overlap, respectively, with the expected result for a single iteration of the Grover search algorithm. The performance is competitive when compared to qubit-based systems; moreover, the sequence requires only O(d){{{\mathcal{O}}}}(d)O(d) single-qudit gates and no entangling gates. This work highlights the potential of using qudits for efficient implementations of quantum algorithms. The authors demonstrate high-fidelity multi-tone electronic control of trapped-ion qudits up to d=8 levels, enabling efficient SU(d) operations and showcasing advantage by implementing Grover’s search algorithm using encoding in a single qudit, rather than in multiple qubits.