FT-Weave: Real-Time Compilation Framework for Reconfigurable Fault-Tolerant Quantum Architectures

arXiv:2609.20573 · quant-ph · Submitted 2026-09-17 · Read on arXiv

quant-ph

Submitted: 2026-09-17

Updated: 2026-09-17

Code: https://github.com/UCLA-VAST/FT-Weave

Terminology

• Fidelity — 19× in this paper · explained in 2 episodes
• Abstraction — 7× in this paper · explained in 1 episode
• Benchmark — 6× in this paper · explained in 2 episodes
• Distillation — 5× in this paper · explained in 2 episodes
• Trace — 4× in this paper · explained in 2 episodes
• Adaptation — 2× in this paper · explained in 1 episode
• Quantum Circuits — 2× in this paper · explained in 2 episodes
• Accuracy — 1× in this paper · explained in 1 episode
• Communication Overhead — 1× in this paper · explained in 2 episodes
• Entanglement — 1× in this paper · explained in 4 episodes
• Graph Construction — 1× in this paper · explained in 3 episodes
• Hubbard Model — 1× in this paper · explained in 3 episodes
• International Symposium on High Performance Computer Architecture — 1× in this paper
• Modularity — 1× in this paper · explained in 9 episodes
• Physical Constraints — 1× in this paper · explained in 7 episodes
• Post-Selection — 1× in this paper · explained in 2 episodes

Sources

• Helios: A 98-qubit trapped-ion quantum computer
• High-fidelity entangling gates and nonlocal circuits with neutral atoms
• Magic state cultivation: growing T states as cheap as CNOT gates
• Cultivating T states on the surface code with only two-qubit gates
• Fold-transversal surface code cultivation
• Demonstrating dynamic surface codes
• Towards Ultra-High-Rate Quantum Error Correction with Reconfigurable Atom Arrays
• Demonstration of logical qubits and repeated error correction with better-than-physical error rates
• Computing with many encoded logical qubits beyond break-even
• Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits
• Demonstrating real-time and low-latency quantum error correction with superconducting qubits
• Price and Payoff: Non-Determinism in Fault Tolerant Quantum Computation
• The FLuid Allocation of Surface code Qubits (FLASQ) cost model for early fault-tolerant quantum algorithms
• Assessing requirements to scale to practical quantum advantage
• O3LS: Optimizing Lattice Surgery via Automatic Layout Searching and Loose Scheduling
• MagicPool: Dealing with Magic State Distillation Failures on Large-Scale Fault-Tolerant Quantum Computer
• PureMagic: A Dynamic Scheduler for Lattice Surgery
• Harvest: Resource-Aware Quantum Compilation for Magic State Protocols
• General circuit compilation protocol into partially fault-tolerant quantum computing architecture
• STAR-Magic Mutation: Even More Efficient Analog Rotation Gates for Early Fault-Tolerant Quantum Computer

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