arXiv:2609.37231
Ultra-high-distance quantum memories from amplified qLDPC codes
Zijian Liang, Boren Gu, Yu-An Chen, Jens Eisert, Zongyuan Wang
Abstract
A large code distance does not by itself guarantee a well-protected quantum memory, as faults during syndrome extraction can propagate into correlated data errors. Certifying circuit distance becomes demanding as circuits grow. In this work, we introduce distance amplifiers, a modular approach to increasing both code distance and certified circuit-level protection in quantum low-density parity-check codes. The construction tensors a base code with an amplifier, adapting their syndrome-extraction circuits to the amplified code. To certify the resulting memory, we develop a fault-response certificate that yields rigorous lower bounds on circuit distance. Suitable gate ordering and flag qubits control correlated errors, allowing us to establish explicit conditions under which the amplified circuit distance equals the product of the constituent circuit distances. We prove this multiplicative relation for three types of amplifiers: the flagged $[[4,2,2]]$, hypergraph-product, and rotated surface codes. The certificate extends recursively, so the circuit distance multiplies exactly at every amplification step. For example, four successive applications of the flagged $[[4,2,2]]$ amplifier to a $[[18,4,4]]$ seed yield a $[[13320,64,64]]$ code with the circuit distance $d_{\mathrm{circ}} \geq 48$ and check weights $w \leq 14$. We further show how individual logical qubits can be tracked explicitly through amplification. By enabling high-distance quantum memories to be built and certified from smaller building blocks, our framework offers a systematic route toward scalable fault-tolerant quantum computing.
AI Summary
The paper asks how to increase qLDPC code distance while certifying protection against correlated errors generated during syndrome extraction, without searching the full amplified circuit. It tensors a CSS base code with an amplifier, adds check–check side registers, and prescribes staged joint syndrome extraction. The product has $\widetilde n=nn_A+m_Zm_X^A+m_Xm_Z^A$ data qubits and $\widetilde k=kk_A$ logical qubits; check weights and degrees grow at most additively per step. The central tool is a fault-response certificate $D_P$: a lower bound on the fault cost of producing a nontrivial logical response, retaining flag constraints but ignoring ordinary syndrome outcomes. Disjoint contractions into base-code logical responses establish certificate multiplication. For flagged $[[4,2,2]]$, canonical hypergraph-product, and appropriately ordered rotated-surface amplifiers, the prescribed circuits satisfy $d_P^A D_P\leq d_{\mathrm{circ},P}(\widetilde{\mathcal S})\leq d_P^A d_{\mathrm{circ},P}(\mathcal S)$. Certificates transfer recursively; circuit distance multiplies exactly when the seed certificate is attained. Four flagged amplification steps turn a $[[18,4,4]]$ seed with certificate $3$ into a $[[13320,64,64]]$ memory with $d_{\mathrm{circ}}\geq48$ and check weights at most $14$. Tensor logical bases also provide explicit logical labels and algebraic surgery lifts. The guarantees require specified check presentations, schedules, fault-response assumptions, ideal encoded input, and perfect final checks. Initialization and complete logical-measurement protocols remain unanalyzed. Unrestricted recursion increases check weights and degrees. Data-qubit benchmarks exclude circuit and decoding costs; circuit-level simulations neglect idle noise, and product-structured decoders remain future work.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- initial commit, 26 pages and 5 figures