Comparing magic state cultivation methods using matrix product states

arXiv:2609.19116 · quant-ph · Submitted 2026-09-16 · Read on arXiv

quant-ph

Submitted: 2026-09-16

Updated: 2026-09-16

Terminology

• Entanglement — 22× in this paper · explained in 4 episodes
• Post-Selection — 18× in this paper · explained in 2 episodes
• Quantum Circuits — 9× in this paper · explained in 2 episodes
• Magic State Cultivation — 8× in this paper
• Decode — 3× in this paper · explained in 2 episodes
• Accuracy — 2× in this paper · explained in 1 episode
• Adam — 2× in this paper · explained in 2 episodes
• Benchmark — 2× in this paper · explained in 2 episodes
• Benchmarking — 2× in this paper · explained in 3 episodes
• Distillation — 2× in this paper · explained in 2 episodes
• Redundancy — 2× in this paper · explained in 2 episodes
• Generalization — 1× in this paper · explained in 13 episodes
• Stabilizer States — 1× in this paper · explained in 2 episodes
• Verification — 1× in this paper · explained in 2 episodes

Sources

• Fold-transversal surface code cultivation
• Simulating magic state cultivation with few Clifford terms
• Tsim: Fast Universal Simulator for Quantum Error Correction
• SOFT: a high-performance simulator for universal fault-tolerant quantum circuits
• Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits
• SymFT: Universal Fault-Tolerant Quantum Circuit Simulation via Symbolic Clifford--Pauli Frames and Stabilizer Coordinates
• Computing logical error thresholds with the Pauli Frame Sparse Representation
• Pauli Propagation: A Computational Framework for Simulating Quantum Systems
• Magic state cultivation: growing T states as cheap as CNOT gates
• Efficient Magic State Cultivation on the Surface Code
• Efficient Magic State Cultivation on $\mathbb{RP}^2$
• Cultivating T states on the surface code with only two-qubit gates
• Efficient magic state cultivation with lattice surgery
• The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes
• Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits
• Simulation of quantum circuits by low-rank stabilizer decompositions
• Color code thresholds under circuit-level noise beyond the Pauli framework
• Fault-tolerant quantum computation with a neutral atom processor
• Spacetime-Efficient and Hardware-Compatible Complex Quantum Logic Units in qLDPC Codes

Related papers

• Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Polynomial-time classical and quantum simulation of quantum impurity models
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
• Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity