Vine codes generalize directional codes to open planar boundaries, delivering up to 28% fewer data/measure qubits at circuit distance 7 and better simulated performance than the surface code at 10^{-3} noise while using fewer total qubits.
hub
Magic state cultivation on a superconducting quantum processor
19 Pith papers cite this work. Polarity classification is still indexing.
19
Pith papers citing it
hub tools
citation-role summary
background 2
citation-polarity summary
fields
quant-ph 19years
2026 19roles
background 2polarities
background 2representative citing papers
Universal two-copy quantum state purification under depolarizing noise requires magic resources that scale linearly with the fidelity gain, establishing an exact resource law for odd dimensions and tight bounds for multi-qubit systems.
Experimental demonstration of patch-based surface-code logical operations (routing, CNOT, Hadamard, phase) on distance-3 patches in a 107-qubit superconducting processor without post-selection.
A new cultivation protocol prepares reusable logical catalysts as eigenstates of high-period Clifford circuits to implement exact Z^{2^{-b}} phase gates with constant online depth in surface codes.
QMCtwin simulates master-equation syndrome statistics for a distance-7 surface code and reveals biases and correlations absent in Pauli-twirled models.
Generalizes phase kickback checks for √T magic state cultivation in doubled color code, reports simulation consistency with S state performance, and outlines lattice surgery escape strategy.
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).
Syndrome resampling increases QEC thresholds and cuts logical errors by up to four orders of magnitude by biasing toward likely syndromes, linked to Rényi coherent information phase transitions.
Clifft introduces a factored-state simulator that shifts exponential cost to a dynamic active subspace, generalizing Stim's compile-once model to near-Clifford circuits and enabling the first exact end-to-end simulations of magic-state cultivation over hundreds of billions of shots.
A new nearest-neighbor twist-defect braiding protocol implements the logical S gate in the surface code at 2d × d × d spacetime volume with logical error rates comparable to prior methods for d ≥ 5 near p = 10^{-3}.
A new sparse Pauli-frame method shows coherent noise thresholds are overestimated by a factor of ~4 under Pauli-twirling and revises the T-to-S gate error rate factor to as high as 7 at distance d=5.
Proposes a cavity-mediated probabilistic protocol to prepare and teleport magic T-states into atoms with 0.74 success probability using Rydberg atom-cavity interactions.
A symmetry-leveraging framework for fault-tolerant ancilla preparation in quantum BCH codes yields lower spatial overhead and logical error rates than standard distillation in simulations up to 127 qubits.
In-patch multiplexing reduces expected attempts per accepted logical magic state by 45-79% at physical error rate 2e-3 for distances 3 and 5 while leaving the escape stage unchanged.
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.
This review surveys cryogenic electronics approaches for superconducting FTQCs and introduces a first-order resource estimation framework benchmarked on RSA-2048 scale.
AL-QHD benchmarks on nonconvex test functions and ACOPF power problems show useful accuracy at fixed qubit cost but require roughly 10^8 T gates for realistic instances.
citing papers explorer
-
Vine Codes: Low-Overhead Quantum LDPC Codes on a Planar Square Grid
Vine codes generalize directional codes to open planar boundaries, delivering up to 28% fewer data/measure qubits at circuit distance 7 and better simulated performance than the surface code at 10^{-3} noise while using fewer total qubits.
-
A Nonstabilizerness Resource Law for Universal Quantum State Purification
Universal two-copy quantum state purification under depolarizing noise requires magic resources that scale linearly with the fidelity gain, establishing an exact resource law for odd dimensions and tight bounds for multi-qubit systems.
-
Surface code logical operations on a superconducting quantum processor
Experimental demonstration of patch-based surface-code logical operations (routing, CNOT, Hadamard, phase) on distance-3 patches in a 107-qubit superconducting processor without post-selection.
-
Cultivating logical catalysts for fault-tolerant dyadic phase rotations
A new cultivation protocol prepares reusable logical catalysts as eigenstates of high-period Clifford circuits to implement exact Z^{2^{-b}} phase gates with constant online depth in surface codes.
-
QMCtwin: Master-Equation Simulation of Syndrome Statistics Beyond Pauli Noise
QMCtwin simulates master-equation syndrome statistics for a distance-7 surface code and reveals biases and correlations absent in Pauli-twirled models.
-
Efficient Magic State Cultivation for $\sqrt{T}$ Gates
Generalizes phase kickback checks for √T magic state cultivation in doubled color code, reports simulation consistency with S state performance, and outlines lattice surgery escape strategy.
-
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).
-
Syndrome resampling enhances quantum error correction thresholds
Syndrome resampling increases QEC thresholds and cuts logical errors by up to four orders of magnitude by biasing toward likely syndromes, linked to Rényi coherent information phase transitions.
-
Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits
Clifft introduces a factored-state simulator that shifts exponential cost to a dynamic active subspace, generalizing Stim's compile-once model to near-Clifford circuits and enabling the first exact end-to-end simulations of magic-state cultivation over hundreds of billions of shots.
-
A $\boldsymbol{2d \times d \times d}$ Spacetime Volume Implementation of a Logical S Gate in the Surface Code
A new nearest-neighbor twist-defect braiding protocol implements the logical S gate in the surface code at 2d × d × d spacetime volume with logical error rates comparable to prior methods for d ≥ 5 near p = 10^{-3}.
-
Computing logical error thresholds with the Pauli Frame Sparse Representation
A new sparse Pauli-frame method shows coherent noise thresholds are overestimated by a factor of ~4 under Pauli-twirling and revises the T-to-S gate error rate factor to as high as 7 at distance d=5.
-
Cavity-mediated probabilistic magic $T$-gate injection
Proposes a cavity-mediated probabilistic protocol to prepare and teleport magic T-states into atoms with 0.74 success probability using Rydberg atom-cavity interactions.
-
Efficient Fault-Tolerant Ancilla Preparation for Quantum BCH codes via Cyclic Symmetry
A symmetry-leveraging framework for fault-tolerant ancilla preparation in quantum BCH codes yields lower spatial overhead and logical error rates than standard distillation in simulations up to 127 qubits.
-
Reducing Postselection Overhead in Magic-State Cultivation by In-Patch Multiplexing
In-patch multiplexing reduces expected attempts per accepted logical magic state by 45-79% at physical error rate 2e-3 for distances 3 and 5 while leaving the escape stage unchanged.
-
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.
-
Integration and Resource Estimation of Cryoelectronics for Superconducting Fault-Tolerant Quantum Computers
This review surveys cryogenic electronics approaches for superconducting FTQCs and introduces a first-order resource estimation framework benchmarked on RSA-2048 scale.
-
Benchmarking and Resource Analysis for Augmented-Lagrangian Quantum Hamiltonian Descent
AL-QHD benchmarks on nonconvex test functions and ACOPF power problems show useful accuracy at fixed qubit cost but require roughly 10^8 T gates for realistic instances.
- Neural network decoder confidence as a learned proxy for the logical gap
- Mitigating Classical Resource Costs in Quantum Error Correction via Generalized qLDPC Predecoding