REVIEW 5 cited by
Blocklet concatenation: Low-overhead fault-tolerant protocols for fusion-based quantum computation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Blocklet concatenation: Low-overhead fault-tolerant protocols for fusion-based quantum computation
read the original abstract
We introduce a construction for protocols for fault-tolerant quantum computing based on code concatenation and transversal gates. These protocols can be interpreted as families of quantum circuits of low-weight stabilizer measurements without strict locality constraints, effectively implementing concatenated codes. However, we primarily study these protocols in the context of photonic fusion-based quantum computing (FBQC), where they yield families of fusion networks with constant-sized resource states. Their high erasure thresholds relative to their resource-state cost establish them as promising candidates to replace surface codes in the context of FBQC. Examples include protocol families using 8-, 10- and 12-qubit resource states, with erasure thresholds of 13.8%, 19.1% and 11.5%, and footprint-per-logical-qubit scaling as $\mathcal{O}(d)$, $\mathcal{O}(d^{1.46})$ and $\mathcal{O}(d^{0.58})$, respectively, where $d$ is the code distance. We also present techniques for performing logical operations, decoding, and implementing the protocols in photonic hardware. Although we focus on photonic FBQC, these ideas may also be of interest in other settings.
Forward citations
Cited by 5 Pith papers
-
Duality constrains optimal thresholds in quantum error correction
Zero-rate em-symmetric CSS codes are self-dual under generalized Kramers-Wannier duality, pinning their optimal code-capacity threshold (at leading order in a replica limit) to the zero-rate hashing bound p≈0.110.
-
Simplified circuit-level decoding using Knill error correction
Knill error correction reduces circuit-level decoding for quantum LDPC codes to the simpler code-capacity decoder while remaining fault-tolerant under locally decaying noise.
-
Demonstration of a Logical Architecture Uniting Motion and In-Place Entanglement
Neutral-atom processor integrates atom motion with in-place entanglement to cut logical overhead, shown in Shor's variant, CX ladders, and [[16,4,4]] code experiments with 2-8x error improvements.
-
Practical blueprint for low-depth photonic quantum computing with quantum dots
Authors propose a low-optical-depth fusion-based photonic quantum computing architecture using quantum-dot emitters, adaptive repeat-until-success fusions, and time-bin qubits, with resource estimates and error-thresh...
-
Hardware-Tailored Resource Estimation for Magic-State Distillation on Silicon Spin Qubits
Resource estimation for magic-state distillation on silicon spin qubits finds 42% overhead reduction via optimized pulses and ~3x physical footprint reduction with biased codes versus surface code.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.