Exact efficient simulation of noisy logical magic states using Clifford stabilizers

• URL: http://arxiv.org/abs/2609.16929v1
• Date: Tue, 15 Sep 2026 10:05:21 GMT
• Title: Exact efficient simulation of noisy logical magic states using Clifford stabilizers
• Abstract summary: Preparation of high-fidelity logical magic states is a crucial for universal fault-tolerant quantum computation (FTQC)<n>We introduce Clifford-stabilizer simulation, an exact and efficient algorithm based on updating a Clifford-stabilizer group.<n>Our algorithm for Clifford-stabilizer simulation maps a non-Clifford circuit with sampled circuit-level Pauli errors to a Clifford circuit that exactly reproduces its measurement outcome.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The preparation of high-fidelity logical magic states is a crucial subroutine for universal fault-tolerant quantum computation (FTQC). Predicting the performance of FTQC and developing improved protocols rely on numerical methods to classically simulate logical magic state preparation in the presence of noise. Clifford logic on Pauli-stabilizer codes with circuit-level Pauli errors can be efficiently simulated using Pauli-stabilizer formalism, but the non-Clifford operations required to prepare logical magic states render generic simulation inefficient. We introduce Clifford-stabilizer simulation, an exact and efficient algorithm based on updating a Clifford-stabilizer group to simulate noisy preparation protocols for a broad class of logical magic states used to implement non-Clifford gates in the third level of the Clifford hierarchy under circuit-level Pauli errors. Clifford-stabilizer simulation applies to a range of operations that commonly appear in preparation protocols for such logical magic states, including Pauli-stabilizer measurements, logical Clifford measurements, and transversal non-Clifford gates. Our algorithm for Clifford-stabilizer simulation maps a non-Clifford circuit with sampled circuit-level Pauli errors to a Clifford circuit that exactly reproduces its measurement outcome distribution, achieving time and space complexities polynomial in relevant protocol parameters. We perform exact simulation of magic state cultivation up to fault distance 7 by Clifford-stabilizer simulation. Our method provides a route to perform exact benchmarking of large-scale logical magic state preparation protocols required for useful FTQC.

Related papers

• SymFT: Universal Fault-Tolerant Quantum Circuit Simulation via Symbolic Clifford--Pauli Frames and Stabilizer Coordinates [1.8668905919280483]
  We present SymFT, a high-induced simulator for Clifford-dominated circuits with Pauli rotations, Pauli noise, mid-circuit Pauli measurements, and measurement-record-controlled Pauli feedback.<n>SymFT achieves state-of-the-art sampling performance across the tested pure-Clifford and near-Clifford circuits.
  arXiv  Detail & Related papers  (2026-07-30T17:51:54Z)
• Magic-protected entanglement and Clifford-irreducible structure in magic state space [45.88028371034407]
  We develop a Clifford-orbit framework for studying magic-protected entanglement.<n>It defines canonical representatives, spectra, and ranks that characterize the Clifford-irreducible structure of a state.<n>These results identify magical entanglement as an orbit-level diagnostic of how nonstabilizerness protects quantum correlations against Clifford reduction.
  arXiv  Detail & Related papers  (2026-07-20T18:00:20Z)
• Stochastic Pauli-path simulator for large-scale quantum optimization [57.179828941706006]
  Pauli-path simulators offer a promising route to large-scale classical simulation of quantum circuits in the low-magic regime.<n>Existing approaches either lack native support for gradient-based optimization or suffer from severe gradient bias.<n>Here we propose the Pauli-path simulator (SPPS), a computational framework for large-scale quantum optimization.
  arXiv  Detail & Related papers  (2026-07-20T10:43:44Z)
• Clifft: Fast Exact Simulation of Near-Clifford Quantum Circuits [0.0]
  We introduce Clifft, an open-source simulator that shifts the dominant exponential cost from the total qubit count to a dynamic active subspace.<n>Clifft enables, to our knowledge, the first exact end-to-end simulation of magic state cultivation including the escape stage.
  arXiv  Detail & Related papers  (2026-04-29T18:00:10Z)
