Unlocking early fault-tolerant quantum computing with mitigated magic dilution
arXiv:2505.10513 · doi:10.1088/2058-9565/ae0aef
Abstract
As quantum computing progresses towards the early fault-tolerant regime, quantum error correction will play a crucial role in protecting qubits and enabling logical Clifford operations. However, the number of logical qubits will initially remain limited, posing challenges for resource-intensive tasks like magic state distillation. It is therefore essential to develop efficient methods for implementing non-Clifford operations, such as small-angle rotations, to maximise the computational capabilities of devices within these constraints. In this work, we introduce mitigated magic dilution (MMD) as an approach to synthesise small-angle rotations by employing quantum error mitigation techniques to sample logical Clifford circuits given noisy encoded magic states. We explore the utility of our approach for the simulation of the 2D Fermi-Hubbard model. We identify evolution time regimes where MMD outperforms state-of-the-art synthesis techniques in the number of noisy encoded magic states required for square lattices up to size . Moreover, we demonstrate that our method can provide a practical advantage that is quantified by a better-than-quadratic improvement in the resource requirements for small-angle rotations over classical simulators. This work paves the way for early fault-tolerant demonstrations on devices supporting millions of quantum operations, the so-called MegaQuOp regime.
Authors final copy (V2) with updated abstract
References in corpus (36)
- A variational eigenvalue solver on a quantum processor
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Error mitigation for short-depth quantum circuits
- Characterizing Quantum Supremacy in Near-Term Devices
- Logical quantum processor based on reconfigurable atom arrays
- Quantum error correction below the surface code threshold
- Quantum Error Mitigation
- Surface code quantum computing by lattice surgery
- Practical Quantum Error Mitigation for Near-Future Applications
- The Resource Theory of Stabilizer Computation
- Application of a resource theory for magic states to fault-tolerant quantum computing
- A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
- Even more efficient quantum computations of chemistry through tensor hypercontraction
- Simulation of quantum circuits by low-rank stabilizer decompositions
- Magic State Distillation: Not as Costly as You Think
- Estimating outcome probabilities of quantum circuits using quasiprobabilities
- Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
- Strategies for solving the Fermi-Hubbard model on near-term quantum computers
- Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization
- Quantum computation with realistic magic state factories
- Focus beyond quadratic speedups for error-corrected quantum advantage
- Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation
- Quantum error mitigation as a universal error-minimization technique: applications from NISQ to FTQC eras
- Quantifying quantum speedups: improved classical simulation from tighter magic monotones
- Quantifying magic for multi-qubit operations
- Early Fault-Tolerant Quantum Computing
- A magic state's fidelity can be superior to the operations that created it
- A randomized quantum algorithm for statistical phase estimation
- Shorter gate sequences for quantum computing by mixing unitaries
- Beyond NISQ: The Megaquop Machine
- An efficient magic state approach to small angle rotations
- Shorter quantum circuits via single-qubit gate approximation
- Statistical phase estimation and error mitigation on a superconducting quantum processor
- Probabilistic Interpolation of Quantum Rotation Angles
- Quantum Simulations of Chemistry in First Quantization with any Basis Set
- Error-corrected Hadamard gate simulated at the circuit level