Decoherence-Free Subspaces for Quantum Computation
Daniel A. Lidar, Isaac L. Chuang, K. Birgitta Whaley
Abstract
Open-access reader
Daniel A. Lidar, Isaac L. Chuang, K. Birgitta Whaley
Abstract
Open-access reader
Decoherence in quantum computers is formulated within the semigroup approach. The error generators are identified with the generators of a Lie algebra. This allows for a comprehensive description which includes as a special case the frequently assumed spin-boson model. A generic condition is presented for errorless quantum computation: decoherence-free subspaces are spanned by those states which are annihilated by all the generators. It is shown that these subspaces are stable to perturbations and, moreover, that universal quantum computation is possible within them.
OpenAlex reports 1906 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Decoherence in quantum computers is formulated within the semigroup approach. The error generators are identified with the generators of a Lie algebra. This allows for a comprehensive description which includes as a special case the frequently assumed spin-boson model. A generic condition is presented for errorless quantum computation: decoherence-free subspaces are spanned by those states which are annihilated by all the generators. It is shown that these subspaces are stable to perturbations and, moreover, that universal quantum computation is possible within them.
Key concepts: Decoherence-free subspaces, Quantum decoherence, Quantum computer, Linear subspace, Quantum error correction, Computation, Quantum operation, Quantum mechanics