• Efficient simulation of logical magic state preparation protocols [0.0]
  We introduce a method for simulating logical magic state preparation protocols under the standard circuit-level noise model.<n>We provide a proof-of-principle numerical simulation that prepares a magic state using such logical Clifford measurements.
  arXiv  Detail & Related papers  (2025-12-29T19:00:05Z)
• STABSim: A Parallelized Clifford Simulator with Features Beyond Direct Simulation [11.931352847653763]
  We present the first GPU-accelerated stabilizer simulator to scale better than CPU gates in quantum computing.<n>We then implement a new error model that captures non-unitarity in T1/T2 error channels much faster and with exact accuracy for most physical qubits.
  arXiv  Detail & Related papers  (2025-07-03T18:05:19Z)
• Unlocking early fault-tolerant quantum computing with mitigated magic dilution [41.95227943686519]
  We introduce mitigated magic dilution (MMD) as an approach to synthesise small-angle rotations.<n>This work paves the way for early fault-tolerant demonstrations on devices supporting millions of quantum operations.
  arXiv  Detail & Related papers  (2025-05-15T17:19:19Z)
• Clifford and Non-Clifford Splitting in Quantum Circuits: Applications and ZX-Calculus Detection Procedure [49.1574468325115]
  We propose and analyze use cases that come from quantum circuits that can be written as product between a Clifford and a Non-Clifford unitary.<n>We make use of ZX-Calculus and its assets to detect a limiting border of these circuits that would allow for a separation between a Clifford section and a Non-Clifford section.
  arXiv  Detail & Related papers  (2025-04-22T16:10:34Z)
• Universal quantum computation via scalable measurement-free error correction [45.29832252085144]
  We show that universal quantum computation can be made fault-tolerant in a scenario where the error-correction is implemented without mid-circuit measurements.<n>We introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $mathitCCZ$ gate.<n>In particular, our findings support that below-breakeven logical performance is achievable with a circuit-level error rate below $10-3$.
  arXiv  Detail & Related papers  (2024-12-19T18:55:44Z)
• Clifford Perturbation Approximation for Quantum Error Mitigation [6.8335953981503454]
  Quantum error mitigation (QEM) is critical for harnessing the potential of near-term quantum devices.<n>We propose a learning-based error mitigation framework called Clifford Perturbation Data Regression (CPDR)<n>CPDR constructs training sets by Clifford circuits with small perturbations.
  arXiv  Detail & Related papers  (2024-12-12T18:01:54Z)
• Fault-Tolerant Constant-Depth Clifford Gates on Toric Codes [51.205673783866146]
  We propose and simulate a set of fault-tolerant and constant-depth logical gates on 2D toric codes.<n>This set combines fold-transversal gates, Dehn twists and single-shot logical Pauli measurements and generates the full Clifford group.
  arXiv  Detail & Related papers  (2024-11-27T12:17:56Z)
• Extending Classically Simulatable Bounds of Clifford Circuits with Nonstabilizer States via Framed Wigner Functions [3.9482012852779085]
  Wigner function formalism has played a pivotal role in examining the non-classical aspects of quantum states and their classical simulatability.<n>We propose a novel classical simulation method for qubit Clifford circuits based on the framed Wigner function.
  arXiv  Detail & Related papers  (2023-07-31T14:02:33Z)
• Iterative Qubit Coupled Cluster using only Clifford circuits [36.136619420474766]
  An ideal state preparation protocol can be characterized by being easily generated classically. We propose a method that meets these requirements by introducing a variant of the iterative qubit coupled cluster (iQCC) We demonstrate the algorithm's correctness in ground-state simulations and extend our study to complex systems like the titanium-based compound Ti(C5H5)(CH3)3 with a (20, 20) active space.
  arXiv  Detail & Related papers  (2022-11-18T20:31:10Z)
• Efficient simulation of Gottesman-Kitaev-Preskill states with Gaussian circuits [68.8204255655161]
  We study the classical simulatability of Gottesman-Kitaev-Preskill (GKP) states in combination with arbitrary displacements, a large set of symplectic operations and homodyne measurements. For these types of circuits, neither continuous-variable theorems based on the non-negativity of quasi-probability distributions nor discrete-variable theorems can be employed to assess the simulatability.
  arXiv  Detail & Related papers  (2022-03-21T17:57:02Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.