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:0706.0203 · Physical Review A

Universal quantum computation in decoherence-free subspaces with hot trapped ions

Leandro Aolita, L. Davidovich, Kihwan Kim, Hartmut Häffner

Published May 31, 2007• 25 citations
arXivHTMLPDF

Abstract

We consider interactions that generate a universal set of quantum gates on logical qubits encoded in a collective-dephasing-free subspace, and discuss their implementations with trapped ions. This allows for the removal of the by-far largest source of decoherence in current trapped-ion experiments, collective dephasing. In addition, an explicit parametrization of all two-body Hamiltonians able to generate such gates without the system's state ever exiting the protected subspace is provided.

DOI
10.1103/physreva.75.052337

Related papers

Scalable quantum computation in decoherence-free subspaces with trapped ions

Li-Xiang Cen, Z. D. Wang, Shun-Jin Wang

We propose a decoherence-free subspace (DFS) scheme to realize scalable quantum computation with trapped ions. The spin-dependent laser-ion coupling is exploited in the presence of Coulomb interactions. A universal set of unconventional geometric quantum gates is achieved in encoded subspaces that are immune from decoherence by collective dephasing. The scalability of the scheme for an ion-array system is demonstrated, either by adiabatically switching on and off the interactions, or by a fast gate scheme with DFS encoding and noise-decoupling techniques.

arXiv:quant-ph/0603222•Physical Review A•Sep 19, 2006•36 citations

Scalable ion trap quantum computation in decoherence-free subspaces with pairwise interactions only

Kenneth R. Brown, Jiří Vala, K. Birgitta Whaley

