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.
Efficient Magic State Cultivation on the Surface Code
7 Pith papers cite this work. Polarity classification is still indexing.
7
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
fields
quant-ph 7roles
background 2polarities
background 2representative citing papers
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.
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.
citing papers explorer
-
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.
-
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.
- PureMagic: A Dynamic Scheduler for Lattice Surgery