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

Chinese journal of atomic and molecular physics

A SCHEME FOR REALIZING TWO BIT QUANTUM SEARCH IN AN ION TRAP

Xiwen Zhu

Published Jan 1, 1999• 0 citations
OpenAlex

Abstract

The construction of unitary matrixes for quantum computation by means of red and blue detuning transitions in an ion trap is first discussed. Then, with these matrixes, a scheme for realizing a two bit quantum search is proposed.

Related papers

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 State Preparation via Ion Trap Quantum Computing and Quantum Searching Algorithm

Zeng Hao-Sheng, Kuang Le-Man

We present a scheme to-prepare a quantum state in an ion trap with probability approaching to one by means of ion trap quantum computing and Grover's quantum search algorithm acting on trapped ions.

arXiv:quant-ph/0005036•Communications in Theoretical Physics•Jan 30, 2000•5 citations

A scheme for realizing the quantum discrete Fourier transform in the ion trap

Jiang Yu

Under the framework of the Cirac Zoller model, a scheme for realizing the quantum discrete Fourier transform in the ion trap by some unitary operations is discussed. Since any operation in the quantum computing can be decomposed into a series of two basic operations, our scheme focusing on the problem of one qubit and two qubit is actually valid for treating many qubit problem.

Chinese journal of atomic and molecular physics•Jan 1, 2000•0 citations

Ion Trap Proposal for Quantum Search

Joonwoo Bae, Younghun Kwon

In this letter, we show that the laser Hamiltonian can perform the quantum search. We also show that the process of quantum search is a resonance between the initial state and the target state, which implies that Nature already has a quantum search system to use a transition of energy. In addition, we provide the particular scheme to implement the quantum search algorithm based on a trapped ion.

arXiv:quant-ph/0204154•Apr 26, 2002•0 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•68 citations

Schemes of Quantum Computations with Trapped Ions

J. F. Poyatos, J. I. Cirac, P. Zoller

The purpose of this article is to review two complementary schemes for quantum computation with trapped ions. We initially discuss the first proposal of quantum computations with cold trapped ions (J. I. Cirac and P. Zoller; Phys. Rev. Lett. 74, 4091, 1995) which requires, prior to any computation, laser cooling to the motional ground state. This proposal is closely related to the physics of generating and manipulating N-particles entangled states in both ion traps and high-Q cavities (cavity quantum electrodynamics). The second scheme is that of quantum computations with hot trapped ions (J.F. Poyatos, J.I. Cirac and P. Zoller; Phys. Rev. Lett. 81, 1322, 1998) which works at finite temperature and resembles physical ideas found in atom interferometry.

Fortschritte der Physik•Sep 1, 2000•6 citations
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.
The purpose of this article is to review two complementary schemes for quantum computation with trapped ions. We initially discuss the first proposal of quantum computations with cold trapped ions (J. I. Cirac and P. Zoller; Phys. Rev. Lett. 74, 4091, 1995) which requires, prior to any computation, laser cooling to the motional ground state. This proposal is closely related to the physics of generating and manipulating N-particles entangled states in both ion traps and high-Q cavities (cavity quantum electrodynamics). The second scheme is that of quantum computations with hot trapped ions (J.F. Poyatos, J.I. Cirac and P. Zoller; Phys. Rev. Lett. 81, 1322, 1998) which works at finite temperature and resembles physical ideas found in atom interferometry.