Improved Simulation of Stabilizer Circuits

Abstract

The Gottesman-Knill theorem says that a stabilizer circuit -- that is, a quantum circuit consisting solely of CNOT, Hadamard, and phase gates -- can be simulated efficiently on a classical computer. This paper improves that theorem in several directions. First, by removing the need for Gaussian elimination, we make the simulation algorithm much faster at the cost of a factor-2 increase in the number of bits needed to represent a state. We have implemented the improved algorithm in a freely-available program called CHP (CNOT-Hadamard-Phase), which can handle thousands of qubits easily. Second, we show that the problem of simulating stabilizer circuits is complete for the classical complexity class ParityL, which means that stabilizer circuits are probably not even universal for classical computation. Third, we give efficient algorithms for computing the inner product between two stabilizer states, putting any n-qubit stabilizer circuit into a "canonical form" that requires at most O(n^2/log n) gates, and other useful tasks. Fourth, we extend our simulation algorithm to circuits acting on mixed states, circuits containing a limited number of non-stabilizer gates, and circuits acting on general tensor-product initial states but containing only a limited number of measurements.

15 pages. Final version with some minor updates and corrections. Software at http://www.scottaaronson.com/chp

Cited by in corpus (898)

• Noisy intermediate-scale quantum (NISQ) algorithms
• Logical quantum processor based on reconfigurable atom arrays
• The Variational Quantum Eigensolver: a review of methods and best practices
• Quantum Computational Supremacy
• Robust randomized benchmarking of quantum processes
• Quantum Error Correction for Beginners
• Quantum Zeno Effect and the Many-body Entanglement Transition
• Experimental Boson Sampling
• Contextuality supplies the magic for quantum computation
• Measurement-driven entanglement transition in hybrid quantum circuits
• Roads towards fault-tolerant universal quantum computation
• Classical simulation of quantum many-body systems with a tree tensor network
• A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
• Noise tailoring for scalable quantum computation via randomized compiling
• Random Quantum Circuits
• Simulating quantum computation by contracting tensor networks
• Characterizing Quantum Gates via Randomized Benchmarking
• Quantum Error Correction in Scrambling Dynamics and Measurement-Induced Phase Transition
• Quantum advantage with shallow circuits
• Application of a resource theory for magic states to fault-tolerant quantum computing
• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• Stim: a fast stabilizer circuit simulator
• Dynamical purification phase transitions induced by quantum measurements
• Critical properties of the measurement-induced transition in random quantum circuits
• Negative Quasi-Probability as a Resource for Quantum Computation
• Improved classical simulation of quantum circuits dominated by Clifford gates
• Qulacs: a fast and versatile quantum circuit simulator for research purpose
• Scalable probes of measurement-induced criticality
• Characterization of addressability by simultaneous randomized benchmarking
• Information Scrambling in Computationally Complex Quantum Circuits
• Trading classical and quantum computational resources
• Synthesis and Optimization of Reversible Circuits - A Survey
• Low-distance Surface Codes under Realistic Quantum Noise
• Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
• Non-Gaussian Quantum States and Where to Find Them
• Simulation of quantum circuits by low-rank stabilizer decompositions
• Observation of measurement-induced quantum phases in a trapped-ion quantum computer
• NetSquid, a NETwork Simulator for QUantum Information using Discrete events
• Characterizing large-scale quantum computers via cycle benchmarking
• Universal Quantum Computation with the nu=5/2 Fractional Quantum Hall State
• Entanglement phase transitions in measurement-only dynamics
• Provably efficient machine learning for quantum many-body problems
• Process verification of two-qubit quantum gates by randomized benchmarking
• Statistical mechanics of quantum error correcting codes
• Measurement Protected Quantum Phases
• Estimating outcome probabilities of quantum circuits using quasiprobabilities
• Kochen-Specker Contextuality
• What limits the simulation of quantum computers?
• Measurement-induced criticality in (2+1)-d hybrid quantum circuits
• Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
• Exploiting symmetry in variational quantum machine learning
• Computational power of correlations
• Open source software in quantum computing
• Challenges and Opportunities of Near-Term Quantum Computing Systems
• Emerging quantum computing algorithms for quantum chemistry
• Efficient quantum measurement of Pauli operators in the presence of finite sampling error
• Standard Model Physics and the Digital Quantum Revolution: Thoughts about the Interface
• Quantum Copy-Protection and Quantum Money
• Fast simulation of stabilizer circuits using a graph state representation
• Linear growth of quantum circuit complexity
• Fermionic partial tomography via classical shadows
• Conformal invariance and quantum non-locality in critical hybrid circuits
• Three Qubit Randomized Benchmarking
• Entanglement Transition in the Projective Transverse Field Ising Model
• Optimizing Quantum Error Correction Codes with Reinforcement Learning
• Many-body quantum magic
• Computational advantage of quantum random sampling
• Operator scaling dimensions and multifractality at measurement-induced transitions
• Measuring the Capabilities of Quantum Computers
• Reducing T-count with the ZX-calculus
• Robust shadow estimation
• Symmetry enriched phases of quantum circuits
• Quantum Error Correction with the Gottesman-Kitaev-Preskill Code
• Overview and Comparison of Gate Level Quantum Software Platforms
• Quantum error mitigation as a universal error-minimization technique: applications from NISQ to FTQC eras
• Introduction to Haar Measure Tools in Quantum Information: A Beginner's Tutorial
• Full-State Quantum Circuit Simulation by Using Data Compression
• Prospects for Quantum Enhancement with Diabatic Quantum Annealing
• Universal transversal gates with color codes - a simplified approach
• Fractal, logarithmic and volume-law entangled non-thermal steady states via spacetime duality
• Randomized Benchmarking of Multi-Qubit Gates
• An introduction to measurement based quantum computation
• Quantifying the magic of quantum channels
• Universal behavior beyond multifractality of wave-functions at measurement--induced phase transitions
• Quantifying nonstabilizerness of matrix product states
• Establishing the Quantum Supremacy Frontier with a 281 Pflop/s Simulation
• Quantifying quantum speedups: improved classical simulation from tighter magic monotones
• A random walk approach to quantum algorithms
• Stabilizer entropies and nonstabilizerness monotones
• Tutorial: Gate-based superconducting quantum computing
• Direct randomized benchmarking for multi-qubit devices
• Quantifying magic for multi-qubit operations
• Parallelizing Quantum Circuits
• On entropy growth and the hardness of simulating time evolution
• The ZX-calculus is complete for stabilizer quantum mechanics
• Spacetime duality between localization transitions and measurement-induced transitions
• Efficient error models for fault-tolerant architectures and the Pauli twirling approximation
• Majorana nanowires for topological quantum computation
• Scalable measures of magic resource for quantum computers
• Measuring magic on a quantum processor
• Schur-Weyl Duality for the Clifford Group with Applications: Property Testing, a Robust Hudson Theorem, and de Finetti Representations
• Hadamard-free circuits expose the structure of the Clifford group
• Efficient classical simulation of noisy random quantum circuits in one dimension
• Randomized benchmarking of single and multi-qubit control in liquid-state NMR quantum information processing
• A Study of Optimal 4-bit Reversible Toffoli Circuits and Their Synthesis
• Robust Extraction of Tomographic Information via Randomized Benchmarking
• Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules
• Measurement-induced phase transitions in $(d+1)$-dimensional stabilizer circuits
• Efficiently computable bounds for magic state distillation
• No-Go Theorems for Quantum Resource Purification
• Many-body magic via Pauli-Markov chains -- from criticality to gauge theories
• Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation
• Experimental Estimation of Quantum State Properties from Classical Shadows
• Measurement-induced phase transitions in quantum automaton circuits
• A randomized quantum algorithm for statistical phase estimation
• Stabilizer entropies are monotones for magic-state resource theory
• Graph States as a Resource for Quantum Metrology
• Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance
• Random quantum circuits are approximate unitary $t$-designs in depth $O\left(n{t}^{5+o(1)}\right)$
• Low overhead fault-tolerant quantum error correction with the surface-GKP code
• Quantum-centric Supercomputing for Materials Science: A Perspective on Challenges and Future Directions
• Measurement-Induced Power-Law Negativity in an Open Monitored Quantum Circuit
• Catalysis and activation of magic states in fault tolerant architectures
• Enhancing Generative Models via Quantum Correlations
• A measurement-based variational quantum eigensolver
• Error mitigation for universal gates on encoded qubits
• Cross Entropy Benchmark for Measurement-Induced Phase Transitions
• There and back again: A circuit extraction tale
• Linear Depth Stabilizer and Quantum Fourier Transformation Circuits with no Auxiliary Qubits in Finite Neighbor Quantum Architectures
• Minimizing State Preparations in Variational Quantum Eigensolver by Partitioning into Commuting Families
• Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics
• An Introduction to Quantum Programming in Quipper
• Scalable randomized benchmarking of quantum computers using mirror circuits
• Qubits in phase space: Wigner function approach to quantum error correction and the mean king problem
• Coherence in quantum error-correcting codes
• Ancilla-Driven Universal Quantum Computation
• Nonstabilizerness via matrix product states in the Pauli basis
• Fast quantum circuit cutting with randomized measurements
• Universal fault-tolerant gates on concatenated stabilizer codes
• Time-Space Complexity of Quantum Search Algorithms in Symmetric Cryptanalysis
• How to efficiently select an arbitrary Clifford group element
• Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits
• Controlling entanglement at absorbing state phase transitions in random circuits
• Correlation measures and the entanglement wedge cross-section after quantum quenches in two-dimensional conformal field theories
• Experimentally scalable protocol for identification of correctable codes
• Measuring nonstabilizerness via multifractal flatness
• Phase transition in magic with random quantum circuits
• Efficient Representation of Topologically Ordered States with Restricted Boltzmann Machines
• Experimental Estimation of Average Fidelity of a Clifford Gate on a 7-qubit Quantum Processor
• Long-range big quantum-data transmission
• Quantum coding with low-depth random circuits
• Nonstabilizerness determining the hardness of direct fidelity estimation
• Simulation of Qubit Quantum Circuits via Pauli Propagation
• Many-body quantum teleportation via operator spreading in the traversable wormhole protocol
• Pauli Spectrum and Non-stabilizerness of Typical Quantum Many-Body States
• Magic spreading in random quantum circuits
• ADAPT: Mitigating Idling Errors in Qubits via Adaptive Dynamical Decoupling
• Efficient quantum algorithms for stabilizer entropies
• Constructing Smaller Pauli Twirling Sets for Arbitrary Error Channels
• Dynamical Magic Transitions in Monitored Clifford+T Circuits
• Measurement-induced criticality as a data-structure transition
• Implementation of Clifford gates in the Ising-anyon topological quantum computer
• Logical blocks for fault-tolerant topological quantum computation
• Entanglement growth in diffusive systems
• Scalable and Flexible Classical Shadow Tomography with Tensor Networks
• Optimized compiler for Distributed Quantum Computing
• Errors and pseudo-thresholds for incoherent and coherent noise
• Scrambling Transition in a Radiative Random Unitary Circuit
• Shorter stabilizer circuits via Bruhat decomposition and quantum circuit transformations
• Entanglement phase transitions in random stabilizer tensor networks
• A semi-classical limit for the many-body localization transition
• Error Rates and Resource Overheads of Repetition Cat Qubits
• Approximation of real error channels by Clifford channels and Pauli measurements
• Topology, criticality, and dynamically generated qubits in a stochastic measurement-only Kitaev model
• Time-Efficient Constant-Space-Overhead Fault-Tolerant Quantum Computation
• Local Hamiltonians Whose Ground States are Hard to Approximate
• Uniqueness of noncontextual models for stabilizer subtheories
• Quantum Advantage from Sequential-Transformation Contextuality
• Circuit optimization of Hamiltonian simulation by simultaneous diagonalization of Pauli clusters
• A State Distillation Protocol to Implement Arbitrary Single-qubit Rotations
• Classical Shadows for Quantum Process Tomography on Near-term Quantum Computers
• Efficient unitary designs with a system-size independent number of non-Clifford gates
• Probabilistic Model--Checking of Quantum Protocols
• Quantum vs. classical information: operator negativity as a probe of scrambling
• Non-stabilizerness versus entanglement in matrix product states
• qTorch: The Quantum Tensor Contraction Handler
• Coherence requirements for quantum communication from hybrid circuit dynamics
• Unbiased Simulation of Near-Clifford Quantum Circuits
• Simulating quantum circuits with ZX-calculus reduced stabiliser decompositions
• From estimation of quantum probabilities to simulation of quantum circuits
• Accelerated Randomized Benchmarking
• Simulating a measurement-induced phase transition for trapped ion circuits
• Improved error thresholds for measurement-free error correction
• Cost-Reduced All-Gaussian Universality with the Gottesman-Kitaev-Preskill Code: Resource-Theoretic Approach to Cost Analysis
• A hidden variable model for universal quantum computation with magic states on qubits
• Efficient classical simulation of Clifford circuits with nonstabilizer input states
• Topological order and entanglement dynamics in the measurement-only XZZX quantum code
• Triviality of quantum trajectories close to a directed percolation transition
• Comparison of a quantum error correction threshold for exact and approximate errors
• Probing sign structure using measurement-induced entanglement
• Reversible Circuit Optimization via Leaving the Boolean Domain
• Fault-tolerance thresholds for the surface code with fabrication errors
• Entanglement-magic separation in hybrid quantum circuits
• Augmenting Density Matrix Renormalization Group with Clifford Circuits
• Critical behaviors of non-stabilizerness in quantum spin chains
• Quantum advantage of unitary Clifford circuits with magic state inputs
• Validating Quantum-Classical Programming Models with Tensor Network Simulations
• A taxonomy of small Markovian errors
• Nonnegative subtheories and quasiprobability representations of qubits
• Encoding qubits in multimode grid states
• Pseudomagic Quantum States
• Lower bound for the T count via unitary stabilizer nullity
• Majorana Loop Models for Measurement-Only Quantum Circuits
• Quantum complexity in gravity, quantum field theory, and quantum information science
• Predicting Gibbs-State Expectation Values with Pure Thermal Shadows
• Fault Tolerance with Bare Ancillae for a [[7,1,3]] Code
• All pure fermionic non-Gaussian states are magic states for matchgate computations
• Tractable Simulation of Error Correction with Honest Approximations to Realistic Fault Models
• Optimal verification of stabilizer states
• Network architecture for a topological quantum computer in silicon
• On the logical operators of quantum codes
• Partially Fault-tolerant Quantum Computing Architecture with Error-corrected Clifford Gates and Space-time Efficient Analog Rotations
• Unitary $2$-designs from random $X$- and $Z$-diagonal unitaries
• Magic in generalized Rokhsar-Kivelson wavefunctions
• Learning efficient decoders for quasi-chaotic quantum scramblers
• Unforgeable Quantum Encryption
• Artificial Intelligence for Quantum Computing
• Error mitigation and quantum-assisted simulation in the error corrected regime
• Clifford Circuit Optimization with Templates and Symbolic Pauli Gates
• Universal quantum computation on the power of quantum non-demolition measurements
• Holographic measurement and bulk teleportation
• Neural-Network Decoders for Measurement Induced Phase Transitions
• Improved ancilla preparation scheme increases fault-tolerant threshold
• Efficient solvability of Hamiltonians and limits on the power of some quantum computational models
• Scale invariance of entanglement dynamics in Grover's quantum search algorithm
• Protecting quantum memories using coherent parity check codes
• Fault-tolerant protection of near-term trapped-ion topological qubits under realistic noise sources
• Stabilizer Tensor Networks: universal quantum simulator on a basis of stabilizer states
• T-count and T-depth of any multi-qubit unitary
• Transport and entanglement growth in long-range random Clifford circuits
• How many quantum gates do gauge theories require?
• Hard decoding algorithm for optimizing thresholds under general Markovian noise
• Learning quantum circuits of some $T$ gates
• Universal KPZ scaling in noisy hybrid quantum circuits
• Fault-Tolerant Quantum Error Correction for non-Abelian Anyons
• Fast estimation of outcome probabilities for quantum circuits
• Quantum Pseudorandomness and Classical Complexity
• Fluid fermionic fragments for optimizing quantum measurements of electronic Hamiltonians in the variational quantum eigensolver
• Reducing the Depth of Linear Reversible Quantum Circuits
• Quantum State Complexity in Computationally Tractable Quantum Circuits
• Constructing quantum circuits with global gates
• Stabilizer extent is not multiplicative
• Finite-time teleportation phase transition in random quantum circuits
• Adaptive estimation of quantum observables
• Connectivity constrains quantum codes
• Models of quantum computation and quantum programming languages
• Discrete Wigner Formalism for Qubits and Non-Contextuality of Clifford Gates on Qubit Stabilizer States
• Universal MBQC with generalised parity-phase interactions and Pauli measurements
• Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral
• Quantum entanglement patterns in the structure of atomic nuclei within the nuclear shell model
• Error statistics and scalability of quantum error mitigation formulas
• Interpretable Quantum Advantage in Neural Sequence Learning
• Depth optimization of CZ, CNOT, and Clifford circuits
• Randomized benchmarking for non-Markovian noise
• Matchgate and space-bounded quantum computations are equivalent
• Improving quantum measurements by introducing "ghost" Pauli products
• Unscrambling Quantum Information with Clifford decoders
• Character randomized benchmarking for non-multiplicity-free groups with applications to subspace, leakage, and matchgate randomized benchmarking
• Optimising Clifford Circuits with Quantomatic
• Error-detection-based quantum fault tolerance against discrete Pauli noise
• Statistical mechanics model for Clifford random tensor networks and monitored quantum circuits
• Quantum expectation-value estimation by computational basis sampling
• Measurement induced entanglement transition in two dimensional shallow circuit
• Quantum error correction failure distributions: comparison of coherent and stochastic error models
• Learning quantum states and unitaries of bounded gate complexity
• Decodable hybrid dynamics of open quantum systems with Z_2 symmetry
• Measurement-induced phase transitions in sparse nonlocal scramblers
• A linearized stabilizer formalism for systems of finite dimension
• Optimization of Clifford Circuits
• Entanglement Structure and Information Protection in Noisy Hybrid Quantum Circuits
• Efficient simulatability of continuous-variable circuits with large Wigner negativity
• Infinite-randomness criticality in monitored quantum dynamics with static disorder
• Quantum Magic and Multi-Partite Entanglement in the Structure of Nuclei
• Thrifty shadow estimation: re-using quantum circuits and bounding tails
• Stabilizer entropy in non-integrable quantum evolutions
• Introduction to Quantum Error Correction and Fault Tolerance
• A single $T$-gate makes distribution learning hard
• Practical Topological Cluster State Quantum Computing Requires Loss Below 1%
• A polynomial time and space heuristic algorithm for T-count
• ZX-calculus for the working quantum computer scientist
• Entangling four logical qubits beyond break-even in a nonlocal code
• Strategies for practical advantage of fault-tolerant circuit design in noisy trapped-ion quantum computers
• Direct measurement of Bacon-Shor code stabilizers
• Fourier expansion in variational quantum algorithms
• Optimal Thresholds for Fracton Codes and Random Spin Models with Subsystem Symmetry
• Quantum circuits and low-degree polynomials over F_2
• Magic-induced computational separation in entanglement theory
• Fast Stabiliser Simulation with Quadratic Form Expansions
• Complexity and entanglement in non-local computation and holography
• Crystalline Quantum Circuits
• Scrambling and quantum chaos indicators from long-time properties of operator distributions
• Synthesis of and compilation with time-optimal multi-qubit gates
• A High Performance Compiler for Very Large Scale Surface Code Computations
• Parallelizing quantum circuit synthesis
• Retrieving information from a black hole using quantum machine learning
• LIMDD: A Decision Diagram for Simulation of Quantum Computing Including Stabilizer States
• Unifying the Clifford Hierarchy via Symmetric Matrices over Rings
• Further extensions of Clifford circuits and their classical simulation complexities
• Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications
• Measurement-induced criticality in ${\mathbb{Z}}_2$-symmetric quantum automaton circuits
• Phase transition in Stabilizer Entropy and efficient purity estimation
• Nonstabilizerness of Permutationally Invariant Systems
• Detecting and stabilizing measurement-induced symmetry-protected topological phases in generalized cluster models
• Phase polynomials synthesis algorithms for NISQ architectures and beyond
• Closed-form analytic expressions for shadow estimation with brickwork circuits
• Quantum computation is the unique reversible circuit model for which bits are balls
• Learning shallow quantum circuits
• Magic of quantum hypergraph states
• Graphical description of the action of Clifford operators on stabilizer states
• Multifractality in non-unitary random dynamics
• Error mitigation with Clifford quantum-circuit data
• Magic Resources of the Heisenberg Picture
• Classically estimating observables of noiseless quantum circuits
• A quantum primality test with order finding
• Efficient rate-adaptive reconciliation for continuous-variable quantum key distribution
• Robustness of QMA against witness noise
• The XP Stabiliser Formalism: a Generalisation of the Pauli Stabiliser Formalism with Arbitrary Phases
• Benchmarking Quantum Computer Simulation Software Packages: State Vector Simulators
• Stabilizer notation for Spekkens' toy theory
• Coherent errors and readout errors in the surface code
• Complexity of quantum circuits via sensitivity, magic, and coherence
• Doubly optimal parallel wire cutting without ancilla qubits
• Demonstration of Robust and Efficient Quantum Property Learning with Shallow Shadows
• Quantifying dynamical magic with completely stabilizer preserving operations as free
• Efficient estimation of trainability for variational quantum circuits
• Limits on Efficient Computation in the Physical World
• Entanglement Growth and Minimal Membranes in $(d+1)$ Random Unitary Circuits
• Modular Parity Quantum Approximate Optimization
• Fault-tolerant measurement-free quantum error correction with multi-qubit gates
• Stabilizer subsystem decompositions for single- and multi-mode Gottesman-Kitaev-Preskill codes
• Averaged circuit eigenvalue sampling
• Hybrid Stabilizer Matrix Product Operator
• A Practical Introduction to Benchmarking and Characterization of Quantum Computers
• Deterministic Fast Scrambling with Neutral Atom Arrays
• 6-qubit Optimal Clifford Circuits
• Quantum Error Correction via Noise Guessing Decoding
• Qubit-Efficient Randomized Quantum Algorithms for Linear Algebra
• Extended flag gadgets for low-overhead circuit verification
• Quantum Convolutional Neural Networks are Effectively Classically Simulable
• Logical independence and quantum randomness
• Classical simulation of non-Gaussian fermionic circuits
• Contextuality bounds the efficiency of classical simulation of quantum processes
• Constructions for Quantum Indistinguishability Obfuscation
• Complexity phase diagram for interacting and long-range bosonic Hamiltonians
• Lie-algebraic classical simulations for quantum computing
• Strong-to-weak symmetry breaking states in stochastic dephasing stabilizer circuits
• Clifford Dressed Time-Dependent Variational Principle
• Mana and thermalization: probing the feasibility of near-Clifford Hamiltonian simulation
• Efficient simulation of quantum error correction under coherent error based on non-unitary free-fermionic formalism
• Programmable Multi-Node Quantum Network Design and Simulation
• Simultaneous Discovery of Quantum Error Correction Codes and Encoders with a Noise-Aware Reinforcement Learning Agent
• Handbook for Quantifying Robustness of Magic
• Depth-Optimized Reversible Circuit Synthesis
• Boundary transfer matrix spectrum of measurement-induced transitions
• Efficient mutual magic and magic capacity with matrix product states
• Optimization of CNOT circuits on limited connectivity architecture
• Solving search problems by strongly simulating quantum circuits
• Approximate complex amplitude encoding algorithm and its application to data classification problems
• Stabilizer disentangling of conformal field theories
• Quantum communication cost of preparing multipartite entanglement
• Measurement-induced phase transitions in the toric code
• Hierarchical Clifford transformations to reduce entanglement in quantum chemistry wavefunctions
• Quantum non-malleability and authentication
• Relating Measurement Patterns to Circuits via Pauli Flow
• Gravitational back-reaction is magical
• Contextuality and The Single-Qubit Stabilizer Formalism
• Evaluating a quantum-classical quantum Monte Carlo algorithm with Matchgate shadows
• A Silicon Surface Code Architecture Resilient Against Leakage Errors
• A (quasi-)polynomial time heuristic algorithm for synthesizing T-depth optimal circuits
• Magic State Distillation with the Ternary Golay Code
• Quantum Non-Local Nonstabilizerness
• Efficient sampling of noisy shallow circuits via monitored unraveling
• High-performance repetition cat code using fast noisy operations
• Analysis of a Quantum Error Correcting Code using Quantum Process Calculus
• Opening the Black Box Inside Grover's Algorithm
• Chaos and magic in the dissipative quantum kicked top
• Triply efficient shadow tomography
• Representations of the multi-qubit Clifford group
• Computation with Unitaries and One Pure Qubit
• The role of cohomology in quantum computation with magic states
• Stabilizer entropy of quantum tetrahedra
• Tensor Network Decoding Beyond 2D
• Effects of quantum resources on the statistical complexity of quantum circuits
• Quantum Simulation Logic, Oracles, and the Quantum Advantage
• Efficient simulation of Gottesman-Kitaev-Preskill states with Gaussian circuits
• Compilation of algorithm-specific graph states for quantum circuits
• Quantum Protocols within Spekkens' Toy Model
• Assessing and Advancing the Potential of Quantum Computing: A NASA Case Study
• The classical-quantum limit
• Completeness of the ZX-Calculus
• Non-equilibrium quantum Monte Carlo algorithm for stabilizer Renyi entropy in spin systems
• Measurement-free implementations of small-scale surface codes for quantum dot qubits
• Fast graph operations in quantum computation
• Computing quopit Clifford circuit amplitudes by the sum-over-paths technique
• Architecture aware compilation of quantum circuits via lazy synthesis
• Stabilizer Tensor Networks with Magic State Injection
• Zero-temperature entanglement membranes in quantum circuits
• Optimal classical-communication-assisted local model of n-qubit Greenberger-Horne-Zeilinger correlations
• The Learnability of Quantum States
• One-shot quantum error correction of classical and quantum information
• Enhancing Quantum Computation via Superposition of Quantum Gates
• Power of one non-clean qubit
• What the foundations of quantum computer science teach us about chemistry
• Gaussian Elimination versus Greedy Methods for the Synthesis of Linear Reversible Circuits
• Error mitigation by training with fermionic linear optics
• Symbolic Execution for Quantum Error Correction Programs
• Simulation of quantum optics by coherent state decomposition
• Independent stabilizer Rényi entropy and entanglement fluctuations in random unitary circuits
• Private and Robust States for Distributed Quantum Sensing
• A Regular Representation of Quantum Circuits
• Pauli path simulations of noisy quantum circuits beyond average case
• Efficient Formal Verification of Quantum Error Correcting Programs
• Natural parameterized quantum circuit
• Quantum Complexity Fluctuations from Nuclear and Hypernuclear Forces
• Entanglement Transitions in Unitary Circuit Games
• A Perspective on Quantum Computing Applications in Quantum Chemistry using 25--100 Logical Qubits
• Approximate stabilizer rank and improved weak simulation of Clifford-dominated circuits for qudits
• Spectral Properties Versus Magic Generation in $T$-doped Random Clifford Circuits
• Quantum circuit compilation and hybrid computation using Pauli-based computation
• Efficient Inner-product Algorithm for Stabilizer States
• The Classification of Clifford Gates over Qubits
• Efficient learning of quantum states prepared with few fermionic non-Gaussian gates
• Low rank matrix recovery from Clifford orbits
• Special Session: Noisy Intermediate-Scale Quantum (NISQ) Computers -- How They Work, How They Fail, How to Test Them?
• Efficient Detection of Strong-To-Weak Spontaneous Symmetry Breaking via the Rényi-1 Correlator
• Optimizing quantum error correction protocols with erasure qubits
• Automated Synthesis of Fault-Tolerant State Preparation Circuits for Quantum Error Correction Codes
• No-Go Theorems for Universal Entanglement Purification
• Reducing the Resources Required by ADAPT-VQE Using Coupled Exchange Operators and Improved Subroutines
• Efficient learning of $t$-doped stabilizer states with single-copy measurements
• Error-correction and noise-decoherence thresholds for coherent errors in planar-graph surface codes
• Spekkens' toy model in all dimensions and its relationship with stabilizer quantum mechanics
• Analysis of Quantum Entanglement in Quantum Programs using Stabilizer Formalism
• Near-linear constructions of exact unitary 2-designs
• An introduction to one-way quantum computing in distributed architectures
• Noisy Stabilizer Formalism
• The Computational Complexity of Linear Optics
• The axiomatic and the operational approaches to resource theories of magic do not coincide
• Fault-tolerant quantum architectures based on erasure qubits
• Non-Stabilizerness of Sachdev-Ye-Kitaev Model
• Benchmarking quantum gates and circuits
• Error-correcting codes for fermionic quantum simulation
• Neural-Shadow Quantum State Tomography
• The principle of majorization: application to random quantum circuits
• Entanglement and absorbing state transitions in $(d+1)$-dimensional stabilizer circuits
• Magic phase transition and non-local complexity in generalized $W$ State
• Disentangling critical quantum spin chains with Clifford circuits
• Lowering Connectivity Requirements For Bivariate Bicycle Codes Using Morphing Circuits
• Generalized Quantum Repeater Graph States
• Fully scalable randomized benchmarking without motion reversal
• On the Hardness of PAC-learning Stabilizer States with Noise
• Production of lattice gauge-Higgs topological states in measurement-only quantum circuit
• Nonstabilizerness dynamics in many-body localized systems
• Recommendation systems with quantum k-NN and Grover's algorithms for data processing
• Loss-tolerant architecture for quantum computing with quantum emitters
• Entanglement Purification with Quantum LDPC Codes and Iterative Decoding
• Reinforcement Learning Based Quantum Circuit Optimization via ZX-Calculus
• Constant depth fault-tolerant Clifford circuits for multi-qubit large block codes
• Long-range nonstabilizerness and phases of matter
• Improved simulation of quantum circuits dominated by free fermionic operations
• State complexity and quantum computation
• Measurement-free fault-tolerant logical zero-state encoding of the distance-three nine-qubit surface code in a one-dimensional qubit array
• Comparative study of quantum error correction strategies for the heavy-hexagonal lattice
• Quantum Error Correction from Complexity in Brownian SYK
• Scalable noise characterization of syndrome-extraction circuits with averaged circuit eigenvalue sampling
• Discrete Wigner Function Derivation of the Aaronson-Gottesman Tableau Algorithm
• Clifford Group and Unitary Designs under Symmetry
• Quantum simulation using noisy unitary circuits and measurements
• Towards chemical accuracy with shallow quantum circuits: A Clifford-based Hamiltonian engineering approach
• Classical simulation of non-Gaussian bosonic circuits
• Bridging Entanglement and Magic Resources within Operator Space
• Entanglement-induced provable and robust quantum learning advantages
• Nonstabilizerness of a Boundary Time Crystal
• On Groups in the Qubit Clifford Hierarchy
• CNOT circuits need little help to implement arbitrary Hadamard-free Clifford transformations they generate
• Magic transition in measurement-only circuits
• Low-depth Clifford circuits approximately solve MaxCut
• Non-unitary Entanglement Dynamics in Continuous Variable Systems
• Measurement-based infused circuits for variational quantum eigensolvers
• Mixing and localisation in random time-periodic quantum circuits of Clifford unitaries
• Reliable computation from contextual correlations
• ZKCM: a C++ library for multiprecision matrix computation with applications in quantum information
• SANQ: A Simulation Framework for Architecting Noisy Intermediate-Scale Quantum Computing System
• Optimal Hadamard gate count for Clifford$+T$ synthesis of Pauli rotations sequences
• Stable measurement-induced Floquet enriched topological order
• A Generic Compilation Strategy for the Unitary Coupled Cluster Ansatz
• Contextuality in composite systems: the role of entanglement in the Kochen-Specker theorem
• Decoding the Projective Transverse Field Ising Model
• Optimizing ZX-Diagrams with Deep Reinforcement Learning
• Fast Classical Simulation of Hamiltonian Dynamics by Simultaneous Diagonalization Using Clifford Transformation with Parallel Computation
• Bulk-Measurement-Induced Boundary Phase Transition in Toric Code and Gauge-Higgs Model
• Zero and Finite Temperature Quantum Simulations Powered by Quantum Magic
• Geometric Rényi Divergence and its Applications in Quantum Channel Capacities
• Contextual bound states for qudit magic state distillation
• Structured volume-law entanglement in an interacting, monitored Majorana spin liquid
• Hierarchies of resources for measurement-based quantum computation
• Faster variational quantum algorithms with quantum kernel-based surrogate models
• Improved Simulation of Quantum Circuits by Fewer Gaussian Eliminations
• Randomized Benchmarking of Clifford Operators
• Absence of localization in two-dimensional Clifford circuits
• A SAT Scalpel for Lattice Surgery: Representation and Synthesis of Subroutines for Surface-Code Fault-Tolerant Quantum Computing
• Steering-induced phase transition in measurement-only quantum circuits
• Quantum linear network coding for entanglement distribution in restricted architectures
• On maximum-likelihood decoding with circuit-level errors
• Entanglement phase diagrams from partial transpose moments
• A nonstabilizerness monotone from stabilizerness asymmetry
• Interplay of entanglement structures and stabilizer entropy in spin models
• Stabilizer Entanglement Distillation and Efficient Fault-Tolerant Encoders
• Compact Neural-network Quantum State representations of Jastrow and Stabilizer states
• How to Sum and Exponentiate Hamiltonians in ZXW Calculus
• Pauli Decomposition via the Fast Walsh-Hadamard Transform
• Analytical Error Analysis of Clifford Gates by the Fault-Path Tracer Method
• Designing fault-tolerant circuits using detector error models
• A Graphical Calculus for Lagrangian Relations
• Exponential Families for Bayesian Quantum Process Tomography
• Parallel Quantum Chemistry on Noisy Intermediate-Scale Quantum Computers
• Mixed-state additivity properties of magic monotones based on quantum relative entropies for single-qubit states and beyond
• Semiclassical Formulation of Gottesman-Knill and Universal Quantum Computation
• Subsystem Information Capacity in Random Circuits and Hamiltonian Dynamics
• Phase transition and evidence of fast-scrambling phase in measurement-only quantum circuit
• Emulating Quantum Interference with Generalized Ising Machines
• Learning stabilizer states by Bell sampling
• Exotic Symmetry Breaking Properties of Self-Dual Fracton Spin Models
• Simulation of Quantum Computers: Review and Acceleration Opportunities
• Realistic simulation of quantum computation using unitary and measurement channels
• Linear and non-linear relational analyses for Quantum Program Optimization
• NoRA: A Tensor Network Ansatz for Volume-Law Entangled Equilibrium States of Highly Connected Hamiltonians
• Benchmarking 50-Photon Gaussian Boson Sampling on the Sunway TaihuLight
• Improved Graph Formalism for Quantum Circuit Simulation
• New Limits on Fault-Tolerant Quantum Computation
• Kerdock Codes Determine Unitary 2-Designs
• Deep Quantum Circuit Simulations of Low-Energy Nuclear States
• Graph Optimization Perspective for Low-Depth Trotter-Suzuki Decomposition
• Fermionic Magic Resources of Quantum Many-Body Systems
• Quantum simulation from the bottom up: the case of rebits
• A Solvable Model of Quantum Darwinism-Encoding Transitions
• Accelerating quantum imaginary-time evolution with random measurements
• Synthesis of CNOT-Dihedral circuits with optimal number of two qubit gates
• Entanglement transitions induced by quantum-data collection
• Efficient contextual ontological model of $n$-qubit stabilizer quantum mechanics
• Lower Bounds on Stabilizer Rank
• Stabilizer ground states for simulating quantum many-body physics: theory, algorithms, and applications
• Applicability of Measurement-based Quantum Computation towards Physically-driven Variational Quantum Eigensolver
• Random insights into the complexity of two-dimensional tensor network calculations
• An Entropic Lens on Stabilizer States
• Imperfect quantum networks with tailored resource states
• From the Bloch sphere to phase space representations with the Gottesman-Kitaev-Preskill encoding
• Faster Born probability estimation via gate merging and frame optimisation
• Protect Measurement-Induced Phase Transition from Noise
• Quantum Complexity: restrictions on algorithms and architectures
• Optimization of deterministic photonic graph state generation via local operations
• Intrinsic mixed state topological order in a stabilizer system under stochastic decoherence: Strong-to-weak spontaneous symmetry breaking from percolation point of view
• Predicting Features of Quantum Systems from Very Few Measurements
• Adiabatic graph-state quantum computation
• Abstraqt: Analysis of Quantum Circuits via Abstract Stabilizer Simulation
• Computational Distinguishability of Quantum Channels
• Temporal Entanglement Barriers in Dual-Unitary Clifford Circuits with Measurements
• Complementarity and Entanglement in Quantum Information Theory
• The Encoding and Decoding Complexities of Entanglement-Assisted Quantum Stabilizer Codes
• Entanglement structure in the volume-law phase of hybrid quantum automaton circuits
• Scalable evaluation of quantum-circuit error loss using Clifford sampling
• Fast and robust quantum state tomography from few basis measurements
• Entanglement dynamics in U(1) symmetric hybrid quantum automaton circuits
• The Qupit Stabiliser ZX-travaganza: Simplified Axioms, Normal Forms and Graph-Theoretic Simplification
• AND-gates in ZX-calculus: Spider Nest Identities and QBC-completeness
• FeynmanDD: Quantum Circuit Analysis with Classical Decision Diagrams
• A game of quantum advantage: linking verification and simulation
• AKLT-states as ZX-diagrams: diagrammatic reasoning for quantum states
• Fault-tolerant compiling of classically hard IQP circuits on hypercubes
• Stabilizer Scars
• Non-producibility of arbitrary non-Gaussian states using zero-mean Gaussian states and partial photon number resolving detection
• Efficient simulation of parametrized quantum circuits under non-unital noise through Pauli backpropagation
• Efficient Learning of Quantum States Prepared With Few Non-Clifford Gates
• Reduce&chop: Shallow circuits for deeper problems
• Evolving Quantum Circuits
• Dynamical subset sampling of quantum error correcting protocols
• A universal crossover in quantum circuits governed by a proximate classical error correction transition
• The Gauge Theory of Measurement-Based Quantum Computation
• Realization of Shor's Algorithm at Room Temperature
• Universal Spreading of Conditional Mutual Information in Noisy Random Circuits
• Electron-to-nuclear spectral mapping via "Galton board" dynamic nuclear polarization
• Graphical CSS Code Transformation Using ZX Calculus
• The qudit Pauli group: non-commuting pairs, non-commuting sets, and structure theorems
• Completeness of the ZH-calculus
• Hardware-Efficient Quantum Random Access Memory Design with a Native Gate Set on Superconducting Platforms
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits
• Qudit Shadow Estimation Based on the Clifford Group and the Power of a Single Magic Gate
• Disentangling magic states with classically simulable quantum circuits
• Quantum circuits with classically simulable operator scrambling
• Efficient measurement schemes for bosonic systems
• Discovery of Optimal Quantum Error Correcting Codes via Reinforcement Learning
• Fault-Tolerant Stabilizer Measurements in Surface Codes with Three-Qubit Gates
• Understanding the Quantum Computational Speed-up via De-quantisation
• Efficient fault-tolerant code switching via one-way transversal CNOT gates
• Speedy Contraction of ZX Diagrams with Triangles via Stabiliser Decompositions
• Fault-tolerant structures for measurement-based quantum computation on a network
• Building Qutrit Diagonal Gates from Phase Gadgets
• Maximal Magic for Two-qubit States
• An Algebraic Axiomatisation of ZX-calculus
• Verifying Fault-Tolerance of Quantum Error Correction Codes
• Phase-transition-like behavior in information retrieval of a quantum scrambled random circuit system
• Empirical learning of dynamical decoupling on quantum processors
• Efficient classical computation of expectation values in a class of quantum circuits with an epistemically restricted phase space representation
• Efficient percolation simulations for lossy photonic fusion networks
• Feynman-path type simulation using stabilizer projector decomposition of unitaries
• Computing quantum magic of state vectors
• Qubit assignment using time reversal
• An Exact Link between Nonlocal Nonstabilizerness and Operator Entanglement
• Information Scrambling in Free Fermion Systems with a Sole Interaction
• Onset of scrambling as a dynamical transition in tunable-range quantum circuits
• Hybrid magic state distillation for universal fault-tolerant quantum computation
• Coherent errors in stabilizer codes caused by quasistatic phase damping
• Operational interpretation of the Stabilizer Entropy
• Fast simulation of planar Clifford circuits
• Generators and Relations for Un(Z[1/2,i])
• Non-stabilizerness in quantum-enhanced metrological protocols
• Tunable Geometries in Sparse Clifford Circuits
• Generators and Relations for Real Stabilizer Operators
• Multipartite Nonlocality in Clifford Networks
• Experimental demonstration of Pauli-frame randomization on a superconducting qubit
• The Hadamard gate cannot be replaced by a resource state in universal quantum computation
• Dynamical phase transitions of information flow in random quantum circuits
• Automatic Test Pattern Generation for Robust Quantum Circuit Testing
• Bulk and boundary entanglement transitions in the projective gauge-Higgs model
• Integrability of Goldilocks quantum cellular automata
• Counting stabiliser codes for arbitrary dimension
• Scaling W state circuits in the qudit Clifford hierarchy
• Efficient quantum-enhanced classical simulation for patches of quantum landscapes
• Prepare-and-Magic: Semi-Device Independent Magic Certification in the Prepare-and-Measure Scenario
• An Algorithm for Reversible Logic Circuit Synthesis Based on Tensor Decomposition
• Robust ultra-shallow shadows
• Low-overhead quantum error correction codes with a cyclic topology
• Picturing Counting Reductions with the ZH-Calculus
• Entropy in Quantum Information Theory -- Communication and Cryptography
• Circuit lower bounds for low-energy states of quantum code Hamiltonians
• Quantum Circuit Discovery for Fault-Tolerant Logical State Preparation with Reinforcement Learning
• Non-stabilizerness of Neural Quantum States
• Generators and Relations for 2-Qubit Clifford+T Operators
• Comparative Study of Sampling-Based Simulation Costs of Noisy Quantum Circuits
• Anticoncentration and State Design of Doped Real Clifford Circuits and Tensor Networks
• Systematic construction of topological-nontopological hybrid universal quantum gates based on many-body Majorana fermion interactions
• Stabilizer Circuits, Quadratic Forms, and Computing Matrix Rank
• Simple Hamiltonian dynamics is a powerful quantum processing resource
• Partition Function Estimation: Quantum and Quantum-Inspired Algorithms
• Entanglement Properties of SU(2) Gauge Theory
• Approximate Quantum Codes From Long Wormholes
• Normalizer circuits and a Gottesman-Knill theorem for infinite-dimensional systems
• Automated Verification of Silq Quantum Programs using SMT Solvers
• Differentiating and Integrating ZX Diagrams with Applications to Quantum Machine Learning
• Unconditional quantum magic advantage in shallow circuit computation
• GraphiQ: Quantum circuit design for photonic graph states
• Exact entanglement probability distribution of bi-partite randomised stabilizer states
• Faster computation of nonstabilizerness
• Local spreading of stabilizer Rényi entropy in a brickwork random Clifford circuit
• The Future of Computing: Bits + Neurons + Qubits
• Emergent unitary designs for encoded qubits from coherent errors and syndrome measurements
• Approximate inverse measurement channel for shallow shadows
• Quantum Algorithms and Oracles with the Scalable ZX-calculus
• On the average-case complexity of learning output distributions of quantum circuits
• The 7 faces of quantum NP
• Lower Bounds for Learning Quantum States with Single-Copy Measurements
• Normalizer Circuits and Quantum Computation
• Lower T-count with faster algorithms
• Efficient entanglement purification based on noise guessing decoding
• A trace distance-based geometric analysis of the stabilizer polytope for few-qubit systems
• Methods for Classically Simulating Noisy Networked Quantum Architectures
• The Role of Quantum Computing in Advancing Scientific High-Performance Computing: A perspective from the ADAC Institute
• Hamiltonian Learning via Shadow Tomography of Pseudo-Choi States
• On the Power of Reusable Magic States
• SWAP-less Implementation of Quantum Algorithms
• Generating $k$ EPR-pairs from an $n$-party resource state
• Possibilistic simulation of quantum circuits by classical circuits
• Renormalization view on resonance proliferation between many-body localized phases
• Stabilizer-Accelerated Quantum Many-Body Ground-State Estimation
• Classical simulability of Clifford+T circuits with Clifford-augmented matrix product states
• Hidden variable model for quantum computation with magic states on qudits of any dimension
• Procedurally Optimised ZX-Diagram Cutting for Efficient T-Decomposition in Classical Simulation
• Measurement-only dynamical phase transition of topological and boundary order in toric code and gauge-Higgs models
• Abelian Hypergroups and Quantum Computation
• Absorbing State Phase Transition with Clifford Circuits
• Reducing circuit depth with qubitwise diagonalization
• A Theory of Direct Randomized Benchmarking
• Minimizing the negativity of quantum circuits in overcomplete quasiprobability representations
• Clifford Orbits from Cayley Graph Quotients
• A Rubik's Cube inspired approach to Clifford synthesis
• Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of Quantum Computing
• Extending Classically Simulatable Bounds of Clifford Circuits with Nonstabilizer States via Framed Wigner Functions
• Blindly Factorizing 21 Quantumly
• Transforming Collections of Pauli Operators into Equivalent Collections of Pauli Operators over Minimal Registers
• Multi-agent blind quantum computation without universal cluster states
• Fast algorithms for classical specifications of stabiliser states and Clifford gates
• Entanglement spectrum of matchgate circuits with universal and non-universal resources
• Leveraging commuting groups for an efficient variational Hamiltonian ansatz
• Nonclassical correlations in subsystems of globally entangled quantum states
• Improved performance of the Bacon-Shor code with Steane's syndrome extraction method
• HybridQ: A Hybrid Simulator for Quantum Circuits
• Achieving the volume-law entropy regime with random-sign Dicke states
• Hierarchy of emergent cluster states by measurement from symmetry-protected-topological states with large symmetry to subsystem cat state
• Transforming graph states via Bell state measurements
• Architectures and random properties of symplectic quantum circuits
• Wigner's Theorem for stabilizer states and quantum designs
• A consolidating review of Spekkens' toy theory
• Far from Perfect: Quantum Error Correction with (Hyperinvariant) Evenbly Codes
• Sequency Hierarchy Truncation (SeqHT) for Adiabatic State Preparation and Time Evolution in Quantum Simulations
• Optimally generating $\mathfrak{su}(2^N)$ using Pauli strings
• Coherent Information Phase Transition in a Noisy Quantum Circuit
• On the role of coherence for quantum computational advantage
• Stabilizing Non-Abelian Topological Order against Heralded Noise via Local Lindbladian Dynamics
• A quantum computing approach to fixed-node Monte Carlo using classical shadows
• Generating graph states with a single quantum emitter and the minimum number of fusions
• Momentum space magic for the transverse field quantum Ising model
• Randomized measurements for multi-parameter quantum metrology
• Clifford circuit based heuristic optimization of fermion-to-qubit mappings
• Solvable Quantum Circuits in Tree+1 Dimensions
• Nonstabilizerness generation in a multiparticle quantum walk
• Rise and fall of nonstabilizerness via random measurements
• Measurement-Driven Transitions between Area Law Phases
• Bit-Slicing the Hilbert Space: Scaling Up Accurate Quantum Circuit Simulation to a New Level
• Empirical determination of the simulation capacity of a near-term quantum computer
• The Quantum Frontier
• Postselection threshold against biased noise
• Improved Strong Simulation of Universal Quantum Circuits
• Bosonic Pauli+: Efficient Simulation of Concatenated Gottesman-Kitaev-Preskill Codes
• A Bayesian quasi-probability approach to inferring the past of quantum observables
• Clifford Manipulations of Stabilizer States: A graphical rule book for Clifford unitaries and measurements on cluster states, and application to photonic quantum computing
• No quantum solutions to linear constraint systems in odd dimension from Pauli group and diagonal Cliffords
• Clifford Circuits can be Properly PAC Learned if and only if $\text{RP}=\text{NP}$
• Memory-corrected quantum repeaters with adaptive syndrome identification
• Almost optimal measurement scheduling of molecular Hamiltonian via finite projective plane
• The Magic Barrier before Thermalization
• Majorana braiding simulations with projective measurements
• Quantum Darwinism-encoding transitions on expanding trees
• Invested and Potential Magic Resources in Measurement-Based Quantum Computation
• Stabilizer states and local realism
• BGLS: A Python Package for the Gate-by-Gate Sampling Algorithm to Simulate Quantum Circuits
• Universal graph representation of stabilizer codes
• Entanglement of weighted graphs uncovers transitions in variable-range interacting models
• A Thermodynamic Turing Machine: Artificial Molecular Computing Using Classical Reversible Logic Switching Networks
• Simulating quantum computation: how many "bits" for "it"?
• On Classical Simulation of Quantum Circuits Composed of Clifford Gates
• A Complete and Natural Rule Set for Multi-Qutrit Clifford Circuits
• Clifford-Dressed Variational Principles for Precise Loschmidt Echoes
• Analyzing the free states of one quantum resource theory as resource states of another
• Agnostic Process Tomography
• Quantum Lego and XP Stabilizer Codes
• On Computational Complexity of Unitary and State Design Properties
• Identifying Entanglement Phases with Bipartite Projected Ensembles
• Quantum State Isomorphism
• Contextuality Can be Verified with Noncontextual Experiments
• Polynomially restricted operator growth in dynamically integrable models
• Multipartite Greenberger-Horne-Zeilinger Entanglement in Monitored Random Clifford Circuits
• Error Channels and the Threshold for Fault-tolerant Quantum Computation
• Classical Coding Approaches to Quantum Applications
• Minimally Universal Parity Quantum Computing
• Robustness of Magic in the quantum Ising chain via Quantum Monte Carlo tomography
• Quantum control without quantum states
• ZX-calculus is Complete for Finite-Dimensional Hilbert Spaces
• Measurement-only circuit of perturbed toric code on triangular lattice: Topological entanglement, 1-form symmetry and logical qubits
• Cross-level Validation of Topological Quantum Circuits
• Anticoncentration in Clifford Circuits and Beyond: From Random Tensor Networks to Pseudo-Magic States
• Q-Pandora Unboxed: Characterizing Noise Resilience of Quantum Error Correction Codes
• The robustness of magic state distillation against errors in Clifford gates
• On the stabilizer complexity of Hawking radiation
• Instantaneous Quantum Polynomial-Time Sampling and Verifiable Quantum Advantage: Stabilizer Scheme and Classical Security
• Phase transitions in (2 + 1)D subsystem-symmetric monitored quantum circuits
• Simulation of quantum computation with magic states via Jordan-Wigner transformations
• A graph-state based synthesis framework for Clifford isometries
• Sampling-based quasiprobability simulation for fault-tolerant quantum error correction on the surface codes under coherent noise
• Robustly decorrelating errors with mixed quantum gates
• Decomposition of Pauli groups via weak central products
• Harvesting stabilizer entropy and non-locality from a quantum field
• Fractal structure of multipartite entanglement in monitored quantum circuits
• Efficient simulation of logical magic state preparation protocols
• Competing automorphisms and disordered Floquet codes
• Phase Coordinate Uncomputation in Quantum Recursive Fourier Sampling
• Connecting Magic Dynamics in Thermofield Double States to Spectral Form Factors
• Efficient Eigenstate Preparation in an Integrable Model with Hilbert Space Fragmentation
• The Parity Flow Formalism: Tracking Quantum Information Throughout Computation
• Quantum foundations for quantum technologies in the International Year of Quantum (2025)
• Quantifying magic via quantum $(\alpha ,\beta )$ Jensen-Shannon divergence
• Seeding neural network quantum states with tensor network states
• Quantum conditional mutual information as a probe of measurement-induced entanglement phase transitions
• Targeted Clifford logical gates for hypergraph product codes
• Complexity of Quadratic Quantum Chaos
• Global Synthesis of CNOT Circuits with Holes
• Quantum Magic in Discrete-Time Quantum Walk
• Measurement-induced criticality in extended and long-range unitary circuits
• Tailoring Fault-Tolerance to Quantum Algorithms
• Scalable Spider Nests (...Or How to Graphically Grok Transversal Non-Clifford Gates)
• QMC: A Model Checker for Quantum Systems
• Fast Classical Simulation of Quantum Circuits via Parametric Rewriting in the ZX-Calculus
• "Galton board" nuclear hyperpolarization
• Quantum Theory from Principles, Quantum Software from Diagrams
• Optimal number of stabilizer measurement rounds in an idling surface code patch
• Artificial intelligence for representing and characterizing quantum systems
• Efficient classical-communication-assisted local simulation of n-qubit GHZ correlations
• Quantum Computation and Communication in Bosonic Systems
• Averaging gate approximation error and performance of Unitary Coupled Cluster ansatz in Pre-FTQC Era
• Optimal Space-Depth Trade-Off of CNOT Circuits in Quantum Logic Synthesis
• Optimal quantum reservoir learning in proximity to universality
• Quantum error correction in a time-dependent transverse field Ising model
• Stabilization of symmetry-protected long-range entanglement in stochastic quantum circuits
• Resource-efficient shadow tomography using equatorial stabilizer measurements
• Characterization of non-adaptive Clifford channels
• Enhancement of non-Stabilizerness within Indefinite Causal Order
• Recursive Path-Summing Simulation of Quantum Computation
• Chasing shadows with Gottesman-Kitaev-Preskill codes
• Bounding Entanglement Entropy with Clifford Double Cosets
• An Error Mitigated Non-Orthogonal Quantum Eigensolver via Shadow Tomography
• Computational Perspectives on Bell Inequalities and Many-body Quantum Correlations
• End-to-End Quantum Algorithms for the Jones Polynomial
• Scalable and fault-tolerant preparation of encoded k-uniform states
• Operator Imprecision and Scaling of Shor's Algorithm
• A streamlined demonstration that stabilizer circuits simulation reduces to Boolean linear algebra
• Efficient Classical Simulation of the DQC1 Circuit with Zero Discord
• A further look into combinatorial orthogonality
• The Contextual Heisenberg Microscope
• Probabilistic Representation of Commutative Quantum Circuit Models
• Qudit Noisy Stabilizer Formalism
• Process Tomography for Clifford Unitaries
• Fast Scrambling in Classically Simulable Quantum Circuits
• Reducing stabilizer circuits without the symplectic group
• Resilience-Runtime Tradeoff Relations for Quantum Algorithms
• Scalable Simulation of Fermionic Encoding Performance on Noisy Quantum Computers
• High-expressibility Quantum Neural Networks using only classical resources
• Comparison of spin-qubit architectures for quantum error-correcting codes
• Computational Complexity and Simulability of Non-Hermitian Quantum Dynamics
• Polynomial-Time Classical Simulation of Hidden Shift Circuits via Confluent Rewriting of Symbolic Sums
• Scalable Simulation of Quantum Many-Body Dynamics with Or-Represented Quantum Algebra
• Noncontextual Pauli Hamiltonians
• An Algorithm for Estimating $\alpha$-Stabilizer Rényi Entropies via Purity
• Hoare meets Heisenberg: A Lightweight Logic for Quantum Programs
• Classical algorithms for Forrelation
• Gradient Scalability and Taylor Surrogation of Quantum Cost Landscapes
• Disordered purification phase transition in hybrid random circuits
• Efficient classical computation of the neural tangent kernel of quantum neural networks
• Efficient and simple Gibbs state preparation of the 2D toric code via duality to classical Ising chains
• Contextuality from the vacuum
• Classical simulation of noisy quantum circuits via locally entanglement-optimal unravelings
• Quantum Resource Management in the NISQ Era: Challenges, Vision, and a Runtime Framework
• Classical algorithms for measurement-adaptive Gaussian circuits
• Benchmarking Single-Qubit Gates on a Neutral Atom Quantum Processor
• Quantum Monte Carlo and Stabilizer States
• Van Hove singularities in stabilizer entropy densities
• Symmetry-Accelerated Classical Simulation of Clifford-Dominated Circuits
• Adaptively secure unitary designs with constant non-Clifford cost
• Measurement-induced entanglement in noisy 2D random circuits
• Benchmarking non-Clifford gates using only Pauli twirling group
• Clifford Gates in the Holant Framework
• Resource complexity of Symmetry Protected Topological phases
• CNOT Minimal Circuit Synthesis: A Reinforcement Learning Approach
• GCAMPS: A Scalable Classical Simulator for Qudit Systems
• Bayesian inference of general noise-model parameters from the syndrome statistics of surface codes
• Gauge and diffeomorphism invariance from quantum information principles
• No-cost Bell nonlocality certification from quantum tomography and its applications in quantum-magic-resource witnessing
• Optimized Aaronson-Gottesman stabilizer circuit simulation through quantum circuit transformations
• Exact and Efficient Stabilizer Simulation of Thermal-Relaxation Noise for Quantum Error Correction
• Distribution of Non-Locality On Quantum Random Circuits
• Who can compete with quantum computers? Lecture notes on quantum inspired tensor networks computational techniques
• Phase-sensitive superposition of quantum states
• Non-commutative Index of Measurement-only Entanglement Phase Transition
• Limits of Clifford Disentangling in Tensor Network States
• Distilling GHZ States using Stabilizer Codes
• Circular CNOT Circuits: Definition, Analysis and Application to Fault-Tolerant Quantum Circuits
• One-Way Quantum Computer Simulation
• GNarsil: Splitting Stabilizers into Gauges
• Pseudoentanglement Ain't Cheap
• Agnostic Tomography of Stabilizer Product States
• Reduced quantum circuits for stabilizer states and graph states
• Computable and noncomputable in the quantum domain: statements and conjectures
• High-performance parallel classical scheme for simulating shallow quantum circuits
• Efficient classical simulation of cluster state quantum circuits with alternative inputs
• Universal Optimal Gates Regarding Quantum Entanglement and Discord Generating
• Incoherent Approximation of Leakage in Quantum Error Correction
• Performance and Error Analysis of Knill's Postselection Scheme in a Two-Dimensional Architecture
• Classical representation of local Clifford operators
• Simulating Special but Natural Quantum Circuits
• A multiprecision matrix calculation library and its extension library for a matrix-product-state simulation of quantum computing
• Polynomials Modulo Composite Numbers: Ax-Katz type theorems for the structure of their solution sets
• Synthesis of the Optimal 4-bit Reversible Circuits
• Efficient decoding of stabilizer code by single-qubit local operations and classical communication
• Engineering entanglement geometry via spacetime-modulated measurements
• Quadratic Form Expansions for Unitaries
• A computer-friendly construction of the monster
• Benchmarking quantum devices beyond classical capabilities
• Entanglement transition and suppression of critical phase of thermofield double state in monitored quantum circuit with unitary $R$ matrix gates
• Dynamical cluster-based strategy for improving tensor network algorithms in quantum circuit simulations
• From Information Theory Puzzles in Deletion Channels to Deniability in Quantum Cryptography