Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation

TL;DR

This paper introduces a new fault-tolerant quantum computing protocol that achieves constant space overhead and quasi-polylogarithmic time overhead by concatenating small quantum codes, enabling efficient large-scale quantum computations.

Contribution

It proposes a novel concatenation-based approach to fault-tolerant quantum computing that maintains constant space overhead and reduces time overhead, improving scalability.

Findings

Achieves constant space overhead in fault-tolerant quantum computation.

Reduces time overhead to quasi-polylogarithmic levels.

Fault tolerance is maintained even with non-constant decoder runtime.

Abstract

Scaling up quantum computers to attain substantial speedups over classical computing requires fault tolerance. Conventionally, protocols for fault-tolerant quantum computation demand excessive space overheads by using many physical qubits for each logical qubit. A more recent protocol using quantum analogues of low-density parity-check codes needs only a constant space overhead that does not grow with the number of logical qubits. However, the overhead in the processing time required to implement this protocol grows polynomially with the number of computational steps. To address these problems, here we introduce an alternative approach to constant-space-overhead fault-tolerant quantum computing using a concatenation of multiple small-size quantum codes rather than a single large-size quantum low-density parity-check code. We develop techniques for concatenating different quantum Hamming codes with growing sizes. As a result, we construct a low-overhead protocol to achieve constant space overhead and only quasi-polylogarithmic time overhead simultaneously. Our protocol is fault tolerant even if a decoder has a non-constant runtime, unlike the existing constant-space-overhead protocol. This code concatenation approach will make possible a large class of quantum speedups within feasibly bounded space overhead yet negligibly short time overhead.