Theory of initialization-free decoherence-free subspaces and subsystems
- 3 October 2005
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 72 (4) , 042303
- https://doi.org/10.1103/physreva.72.042303
Abstract
We introduce a generalized theory of decoherence-free subspaces and subsystems (DFSs), which do not require accurate initialization. We derive a set of conditions for the existence of DFSs within this generalized framework. By relaxing the initialization requirement we show that a DFS can tolerate arbitrarily large preparation errors. This has potentially significant implications for experiments involving DFSs, in particular for the experimental implementation, over DFSs, of the large class of quantum algorithms which can function with arbitrary input states.Keywords
All Related Versions
This publication has 52 references indexed in Scilit:
- Theory of decoherence-free fault-tolerant universal quantum computationPhysical Review A, 2001
- Decoherence-free subspaces for multiple-qubit errors. I. CharacterizationPhysical Review A, 2001
- Quantum computation using decoherence-free states of the physical operator algebraPhysical Review A, 2000
- Theory of Quantum Error Correction for General NoisePhysical Review Letters, 2000
- Decoherence-Free Subspaces for Quantum ComputationPhysical Review Letters, 1998
- Reducing decoherence in quantum-computer memory with all quantum bits coupling to the same environmentPhysical Review A, 1998
- Noiseless Quantum CodesPhysical Review Letters, 1997
- Quantum Computing: Dream or Nightmare?Physics Today, 1996
- Is quantum mechanics useful?Philosophical Transactions A, 1995
- Maintaining coherence in quantum computersPhysical Review A, 1995