We show that universal ion trap computation can be performed on decoherence-free subspaces (DFS's) using only two-qubit operations. One logical qubit is minimally encoded into three physical qubits. The encoded qubit is in a DFS under collective decoherence. Encoded single- and two-qubit logical operations are implemented via the S\o{}rensen-M\o{}lmer interaction. We show that alternation of the effective Hamiltonians for two particular phase configurations of control fields approximates an anisotropic exchange interaction that has recently been shown to be universal on these encodings. Physically realistic rapid alternation of the control fields also approximates evolution in a DFS. Our scheme is scalable in a recently proposed array-based architecture.

arXiv:quant-ph/0207155•Physical Review A•Jan 17, 2003•20 citations

Universal quantum computation in a neutral-atom decoherence-free subspace

E. Brion, Line Hjortshøj Pedersen, Klaus Mølmer +2 more

In this paper, we propose a way to achieve protected universal computation in a neutral-atom quantum computer subject to collective dephasing. Our proposal relies on the existence of a decoherence-free subspace (DFS), resulting from symmetry properties of the errors. After briefly describing the physical system and the error model considered, we show how to encode information into the DFS and build a complete set of safe universal gates. Finally, we provide numerical simulations for the fidelity of the different gates in the presence of time-dependent phase errors and discuss their performance and practical feasibility.

arXiv:quant-ph/0611246•Physical Review A•Mar 21, 2007•28 citations

Universal non-adiabatic holonomic quantum computation in decoherence-free subspaces with quantum dots inside a cavity

Jun Liu, Ping Dong, Jian Zhou +1 more

Abstract A scheme for implementing the non-adiabatic holonomic quantum computation in decoherence-free subspaces is proposed with the interactions between a microcavity and quantum dots. A universal set of quantum gates can be constructed on the encoded logical qubits with high fidelities. The current scheme can suppress both local and collective noises, which is very important for achieving universal quantum computation. Discussions about the gate fidelities with the experimental parameters show that our schemes can be implemented in current experimental technology. Therefore, our scenario offers a method for universal and robust solid-state quantum computation.

Laser Physics Letters•Mar 15, 2017•9 citations

Universal Nonadiabatic Geometric Gates in Two-Qubit Decoherence-Free Subspaces

Guofu Xu, Guilu Long

Geometric quantum computation in decoherence-free subspaces is of great practical importance because it can protect quantum information from both control errors and collective dephasing. However, previous proposed schemes have either states leakage or four-body interactions problems. Here, we propose a feasible scheme without these two problems. Our scheme is realized in two-qubit decoherence-free subspaces. Since the Hamiltonian we use is generic, our scheme looks promising to be demonstrated experimentally in different systems, including superconducting charge qubits.

Scientific Reports•Oct 29, 2014•70 citations

Universal Fault-Tolerant Quantum Computation on Decoherence-Free Subspaces

Dave Bacon, Julia Kempe, Daniel A. Lidar +1 more

A general scheme to perform universal, fault-tolerant quantum computation within decoherence-free subspaces (DFSs) is presented. At most two-qubit interactions are required, and the system remains within the DFS throughout the entire implementation of a quantum gate. We show explicitly how to perform universal computation on clusters of the four-qubit DFS encoding one logical qubit each under spatially symmetric (collective) decoherence. Our results have immediate relevance to quantum computer implementations in which quantum logic is implemented through exchange interactions, such as the recently proposed spin-spin coupled quantum dot arrays and donor-atom arrays.

arXiv:quant-ph/9909058•Physical Review Letters•Aug 21, 2000•388 citations
We consider interactions that generate a universal set of quantum gates on logical qubits encoded in a collective-dephasing-free subspace, and discuss their implementations with trapped ions. This allows for the removal of the by-far largest source of decoherence in current trapped-ion experiments, collective dephasing. In addition, an explicit parametrization of all two-body Hamiltonians able to generate such gates without the system's state ever exiting the protected subspace is provided.
We propose a decoherence-free subspace (DFS) scheme to realize scalable quantum computation with trapped ions. The spin-dependent laser-ion coupling is exploited in the presence of Coulomb interactions. A universal set of unconventional geometric quantum gates is achieved in encoded subspaces that are immune from decoherence by collective dephasing. The scalability of the scheme for an ion-array system is demonstrated, either by adiabatically switching on and off the interactions, or by a fast gate scheme with DFS encoding and noise-decoupling techniques.
We show that universal ion trap computation can be performed on decoherence-free subspaces (DFS's) using only two-qubit operations. One logical qubit is minimally encoded into three physical qubits. The encoded qubit is in a DFS under collective decoherence. Encoded single- and two-qubit logical operations are implemented via the S\o{}rensen-M\o{}lmer interaction. We show that alternation of the effective Hamiltonians for two particular phase configurations of control fields approximates an anisotropic exchange interaction that has recently been shown to be universal on these encodings. Physically realistic rapid alternation of the control fields also approximates evolution in a DFS. Our scheme is scalable in a recently proposed array-based architecture.
In this paper, we propose a way to achieve protected universal computation in a neutral-atom quantum computer subject to collective dephasing. Our proposal relies on the existence of a decoherence-free subspace (DFS), resulting from symmetry properties of the errors. After briefly describing the physical system and the error model considered, we show how to encode information into the DFS and build a complete set of safe universal gates. Finally, we provide numerical simulations for the fidelity of the different gates in the presence of time-dependent phase errors and discuss their performance and practical feasibility.
Abstract A scheme for implementing the non-adiabatic holonomic quantum computation in decoherence-free subspaces is proposed with the interactions between a microcavity and quantum dots. A universal set of quantum gates can be constructed on the encoded logical qubits with high fidelities. The current scheme can suppress both local and collective noises, which is very important for achieving universal quantum computation. Discussions about the gate fidelities with the experimental parameters show that our schemes can be implemented in current experimental technology. Therefore, our scenario offers a method for universal and robust solid-state quantum computation.
Geometric quantum computation in decoherence-free subspaces is of great practical importance because it can protect quantum information from both control errors and collective dephasing. However, previous proposed schemes have either states leakage or four-body interactions problems. Here, we propose a feasible scheme without these two problems. Our scheme is realized in two-qubit decoherence-free subspaces. Since the Hamiltonian we use is generic, our scheme looks promising to be demonstrated experimentally in different systems, including superconducting charge qubits.
A general scheme to perform universal, fault-tolerant quantum computation within decoherence-free subspaces (DFSs) is presented. At most two-qubit interactions are required, and the system remains within the DFS throughout the entire implementation of a quantum gate. We show explicitly how to perform universal computation on clusters of the four-qubit DFS encoding one logical qubit each under spatially symmetric (collective) decoherence. Our results have immediate relevance to quantum computer implementations in which quantum logic is implemented through exchange interactions, such as the recently proposed spin-spin coupled quantum dot arrays and donor-atom arrays.