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

Addendum to “Grover search with pairs of trapped ions”

Zhenyu Xu, Mang Feng

Published Jul 7, 2008• 5 citations
Publisher

Abstract

The authors call attention to a previous work [M. Feng, Phys. Rev. A 63, 052308 (2001)] for Grover search by trapped ions in decoherence-free subspace (DFS). A scheme for a two-qubit conditional-phase flip gate in DFS is presented as a supplement.
DOI
10.1103/physreva.78.014301

Related papers

Comment on “Grover search with pairs of trapped ions”

Charles D. Hill, Hsi‐Sheng Goan

In this Comment on Feng's paper [Phys. Rev. A 63, 052308 (2001)], we show that Grover's algorithm may be performed exactly using the gate set given, provided that small changes are made to the gate sequence. An analytic expression for the probability of success of Grover's algorithm for any unitary operator $U$ instead of Hadamard gate is presented.

arXiv:quant-ph/0403059•Physical Review A•May 17, 2004•7 citations

Grover search with pairs of trapped ions

Mang Feng

The desired interference required for quantum computing may be modified by wave-function oscillations for the implementation of quantum algorithms [Phys. Rev. Lett. 84, 1615 (2000)]. To diminish such a detrimental effect, we propose a scheme with trapped ion pairs as qubits and apply the scheme to the Grover search. It will be shown that our scheme cannot only carry out a full Grover search, but can also meet the requirement for scalable hot-ion quantum computing. Moreover, the ion-pair qubits in our scheme are more robust against decoherence and the dissipation caused by the environment than single-particle qubits proposed before.

arXiv:quant-ph/0102122•Physical Review A•Apr 17, 2001•69 citations

A universal set of quantum gates on trapped ions in a decoherence-free subspace

Hartmut Häffner, Kihwan Kim, Thomas Monz +7 more

Pairs of trapped ions can store quantum information four orders of magnitude longer than single ions. We will discuss the realization of a universal set of quantum gates acting on such a decoherence-free suspace.

International Conference on Quantum Information•Jan 1, 2008•0 citations

Complete 3-Qubit Grover Search with Trapped Ions

Caroline Figgatt, Dmitri Maslov, Norbert M. Linke +3 more

Bulletin of the American Physical Society•Jun 9, 2017•0 citations

Addendum to “Quantum theory of the stability region of an ion in a Paul trap”

L.-L. Yan, Mang Feng, K. Wang

The authors call attention to a previous work [Kelin Wang, Mang Feng, and Juhao Wu, Phys. Rev. A 52, 1419 (1995)] for quantum-mechanically studying the stability region of the Paul trap, where the calculation does not work for the case of zero dc voltage. But the ions can be confined experimentally at zero dc voltage which is understandable via the Mathieu equation. We present a quantum-mechanical study for such a case as a supplement.

Physical Review A•Mar 10, 2014•3 citations

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

Wan-Li Yang, Hua Wei, Changyong Chen +1 more

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.

arXiv:0809.3053•Journal of the Optical Society of America B•Sep 25, 2008•8 citations
In this Comment on Feng's paper [Phys. Rev. A 63, 052308 (2001)], we show that Grover's algorithm may be performed exactly using the gate set given, provided that small changes are made to the gate sequence. An analytic expression for the probability of success of Grover's algorithm for any unitary operator UUU instead of Hadamard gate is presented.
The desired interference required for quantum computing may be modified by wave-function oscillations for the implementation of quantum algorithms [Phys. Rev. Lett. 84, 1615 (2000)]. To diminish such a detrimental effect, we propose a scheme with trapped ion pairs as qubits and apply the scheme to the Grover search. It will be shown that our scheme cannot only carry out a full Grover search, but can also meet the requirement for scalable hot-ion quantum computing. Moreover, the ion-pair qubits in our scheme are more robust against decoherence and the dissipation caused by the environment than single-particle qubits proposed before.
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.