arXiv Analytics

Sign in

arXiv:1705.05365 [quant-ph]AbstractReferencesReviewsResources

Fault-tolerant quantum computation with few qubits

Rui Chao, Ben W. Reichardt

Published 2017-05-15Version 1

Reliable qubits are difficult to engineer, but standard fault-tolerance schemes use seven or more physical qubits to encode each logical qubit, with still more qubits required for error correction. The large overhead makes it hard to experiment with fault-tolerance schemes with multiple encoded qubits. The 15-qubit Hamming code protects seven encoded qubits to distance three. We give fault-tolerant procedures for applying arbitrary Clifford operations on these encoded qubits, using only two extra qubits, 17 total. In particular, individual encoded qubits within the code block can be targeted. Fault-tolerant universal computation is possible with four extra qubits, 19 total. The procedures could enable testing more sophisticated protected circuits in small-scale quantum devices. Our main technique is to use gadgets to protect gates against correlated faults. We also take advantage of special code symmetries, and use pieceable fault tolerance.

Related articles: Most relevant | Search more
arXiv:0802.4137 [quant-ph] (Published 2008-02-28, updated 2008-06-13)
Fault-tolerant quantum computation in concatenation of verified cluster states
arXiv:1511.06336 [quant-ph] (Published 2015-11-19)
Large Sample Superradiance and Fault-Tolerant Quantum Computation
arXiv:quant-ph/9605011 (Published 1996-05-13, updated 1997-03-05)
Fault-tolerant quantum computation