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
Efficient magic state cultivation on the surface code
13 Pith papers cite this work. Polarity classification is still indexing.
13
Pith papers citing it
hub tools
citation-role summary
background 2
citation-polarity summary
fields
quant-ph 13roles
background 2polarities
background 2representative citing papers
A new family of magic state distillation protocols based on logical Clifford error checking achieves near-linear asymptotic rate despite overhead exponent exceeding one, showing the quantities are not tightly coupled in the sublinear regime.
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.
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.
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 trapped-ion architecture based on LDPC codes and cat-state factories achieves 110 logical qubits and one million T gates per day using 2514 physical qubits, with estimates for Heisenberg model simulation on 100 sites in one month using 10000 qubits.
Shor's algorithm for cryptographically relevant problems becomes feasible on neutral-atom systems with as few as 10,000 reconfigurable physical qubits via high-rate quantum error correction.
Gauging enables constant-depth logical XS dagger measurements for color-code magic state cultivation, achieving 10^{-12} logical error rates at 0.05% physical error for distance-7 codes while retaining over 1% of shots via post-selection.
Repurposing ancilla qubits for both magic-state cultivation and routing improves lattice-surgery schedule efficiency by 19-223% over dedicated-bus routing in simulations.
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.
Sampling-based methods for quantum state preparation achieve asymptotically lower T-count than rotation-based methods and maintain an advantage in total gate count after accounting for compilation overhead.
Compares resource costs of logical T-state preparation via distillation, cultivation, and code switching using native metrics from existing literature plus a Shor factoring case study.
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.
-
Asymptotic magic state distillation with almost linear rate
A new family of magic state distillation protocols based on logical Clifford error checking achieves near-linear asymptotic rate despite overhead exponent exceeding one, showing the quantities are not tightly coupled in the sublinear regime.
-
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.
-
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.
-
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}.
-
Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture
A trapped-ion architecture based on LDPC codes and cat-state factories achieves 110 logical qubits and one million T gates per day using 2514 physical qubits, with estimates for Heisenberg model simulation on 100 sites in one month using 10000 qubits.
-
Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits
Shor's algorithm for cryptographically relevant problems becomes feasible on neutral-atom systems with as few as 10,000 reconfigurable physical qubits via high-rate quantum error correction.
-
Constant depth magic state cultivation with Clifford measurements by gauging
Gauging enables constant-depth logical XS dagger measurements for color-code magic state cultivation, achieving 10^{-12} logical error rates at 0.05% physical error for distance-7 codes while retaining over 1% of shots via post-selection.
-
PureMagic: A Dynamic Scheduler for Lattice Surgery
Repurposing ancilla qubits for both magic-state cultivation and routing improves lattice-surgery schedule efficiency by 19-223% over dedicated-bus routing in simulations.
-
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.
-
Logical Resource Estimation for Quantum State Preparation with Compilation
Sampling-based methods for quantum state preparation achieve asymptotically lower T-count than rotation-based methods and maintain an advantage in total gate count after accounting for compilation overhead.
-
A Resource Comparison of Logical T-State Preparation
Compares resource costs of logical T-state preparation via distillation, cultivation, and code switching using native metrics from existing literature plus a Shor factoring case study.