Simulation of Qubit Quantum Circuits via Pauli Propagation

Abstract

We present novel algorithms to estimate outcomes for qubit quantum circuits. Notably, these methods can simulate a Clifford circuit in linear time without ever writing down stabilizer states explicitly. These algorithms outperform previous noisy near-Clifford techniques for most circuits. We identify a large class of input states that can be efficiently simulated despite not being stabilizer states. The algorithms leverage probability distributions constructed from Bloch vectors, paralleling previously known algorithms that use the discrete Wigner function for qutrits.

arXiv comment11 pages, 5 figures. This work is intended to supersede quant-ph/1804.05404

References in corpus (27)

• Quantum Computing in the NISQ era and beyond
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Improved Simulation of Stabilizer Circuits
• Characterizing Quantum Supremacy in Near-Term Devices
• Contextuality supplies the magic for quantum computation
• The Resource Theory of Stabilizer Computation
• CVXPY: A Python-Embedded Modeling Language for Convex Optimization
• Application of a resource theory for magic states to fault-tolerant quantum computing
• Hudson's Theorem for finite-dimensional quantum systems
• Improved classical simulation of quantum circuits dominated by Clifford gates
• Estimating outcome probabilities of quantum circuits using quasiprobabilities
• Contextuality as a resource for models of quantum computation on qubits
• Wigner function negativity and contextuality in quantum computation on rebits
• A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem
• Quantifying magic for multi-qubit operations
• Frame representations of quantum mechanics and the necessity of negativity in quasi-probability representations
• Contextuality and Wigner function negativity in qubit quantum computation
• Robustness of Magic and Symmetries of the Stabiliser Polytope
• Hilbert--Schmidt volume of the set of mixed quantum states
• Qutrit Magic State Distillation
• Introduction to Quantum Gate Set Tomography
• Equivalence between contextuality and negativity of the Wigner function for qudits
• Quantum interference as a resource for quantum speedup
• Unbiased Simulation of Near-Clifford Quantum Circuits
• Quasiprobability representations of quantum mechanics with minimal negativity
• Permutation Symmetry Determines the Discrete Wigner Function
• Qutrit Magic State Distillation Tight in Some Directions

Cited by in corpus (44)

• Stim: a fast stabilizer circuit simulator
• Quantifying the magic of quantum channels
• Quantifying quantum speedups: improved classical simulation from tighter magic monotones
• Quantifying magic for multi-qubit operations
• Stabilizer entropies are monotones for magic-state resource theory
• Fast and converged classical simulations of evidence for the utility of quantum computing before fault tolerance
• Phase space simulation method for quantum computation with magic states on qubits
• Learning quantum circuits of some $T$ gates
• Fast estimation of outcome probabilities for quantum circuits
• Quantifying dynamical magic with completely stabilizer preserving operations as free
• Exponentially tighter bounds on limitations of quantum error mitigation
• Probing quantum complexity via universal saturation of stabilizer entropies
• Real-time operator evolution in two and three dimensions via sparse Pauli dynamics
• Clifford Dressed Time-Dependent Variational Principle
• Symbolic Execution for Quantum Error Correction Programs
• Pauli path simulations of noisy quantum circuits beyond average case
• Bridging magic and non-Gaussian resources via Gottesman-Kitaev-Preskill encoding
• Magic of Random Matrix Product States
• Stabilizer Testing and Magic Entropy via Quantum Fourier Analysis
• On the Hardness of PAC-learning Stabilizer States with Noise
• Stability of classical shadows under gate-dependent noise
• Designing fault-tolerant circuits using detector error models
• Quantifying fermionic nonlinearity of quantum circuits
• Faster Born probability estimation via gate merging and frame optimisation
• Efficient classical simulation and benchmarking of quantum processes in the Weyl basis
• Efficient simulation of parametrized quantum circuits under non-unital noise through Pauli backpropagation
• Efficient Learning of Quantum States Prepared With Few Non-Clifford Gates
• Efficient witnessing and testing of magic in mixed quantum states
• Operational interpretation of the Stabilizer Entropy
• Simulating quantum circuits with arbitrary local noise using Pauli Propagation
• Efficient quantum-enhanced classical simulation for patches of quantum landscapes
• Comparative Study of Sampling-Based Simulation Costs of Noisy Quantum Circuits
• Certifying nonstabilizerness in quantum processors
• Fast generation of Pauli transfer matrices utilizing tensor product structure
• Improved Strong Simulation of Universal Quantum Circuits
• Simulating dynamics of the two-dimensional transverse-field Ising model: a comparative study of large-scale classical numerics
• The Dual Role of Low-Weight Pauli Propagation: A Flawed Simulator but a Powerful Initializer for Variational Quantum Algorithms
• Simulation of quantum computation with magic states via Jordan-Wigner transformations
• Pseudoentanglement Ain't Cheap
• Emulation of large-scale qubit registers with a phase-space approach
• Classical simulation of noisy quantum circuits via locally entanglement-optimal unravelings
• Majorana string simulation of nonequilibrium dynamics in two-dimensional lattice fermion systems
• paces: Parallelized Application of Co-Evolving Subspaces, a method for computing quantum dynamics on GPUs
• Scalable Simulation of Quantum Many-Body Dynamics with Or-Represented Quantum Algebra