REVIEW 20 cited by
Low overhead quantum computation using lattice surgery
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
abstract
When calculating the overhead of a quantum algorithm made fault-tolerant using the surface code, many previous works have used defects and braids for logical qubit storage and state distillation. In this work, we show that lattice surgery reduces the storage overhead by over a factor of 4, and the distillation overhead by nearly a factor of 5, making it possible to run algorithms with $10^8$ T gates using only $3.7\times 10^5$ physical qubits capable of executing gates with error $p\sim 10^{-3}$. These numbers strongly suggest that defects and braids in the surface code should be deprecated in favor of lattice surgery.
Forward citations
Cited by 20 Pith papers
-
Exploring the landscape of compact magic-state distillation factories
Classical repetition-code framing plus SAT search yields no-go theorems (no d>3 T-to-T on <8 qubits) and the smallest known unitary factories for d=4,5 T-states (10–11 qubits) and d=3,4 CCZ-states (9–10 qubits).
-
Fault-tolerant distributed quantum computing with a single nucleus per node
Biased photonic Bell pairs let Floquet codes run with one nucleus per node and stabilizer codes with two, purifying links by repeated syndrome measurement rather than distillation.
-
Novelty-Based Generation of Continuous Landscapes with Diverse Local Optima Networks
Novelty search generates diverse continuous multimodal landscapes with direct basin definitions, enabling low-cost local optima networks whose features predict evolutionary algorithm performance.
-
Theory and Architecture of Syndrome-Resolved Logical Gates
A new theorem gives weak (probabilistic) transversal implementations of arbitrary multi-qubit Pauli rotations for CSS codes, enabling an in-place rotation architecture with large projected resource savings.
-
Trace-Based Reconstruction of Quantum Circuit Dataflow in Surface Codes
From per-patch binary activity traces of surface-code lattice surgery, TraceQ reconstructs the two-qubit gate dependency DAG and detects embedded subroutines with 74-95% success and no false positives, but only on syn...
-
Unfolded distillation: very low-cost magic state preparation for biased-noise qubits
Unfolded distillation prepares an |X^{1/4}> magic state with logical error 3e-7 using 53 biased-noise qubits and 5.5 rounds, by unfolding the 3D Reed-Muller X-stabilizers into a 2D layout.
-
Towards Lattice Surgery Compilation for the Color Code Using Pipe Diagrams
Distance-independent pipe diagrams for the 6.6.6 triangular color code, with ZX correspondence, correlation surfaces, and syndrome extraction, enable spacetime lattice-surgery compilation beyond the surface code.
-
Performance Model for Hybrid Quantum-Classical Workflows
A two-level runtime model decomposes hybrid quantum-classical cycles into quantum, classical, and communication time, allowing a communication-to-computation ratio to classify workflows as compute- or communication-bound.
-
No More Hooks in the Surface Code: Distance-Preserving Syndrome Extraction for Arbitrary Layouts at Minimum Depth
ZX interleaving preserves the full fault distance d of the surface code at minimum four-CNOT-layer depth for arbitrary regular tile layouts, including lattice surgery, without simultaneous measurement and CNOT execution.
-
Distilling Magic States in the Bicycle Architecture
Magic state distillation can run inside a single bivariate bicycle code block, reaching ~10^-11 to 10^-12 output error at p_phys=10^-3 with hundreds of physical qubits and space-time volume near surface-code factories.
-
No-Go Theorem on Fault Tolerant Gadgets for Multiple Logical Qubits
No stabilizer code can implement the full logical Clifford group on multiple logical qubits using transversal gates, fold-transversal gates beyond two qubits, or code automorphisms.
-
Transversal architecture for megaquop-scale quantum simulation with neutral atoms
A neutral-atom co-designed 'transversal STAR' architecture could reach megaquop-scale Hamiltonian simulation with about 10,000 physical qubits at 1e-3 error rates, corresponding to over 1e6 to 1e7 T gates.
-
A Pathway to Practical Quantum Advantage in Solving Navier-Stokes Equations
A spectral-sparsity-based quantum solver is claimed to solve 2^80-cell Navier-Stokes problems in 42.6 days with 8.71 million physical qubits, a 1,100x speedup over a classical supercomputer.
-
Exponentially robust non-Clifford gate in a driven-dissipative circuit
A driven-dissipative GKP qubit can implement a topologically protected non-Clifford square-root T gate via a phi^4 flux potential, with numerically demonstrated exponential error suppression.
-
QuantiSpect: A Structure-Aware Lightweight 3D CNN Pre-Decoder for Scalable Surface Code Quantum Error Correction
A factorized depthwise/grouped 3D CNN pre-decoder matches a dense baseline's surface-code threshold (≈0.77%) with ~2.7x fewer parameters and up to 3.11x faster PyMatching decoding at d=23.
-
Position: Quantum Program Generation Must Prioritize Validity Over Probabilistic Scaling
The paper argues that probabilistic scaling alone cannot fix the validity gap in quantum circuit generation, so quantum code assistants must build verification into generation rather than filter outputs after the fact.
-
VideoEraser: Concept Erasure in Text-to-Video Diffusion Models
A training-free, two-stage erasure method (prompt embedding adjustment plus adversarial noise guidance) is claimed to cut unwanted text-to-video output by 46%, but the submitted full text is an unrelated quantum-coding paper.
-
Synchronization for Fault-Tolerant Quantum Computers
Active and Hybrid synchronization policies cut logical error rates by up to 2.4x and 3.4x compared to passive waiting, by distributing idle time across syndrome generation rounds.
-
Biased-noise qubits: a guide to efficient fault-tolerance using the hierarchy of errors
Using only CZ gates and X-basis readout erases the advantage of biased noise; a bias-preserving CX gate—or a QND multi-qubit Z measurement replacing it—unlocks large overhead reductions.
-
Quantum Computing Technology Roadmaps and Capability Assessment for Scientific Computing -- An analysis of use cases from the NERSC workload
A NERSC analysis finds that more than 50% of its workload could ultimately benefit from quantum computing and that vendor roadmaps and quantum application requirements are projected to overlap in the next 5 to 10 years.
Discussion (0). Sign in to comment.