Austin G. Fowler, Simon J. Devitt
What are the minimum quantum resources required to reliably implement a given quantum computation? We present clear arguments suggesting the lowest overhead scheme for coping with quantum errors in a 2-D array of qubits with nearest neighbor interactions has already been discovered. We then describe a new technique, bridge compression, which we believe has the potential to squeeze the maximum amount of nontrivial quantum computation out of the scheme.
View original:
http://arxiv.org/abs/1209.0510
No comments:
Post a Comment