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

APS

Different Schemes of Quantum Computation with Cold Trapped Ions

Daniel F. V. James, Raymond Laflamme, Richard Hughes

Published Apr 1, 1997• 0 citations
OpenAlex

Related papers

Quantum dynamics of cold trapped ions with application to quantum computation

Daniel F. V. James

arXiv:quant-ph/9702053•Applied Physics B•Feb 1, 1998•635 citations

Eliminating the Effects of Spontaneous Emission in Quantum Computations with Cold Trapped Ions

Cassius D'Helon, Gerard J Milburn

Springer eBooks•Jan 1, 1997•1 citation

Ion traps and cold atoms for quantum computers

J. I. Cirac

Bulletin of the American Physical Society•Mar 16, 2006•0 citations

Implementation of quantum gates and preparation of entangled states in cavity QED with cold trapped ions

Mang Feng, Xiaoguang Wang

We propose a scheme to perform basic gates of quantum computing and prepare entangled states in a system with cold trapped ions located in a single-mode optical cavity. General quantum computing can be done with both the motional state of the trapped ion and cavity state being qubits. We can also generate different kinds of entangled states in such a system without state reduction, and can transfer quantum states from an ion in one trap to an ion in another trap. The experimental requirements for achieving our scheme are discussed.

arXiv:quant-ph/0112031•Journal of Optics B Quantum and Semiclassical Optics•Aug 5, 2002•28 citations

Quantum computation with trapped ions

Jürgen Eschner

•Jan 1, 2006•2 citations

Quantum Computing Experiments with Cold Trapped Ions

Ferdinand Schmidt‐Kaler, Ulrich Poschinger

The central challenges in trapped ion quantum computing are developing architectures for scalable quantum computing with trapped ions, and optimizing the gate fidelity and speed. This chapter discusses linear Paul traps and quantized eigenmodes of ion crystals in the harmonic trap potential. It explains the operations on the static linear qubit registers. The chapter also discusses ion-laser and ion-microwave interactions and give examples for ion species used for qubits. It outlines single-qubit gate operations and a number of different two-qubit gate schemes. The chapter describes the experimental realization of the Cirac-Zoller gate. Quantum logic operations have been combined in different ways to establish quantum algorithms. In order to exemplify the realization of elementary quantum algorithms, the chapter focuses on quantum teleportation. Quantum teleportation has become the first algorithm to demonstrate the benefits of segmented and miniaturized Paul traps.

Wiley eBooks•Apr 18, 2016•4 citations
We propose a scheme to perform basic gates of quantum computing and prepare entangled states in a system with cold trapped ions located in a single-mode optical cavity. General quantum computing can be done with both the motional state of the trapped ion and cavity state being qubits. We can also generate different kinds of entangled states in such a system without state reduction, and can transfer quantum states from an ion in one trap to an ion in another trap. The experimental requirements for achieving our scheme are discussed.
The central challenges in trapped ion quantum computing are developing architectures for scalable quantum computing with trapped ions, and optimizing the gate fidelity and speed. This chapter discusses linear Paul traps and quantized eigenmodes of ion crystals in the harmonic trap potential. It explains the operations on the static linear qubit registers. The chapter also discusses ion-laser and ion-microwave interactions and give examples for ion species used for qubits. It outlines single-qubit gate operations and a number of different two-qubit gate schemes. The chapter describes the experimental realization of the Cirac-Zoller gate. Quantum logic operations have been combined in different ways to establish quantum algorithms. In order to exemplify the realization of elementary quantum algorithms, the chapter focuses on quantum teleportation. Quantum teleportation has become the first algorithm to demonstrate the benefits of segmented and miniaturized Paul traps.