StabilizerBench is a new benchmark for evaluating AI agents on generating, optimizing, and making fault-tolerant stabilizer circuits for quantum error correction, with efficient verification and multi-tier scoring.
super hub Canonical reference
The Heisenberg Representation of Quantum Computers
Canonical reference. 85% of citing Pith papers cite this work as background.
105
Pith papers citing it
Background
85% of classified citations
abstract
Since Shor's discovery of an algorithm to factor numbers on a quantum computer in polynomial time, quantum computation has become a subject of immense interest. Unfortunately, one of the key features of quantum computers - the difficulty of describing them on classical computers - also makes it difficult to describe and understand precisely what can be done with them. A formalism describing the evolution of operators rather than states has proven extremely fruitful in understanding an important class of quantum operations. States used in error correction and certain communication protocols can be described by their stabilizer, a group of tensor products of Pauli matrices. Even this simple group structure is sufficient to allow a rich range of quantum effects, although it falls short of the full power of quantum computation.
hub tools
citation-role summary
background 12
method 1
citation-polarity summary
claims ledger
- abstract Since Shor's discovery of an algorithm to factor numbers on a quantum computer in polynomial time, quantum computation has become a subject of immense interest. Unfortunately, one of the key features of quantum computers - the difficulty of describing them on classical computers - also makes it difficult to describe and understand precisely what can be done with them. A formalism describing the evolution of operators rather than states has proven extremely fruitful in understanding an important class of quantum operations. States used in error correction and certain communication protocols can
- method Section 5 concludes with a summary of results and future directions. 2 Frame-Factored State Representation Standard state vector simulation scales exponentially with the total number of qubits in the system. However, fault-tolerant quantum circuits are typically dominated by Clifford operations, which can be tracked efficiently via the Gottesman-Knill theorem [37]. We utilize this structure by shifting from the standard Schrödinger picture to a hybrid representation that decouples the state into
- background [40] Z. Wang,Topological Quantum Computation, American Mathematical Society (2010). [41] M.A. Nielsen and I.L. Chuang,Quantum Computation and Quantum Information, Cambridge University Press, 10th anniversary edition ed. (2010). [42] S. Aaronson and D. Gottesman,Improved simulation of stabilizer circuits,Phys. Rev. A70(2004) 052328 [quant-ph/0406196v5]. [43] D. Gottesman,The heisenberg representation of quantum computers, in22nd International Colloquium on Group Theoretical Methods in Physics, pp
- background as starting points to include correlations, while the modern tools of tensor networks offer controlled, low-entanglement expansions around tensor-product states. Another notable class of states in the Hilbert space, that was only recently introduced in the many body-physics area [30], is that of stabilizer states. As first pointed out by Gottesmann and Knill [31], these states are special in that they can be prepared efficiently with classical computing [31,32], while being able to support high
- background The study of the complexity of classical algorithms informs us that some problems cannot be solved by computers in reasonable timeframes. Quantum computers can solve these problems quickly, and the construction of these devices will bring profound technological changes in the upcoming decades. Some practical applications for which quantum algorithms currently exist include molecular simulation for drug discovery and material design [BGM+19, LBG+21, SBW+21, RBK+23], algorithms that break public-k
- background advantage using photons, Science370, 1460 (2020), https://www.science.org/doi/pdf/10.1126/science.abe8770. [4] D. Gottesman, The heisenberg representation of quantum computers, arXiv preprint quant-ph/9807006 (1998). [5] S. Bravyi and A. Kitaev, Universal quantum computa- tion with ideal clifford gates and noisy ancillas, Physical Review A71, 022316 (2005). [6] A. Mari and J. Eisert, Positive wigner functions ren- der classical simulation of quantum computation ef- ficient, Physical Review Lette
- background this by applying probabilistic inequalities such as Cheby- shev's inequality, Pr ∣ψ⟩∼ELU(ψ0) [∣sE(ψ)−∥E∥2 F∣≥kσ] ≤ 1 k2 , whereσ= √ Var(sE(ψ))denotes the standard de- viation. Error Kurtosis and Quantum Magic-In magic- state resource theory, Clifford operations and stabilizer states are considered "free" as a direct consequence of the Gottesman-Knill theorem [13, 14], which establishes their efficient classical simulability. In contrast, non- Clifford gates-though essential for achieving univers
authors
co-cited works
representative citing papers
Single-qudit universality for Clifford gate sets plus one non-Clifford gate follows a trichotomy determined by the prime factorization of the local dimension d.
The Triangle Criterion detects mixed-state magic, proves multi-qubit distillation is strictly stronger than single-qubit schemes, and identifies a purity bound plus undetectable unfaithful magic states.
Sdim is the first open-source qudit stabilizer simulator supporting all dimensions, enabling circuit evaluation and sampling for qudit fault-tolerant quantum computing research.
Non-Hermitian quantum circuits with renormalization after fixed non-unitary gates are equivalent to PostBQP, which equals PP, in the uniform circuit model.
High-rate CSS codes compile nonlocal Clifford and non-Clifford logical circuits into onsite phases and classical permutations, so MPS bond dimension stays fixed by the encoder while logical entanglement, magic, and non-Gaussianity grow.
Lindbladian perturbation theory reveals approximate symmetries on Pauli fidelities for Clifford gates, with only restricted off-diagonal dissipative errors breaking them at first order, enabling gauge fixing for SPAM identification.
BPBO performs certified local resynthesis on one- to three-wire regions of BFK09 brickwork to reduce pattern size while preserving UBQC blindness, demonstrated on Grover and Toffoli cases with reductions up to 3x725 to 3x98.
A new cultivation protocol prepares reusable logical catalysts as eigenstates of high-period Clifford circuits to implement exact Z^{2^{-b}} phase gates with constant online depth in surface codes.
Doped matchgate circuits achieve approximate parity-preserving 2-designs in polylogarithmic depth using a sparse number of non-Gaussian gates, with the design formation mapped exactly to a birth-death Markov chain.
Subsystem decoherence on extended cluster states generates a hierarchy of mixed SPT phases ending in Z2 SWSSB with glassy GHZ entanglement.
QMCtwin simulates master-equation syndrome statistics for a distance-7 surface code and reveals biases and correlations absent in Pauli-twirled models.
Introduces Pauli Hamiltonians with planted block-product ground states via frustration-free clauses that subsume classical planted CSPs and are exposed as polynomial Pauli sums.
Classical repetition-code framing plus SAT search yields no-go theorems (no d>3 T-to-T on <8 qubits) and the smallest known unitary factories for d=4,5 T-states (10–11 qubits) and d=3,4 CCZ-states (9–10 qubits).
A Set-Transformer architecture with self-attention encodes Pauli-string correlations, optimizes via commutation objective, and finds symmetries with near-deterministic success on physical models like Ising and Toric code.
BASS adapts qubit bases via single-qubit RDM eigenbases to cluster amplitudes for truncation, yielding up to order-of-magnitude state-overlap gains versus fixed-basis sparse simulation on disordered Ising circuits.
COM exhibits KS contextuality without requiring Bohmian contextuality, showing the two are distinct.
CRiSP uses neural-guided MCTS and curriculum learning to insert Clifford prefixes before parameterized rotations in VQAs, yielding mean 3.17x and max 45x gains in energy accuracy on 22-qubit QAOA benchmarks versus prior Clifford initializers.
Stabilizer Rényi entropy provides an exact closed-form witness for CP phases in spin-0 decays that standard entanglement quantifiers miss, with linear and quartic magic-inspired observables proposed for collider use.
Above a critical noise strength, operator scrambling in random circuits is suppressed leading to classical simulability; below it, simulation stays exponentially hard.
In U(1)-symmetric random circuits, initial states with lower stabilizer Rényi entropy generate nonstabilizerness faster than those with higher entropy, with the effect also depending on spatial charge structure and extending to SU(2) circuits and Hamiltonian dynamics.
A Monte Carlo Tree Search with GNN-based magic estimation biases quantum circuit search toward target nonstabilizerness levels and yields better results on ground-state energy and state approximation problems.
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.
Nonlocal magic in fermionic Gaussian states is bounded by the entanglement spectrum of the covariance matrix, is extensive in the Haar ensemble, peaks at criticality in the Kitaev chain, and grows diffusively under random circuits.
citing papers explorer
-
StabilizerBench: A Benchmark for AI-Assisted Quantum Error Correction Circuit Synthesis
StabilizerBench is a new benchmark for evaluating AI agents on generating, optimizing, and making fault-tolerant stabilizer circuits for quantum error correction, with efficient verification and multi-tier scoring.
-
Quantum Universality in Composite Systems: A Trichotomy of Clifford Resources
Single-qudit universality for Clifford gate sets plus one non-Clifford gate follows a trichotomy determined by the prime factorization of the local dimension d.
-
Triangle Criterion: a mixed-state magic criterion with applications in distillation and detection
The Triangle Criterion detects mixed-state magic, proves multi-qubit distillation is strictly stronger than single-qubit schemes, and identifies a purity bound plus undetectable unfaithful magic states.
-
Sdim: A Qudit Stabilizer Simulator
Sdim is the first open-source qudit stabilizer simulator supporting all dimensions, enabling circuit evaluation and sampling for qudit fault-tolerant quantum computing research.
-
Computational Complexity and Simulability of Non-Hermitian Quantum Dynamics
Non-Hermitian quantum circuits with renormalization after fixed non-unitary gates are equivalent to PostBQP, which equals PP, in the uniform circuit model.
-
Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks
High-rate CSS codes compile nonlocal Clifford and non-Clifford logical circuits into onsite phases and classical permutations, so MPS bond dimension stays fixed by the encoder while logical entanglement, magic, and non-Gaussianity grow.
-
Symmetries of Pauli Noise from Lindbladian Dynamics
Lindbladian perturbation theory reveals approximate symmetries on Pauli fidelities for Clifford gates, with only restricted off-diagonal dissipative errors breaking them at first order, enabling gauge fixing for SPAM identification.
-
BPBO: Blindness-Preserving Brickwork Optimization by Certified Region Resynthesis
BPBO performs certified local resynthesis on one- to three-wire regions of BFK09 brickwork to reduce pattern size while preserving UBQC blindness, demonstrated on Grover and Toffoli cases with reductions up to 3x725 to 3x98.
-
Cultivating logical catalysts for fault-tolerant dyadic phase rotations
A new cultivation protocol prepares reusable logical catalysts as eigenstates of high-period Clifford circuits to implement exact Z^{2^{-b}} phase gates with constant online depth in surface codes.
-
Unitary Designs from Doped Matchgate Circuits
Doped matchgate circuits achieve approximate parity-preserving 2-designs in polylogarithmic depth using a sparse number of non-Gaussian gates, with the design formation mapped exactly to a birth-death Markov chain.
-
Hierarchy of mixed symmetry protected topological states in extended cluster states under subsystem decoherence
Subsystem decoherence on extended cluster states generates a hierarchy of mixed SPT phases ending in Z2 SWSSB with glassy GHZ entanglement.
-
QMCtwin: Master-Equation Simulation of Syndrome Statistics Beyond Pauli Noise
QMCtwin simulates master-equation syndrome statistics for a distance-7 surface code and reveals biases and correlations absent in Pauli-twirled models.
-
Planted-Solution Pauli Hamiltonians as a Quantum Benchmarking Primitive
Introduces Pauli Hamiltonians with planted block-product ground states via frustration-free clauses that subsume classical planted CSPs and are exposed as polynomial Pauli sums.
-
Exploring the landscape of compact magic-state distillation factories
Classical repetition-code framing plus SAT search yields no-go theorems (no d>3 T-to-T on <8 qubits) and the smallest known unitary factories for d=4,5 T-states (10–11 qubits) and d=3,4 CCZ-states (9–10 qubits).
-
Attention-based optimizer for symmetry finding
A Set-Transformer architecture with self-attention encodes Pauli-string correlations, optimizes via commutation objective, and finds symmetries with near-deterministic success on physical models like Ising and Toric code.
-
Basis-Adaptive Sparse-State Simulation of Quantum Circuits
BASS adapts qubit bases via single-qubit RDM eigenbases to cluster amplitudes for truncation, yielding up to order-of-magnitude state-overlap gains versus fixed-basis sparse simulation on disordered Ising circuits.
-
Distinguishing Bohmian contextuality from Kochen-Specker contextuality
COM exhibits KS contextuality without requiring Bohmian contextuality, showing the two are distinct.
-
Classical State Preparation for Variational Quantum Algorithms via Reinforcement Learning
CRiSP uses neural-guided MCTS and curriculum learning to insert Clifford prefixes before parameterized rotations in VQAs, yielding mean 3.17x and max 45x gains in energy accuracy on 22-qubit QAOA benchmarks versus prior Clifford initializers.
-
Quantum Magic Reveals CP Phases Invisible to Entanglement in Spin-0 Decays
Stabilizer Rényi entropy provides an exact closed-form witness for CP phases in spin-0 decays that standard entanglement quantifiers miss, with linear and quartic magic-inspired observables proposed for collider use.
-
Noise-induced Simulability Transition from Operator Scrambling
Above a critical noise strength, operator scrambling in random circuits is suppressed leading to classical simulability; below it, simulation stays exponentially hard.
-
Nonstabilizerness Mpemba Effects
In U(1)-symmetric random circuits, initial states with lower stabilizer Rényi entropy generate nonstabilizerness faster than those with higher entropy, with the effect also depending on spatial charge structure and extending to SU(2) circuits and Hamiltonian dynamics.
-
Magic-Informed Quantum Architecture Search
A Monte Carlo Tree Search with GNN-based magic estimation biases quantum circuit search toward target nonstabilizerness levels and yields better results on ground-state energy and state approximation problems.
-
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.
-
Nonlocal nonstabilizerness in free fermion models
Nonlocal magic in fermionic Gaussian states is bounded by the entanglement spectrum of the covariance matrix, is extensive in the Haar ensemble, peaks at criticality in the Kitaev chain, and grows diffusively under random circuits.
-
Continuous Reset-Induced Phase Transition in Measurement-Free Random Quantum Circuits
Reset-induced entanglement phase transitions in measurement-free random quantum circuits are continuous for d=2 with second-order characteristics, unlike large-d classical expectations.
-
Decohered color code and emerging mixed toric code by anyon proliferation: Topological entanglement negativity perspective
Decoherence of the color code produces a mixed state with topological entanglement negativity ln 2 that corresponds to an emergent single toric code.
-
Current-State Opacity in Safe Partially Observed Quantum Petri Nets: True-Concurrency Semantics and Exact Symbolic Verification
Current-state opacity is formalized in safe partially observed quantum Petri nets with true-concurrency semantics and verified exactly via stabilizer formalism and targeted unfolding.
-
Taming Trotter Errors with Quantum Resources
Entanglement entropy bounds the variance of Trotter error downward, and magic drives the error kurtosis downward (Kur = α + βM, β<0 for large systems).
-
Non-stabilizerness and U(1) symmetry in chaotic many-body quantum systems
Exact results show U(1) symmetry substantially suppresses non-stabilizerness in random states, with different leading scaling from entanglement near zero charge density.
-
The Structure of Circle Graph States
Circle graphs are closed under r-local complementation and bipartite circle graph states correspond one-to-one with planar code states whose MBQC is classically simulable.
-
Stabilizer R\'enyi entropy of 3-uniform hypergraph states
Stabilizer Rényi entropy of 3-uniform hypergraph states equals a matrix-rank expression, cutting computation from exponential in 3N to polynomial in N times exponential in N.
-
A Methodological Analysis of Empirical Studies in Quantum Software Testing
A systematic analysis of 59 quantum software testing empirical studies reveals highly diverse designs, inconsistent reporting, and open methodological challenges, leading to recommendations for future work.
-
Exponentially Accelerated Sampling of Pauli Strings for Nonstabilizerness
A sampling method combining fast Walsh-Hadamard transform and Clifford-preconditioned Monte Carlo reduces Pauli-string sampling cost from O(2^N) to O(N) with sample count independent of N for stabilizer Rényi entropies and nullity.
-
Operational interpretation of the Stabilizer Entropy
The stabilizer Rényi entropy governs the exponential rate at which Clifford orbits become indistinguishable from Haar-random states and sets the optimal distinguishability from stabilizer states in property testing.
-
Rise and fall of nonstabilizerness via random measurements
Analytical and numerical study of stabilizer nullity and Rényi entropies in monitored Clifford circuits shows quantized decay for computational measurements and size-dependent relaxation to a non-trivial steady state for rotated bases.
-
Disentangling strategies and entanglement transitions in unitary circuit games with matchgates
Introduces a minimal matchgate circuit representation for fermionic Gaussian states together with a Yang-Baxter update algorithm, then maps out entanglement transitions in unitary circuit games under braiding and generic matchgate rules.
-
Bra-ket entanglement, an indicator bridging entanglement, magic, and coherence
Bra-ket entanglement indicates a shift from coherence-dominated to magic-dominated entanglement generation as its value increases.
-
Classical simulability of Clifford+T circuits with Clifford-augmented matrix product states
Develops an optimization-free disentangling algorithm and algebraic criterion for efficient CAMPS representations of Clifford circuits doped with αI+βP gates, enabling polynomial classical simulation for more circuits including typical N-T-gate random instances.
-
Magic state cultivation: growing T states as cheap as CNOT gates
Magic state cultivation prepares high-fidelity T states with an order of magnitude fewer qubit-rounds than prior distillation methods by gradually growing them within a surface code under depolarizing noise.
-
Plaquette: A hardware-aware design platform for fault-tolerant quantum computers
Plaquette compiles realistic quantum hardware noise models into multiple sampler representations, showing that Pauli-twirled approximations can misestimate logical error rates by an order of magnitude compared to leakage-aware and near-Clifford methods.
-
RubriQ: Rubric-Guided Group Relative Policy Optimization for Constraint-Aware Quantum Circuit Synthesis
A rubric-guided GRPO pipeline fine-tunes a 7B LLM to synthesize quantum circuits achieving 3.31x T-gate compression with <1% hardware-constraint violations, validated on IBM and IonQ processors.
-
Phase-Altered Interleaved Randomized Benchmarking for Compiled Quantum Gates
PA-IRB is a new diagnostic that measures the difference in IRB decay rates between phase-stripped and phase-dressed Clifford interleavers, finding no measurable effect from virtual phases in a compiled Toffoli gate on IBM processors.
-
Diffusive Dynamics of Nonstabilizerness
In U(1)-symmetric 1D random circuits the stabilizer Rényi entropy gap closes diffusively as 1/t, with the same scaling seen in an energy-conserving Ising chain.
-
Quantum resources in non-stoquastic quantum annealing
Numerical evidence that non-stoquastic terms in quantum annealing maintain or increase entanglement and non-stabilizerness, aligning quantum performance gains with classical intractability for tensor networks and stabilizer methods.
-
From Pauli Strings to Quantum Dynamics: A Unified Characterization
Develops an invariant-based framework connecting Pauli Lie algebras to transvection-generated Clifford subgroups for quantum reachability and dynamics analysis.
-
Simulating quantum circuits with a neural statebank
A compact neural statebank based on autoregressive Transformers simulates 34-qubit quantum circuits with ~0.01 infidelity using 0.3 million parameters, outperforming tested approximate simulators.
-
Comparing Classical Simulation and Sample-Based Learning of Quantum Systems
For random MPS and Clifford+T circuits, increases in entanglement or T-count correlate with sharper loss minima and worse reconstruction under constrained neural capacity.
-
Steady-state phases in long-range measurement-only quantum circuits
Long-range competing two- and three-qubit measurements in quantum circuits produce measurement-range-dependent steady states featuring SPT order and non-area-law entanglement.
-
Utility-scale quantum experiments using dynamic circuits to address collective dissipation in interacting qubits
Demonstration of utility-scale quantum simulation of collective dissipation in 1D qubit chains up to 86 emitters using Trotterized dynamic circuits, biased CDR error mitigation, and classical MC-TEBD validation on IBM hardware.
-
Dynamical self-dual criticality in Fibonacci-monitored quantum Ising chains
Dynamical self-duality in Fibonacci-monitored quantum Ising chains predicts two golden-ratio-related critical lines and protects universal criticality in long-time steady states for weak and projective measurements.