pith. sign in

arxiv: 2402.09606 · v2 · pith:EHVKLJZGnew · submitted 2024-02-14 · 🪐 quant-ph

Concatenate codes, save qubits

classification 🪐 quant-ph
keywords codesprotocoloverheadspacecodeftqcquantumconcatenated
0
0 comments X
read the original abstract

The essential requirement for fault-tolerant quantum computation (FTQC) is the total protocol design to achieve a fair balance of all the critical factors relevant to its practical realization, such as the space overhead, the threshold, and the modularity. A major obstacle in realizing FTQC with conventional protocols, such as those based on the surface code and the concatenated Steane code, has been the space overhead, i.e., the required number of physical qubits per logical qubit. Protocols based on high-rate quantum low-density parity-check (LDPC) codes gather considerable attention as a way to reduce the space overhead, but problematically, the existing fault-tolerant protocols for such quantum LDPC codes sacrifice the other factors. Here we construct a new fault-tolerant protocol to meet these requirements simultaneously based on more recent progress on the techniques for concatenated codes rather than quantum LDPC codes, achieving a constant space overhead, a high threshold, and flexibility in modular architecture designs. In particular, under a physical error rate of $0.1\%$, our protocol reduces the space overhead to achieve the logical CNOT error rates $10^{-10}$ and $10^{-24}$ by more than $90 \%$ and $96 \%$, respectively, compared to the protocol for the surface code. Furthermore, our protocol achieves the threshold of $2.5 \%$ under a conventional circuit-level error model, substantially outperforming that of the surface code. The use of concatenated codes also naturally introduces abstraction layers essential for the modularity of FTQC architectures. These results indicate that the code-concatenation approach opens a way to significantly save qubits in realizing FTQC while fulfilling the other essential requirements for the practical protocol design.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Coupled-Layer Construction of Quantum Product Codes

    quant-ph 2026-03 unverdicted novelty 6.0

    Tensor and balanced product codes arise from a coupled-layer construction via anyon condensation on stacked constituent codes.

  2. Quantum memory based on concatenating surface codes and quantum Hamming codes

    quant-ph 2024-07 unverdicted novelty 5.0

    Concatenating surface codes with quantum Hamming codes achieves high error thresholds up to the surface code limit and suppresses logical errors more effectively than surface codes with comparable overhead for interme...