Computation on a Noiseless Quantum Code and Symmetrization
Quantum Physics
2009-10-31 v2
Abstract
Let be the state-space of a quantum computer coupled with the environment by a set of error operators spanning a Lie algebra Suppose admits a noiseless quantum code i.e., a subspace annihilated by We show that a universal set of gates over is obtained by any generic pair of -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 Any computation can then be performed completely within the coding decoherence-free subspace.
Cite
@article{arxiv.quant-ph/9901047,
title = {Computation on a Noiseless Quantum Code and Symmetrization},
author = {Paolo Zanardi},
journal= {arXiv preprint arXiv:quant-ph/9901047},
year = {2009}
}
Comments
One result added, to appear in Phys. Rev. A (RC) 4 pages LaTeX, no figures