Phys. Rev. A 60, R729–R732 (1999)Computation on an error-avoiding quantum code and symmetrization
Let H be the state space of a quantum computer coupled with the environment by a set of error operators spanning a Lie algebra L. Suppose L admits an error-avoiding quantum code, i.e., a subspace C⊂H annihilated by L. We show that a universal set of gates over C is obtained by any generic pair of L-invariant gates. Such gates—if not available from the outset—can be obtained by resorting to a symmetrization with respect to the group generated by L. Any computation can then be performed completely within the coding decoherence-free subspace. © 1999 The American Physical Society URL:
http://link.aps.org/doi/10.1103/PhysRevA.60.R729
DOI:
10.1103/PhysRevA.60.R729
PACS:
03.67.Lx, 03.65.Fd
|
|
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.