Phys. Rev. Lett. 81, 2594–2597 (1998)Decoherence-Free Subspaces for Quantum ComputationReceived 27 April 1998; published in the issue dated 21 September 1998 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. © 1998 The American Physical Society URL:
http://link.aps.org/doi/10.1103/PhysRevLett.81.2594
DOI:
10.1103/PhysRevLett.81.2594
PACS:
03.67.Lx, 03.65.Bz, 03.65.Fd, 89.70.+c
|
|
About | Terms and Conditions | Subscriptions | Search | Help
Use of the American Physical Society websites and journals implies that the user has read and agrees to our Terms and Conditions and any applicable Subscription Agreement. Physical Review®, Physical Review Letters®, Reviews of Modern Physics®, and Physical Review Special Topics® are trademarks of the American Physical Society.