Theory of decoherence-free fault-tolerant universal quantum computation
Top Cited Papers
- 20 March 2001
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 63 (4) , 042307
- https://doi.org/10.1103/physreva.63.042307
Abstract
Universal quantum computation on decoherence-free subspaces and subsystems (DFSs) is examined with particular emphasis on using only physically relevant interactions. A necessary and sufficient condition for the existence of decoherence-free (noiseless) subsystems in the Markovian regime is derived here for the first time. A stabilizer formalism for DFSs is then developed which allows for the explicit understanding of these in their dual role as quantum error correcting codes. Conditions for the existence of Hamiltonians whose induced evolution always preserves a DFS are derived within this stabilizer formalism. Two possible collective decoherence mechanisms arising from permutation symmetries of the system-bath coupling are examined within this framework. It is shown that in both cases universal quantum computation which always preserves the DFS (natural fault-tolerant computation) can be performed using only two-body interactions. This is in marked contrast to standard error correcting codes, where all known constructions using one- or two-body interactions must leave the code space during the on-time of the fault-tolerant gates. A further consequence of our universality construction is that a single exchange Hamiltonian can be used to perform universal quantum computation on an encoded space whose asymptotic coding efficiency is unity. The exchange Hamiltonian, which is naturally present in many quantum systems, is thus asymptotically universal.Keywords
All Related Versions
This publication has 49 references indexed in Scilit:
- Quantum information theoryIEEE Transactions on Information Theory, 1998
- Resilient Quantum ComputationScience, 1998
- Reliable quantum computersProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 1998
- Quantum computations: algorithms and error correctionRussian Mathematical Surveys, 1997
- Quantum Mechanics Helps in Searching for a Needle in a HaystackPhysical Review Letters, 1997
- Theory of quantum error-correcting codesPhysical Review A, 1997
- Class of quantum error-correcting codes saturating the quantum Hamming boundPhysical Review A, 1996
- Error Correcting Codes in Quantum TheoryPhysical Review Letters, 1996
- Scheme for reducing decoherence in quantum computer memoryPhysical Review A, 1995
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channelsPhysical Review Letters, 1993