A Converse for Fault-tolerant Quantum Computation

Abstract

As techniques for fault-tolerant quantum computation keep improving, it is natural to ask: what is the fundamental lower bound on redundancy? In this paper, we obtain a lower bound on the redundancy required for $\epsilon$-accurate implementation of a large class of operations that includes unitary operators. For the practically relevant case of sub-exponential depth and sub-linear gate size, our bound on redundancy is tighter than the known lower bounds. We obtain this bound by connecting fault-tolerant computation with a set of finite blocklength quantum communication problems whose accuracy requirements satisfy a joint constraint. The lower bound on redundancy obtained here leads to a strictly smaller upper bound on the noise threshold for non-degradable noise. Our bound directly extends to the case where noise at the outputs of a gate are non-i.i.d. but noise across gates are i.i.d.

Some changes were made, and results changed in the lower order term only (scaling factor added), Edited license

References in corpus (3)

• Classical simulatability, entanglement breaking, and quantum computation thresholds
• A lower bound on the space overhead of fault-tolerant quantum computation
• An Upper Bound on the Threshold Quantum Decoherence Rate

Cited by in corpus (2)

• Reliable Quantum Memories with Unreliable Components
• Limits of Fault-Tolerance on Resource-Constrained Quantum Circuits for Classical Problems