Universal quantum computation in a neutral-atom decoherence-free subspace
- 21 March 2007
- journal article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 75 (3)
- https://doi.org/10.1103/physreva.75.032328
Abstract
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.Comment: 7 pages, 8 figureKeywords
This publication has 29 references indexed in Scilit:
- Analysis of a quantum logic device based on dipole-dipole interactions of optically trapped Rydberg atomsPhysical Review A, 2005
- Fast Quantum Gates for Neutral AtomsPhysical Review Letters, 2000
- The Physical Implementation of Quantum ComputationFortschritte der Physik, 2000
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum ComputerSIAM Journal on Computing, 1997
- Bulk Spin-Resonance Quantum ComputationScience, 1997
- Class of quantum error-correcting codes saturating the quantum Hamming boundPhysical Review A, 1996
- Simple cavity-QED two-bit universal quantum logic gate: The principle and expected performancesPhysical Review A, 1995
- Quantum Computations with Cold Trapped IonsPhysical Review Letters, 1995
- Quantum theory, the Church–Turing principle and the universal quantum computerProceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1985
- Simulating physics with computersInternational Journal of Theoretical Physics, 1982