Pauli Propagation: A Computational Framework for Simulating Quantum Systems
read the original abstract
Classical methods to simulate quantum systems are not only a key element of the physicist's toolkit for studying many-body models but are also increasingly important for verifying and challenging upcoming quantum computers. Pauli propagation has recently emerged as a promising new family of classical algorithms for simulating digital quantum systems. Here we provide a comprehensive account of Pauli propagation, tracing its algorithmic structure from its bit-level implementation and formulation as a tree-search problem, all the way to its high-level user applications for simulating quantum circuits and dynamics. Utilising these observations, we present PauliPropagation.jl, a Julia software package that can perform rapid Pauli propagation simulation straight out-of-the-box and can be used more generally as a building block for novel simulation algorithms.
This paper has not been read by Pith yet.
Forward citations
Cited by 23 Pith papers
-
Enabling Lie-Algebraic Classical Simulation beyond Free Fermions
New Pauli orbit and modified Gell-Mann bases enable polynomial-cost Lie-algebraic simulation for permutation-equivariant and bounded-excitation quantum dynamics.
-
SAFE ma-QAOA: Surrogate-Assisted and Fine-Tuning Enhanced Multi-Angle QAOA with Parameter Distillation
SAFE ma-QAOA achieves 64.3% fewer active parameters and 94.5% lower estimated QPU workload via surrogate pre-training and parameter distillation on Sherrington-Kirkpatrick, 2D spin glass, and Max-Cut instances.
-
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.
-
Hierarchical entanglement transitions and hidden area-law sectors in quantum many-body dynamics
Local quenches in chaotic quantum systems produce a Renyi-index-tuned hierarchy of entanglement transitions, with S_alpha>1 obeying area law while S_alpha<=1 is volume-law, carried by an O(1)-dimensional dominant Schm...
-
Page Curve for Local-Operator Entanglement from Free Probability
LOE for Haar random dynamics asymptotically matches the Page curve for traceless operators and is independent of the initial operator at leading order.
-
Fermionic mean-field dynamics for spin systems beyond free fermions
fTDHF extends time-dependent Hartree-Fock to fermionized spin-1/2 Hamiltonians, remaining exact for free fermions while handling non-local strings via non-orthogonal Slater determinant transitions and reproducing qual...
-
Fermionic mean-field dynamics for spin systems beyond free fermions
fTDHF is a mean-field dynamics method for spin systems that is formally exact for free fermions and reproduces qualitative features of exact evolution in benchmarks for adiabatic preparation, many-body localization, a...
-
Computing logical error thresholds with the Pauli Frame Sparse Representation
A new sparse Pauli-frame method shows coherent noise thresholds are overestimated by a factor of ~4 under Pauli-twirling and revises the T-to-S gate error rate factor to as high as 7 at distance d=5.
-
Recursion method for out-of-equilibrium many-body dynamics: strengths and limitations
Recursion method extension to quench dynamics is limited by state-dependent quench coefficients c_n lacking universal structure, restricting accurate timescales except for favorable initial states.
-
Combining non-parametric quantum states and MERA tensor networks for ground-state optimization
A hybrid method uses fixed quantum annealing states as boundary resources for classical MERA tensor networks to improve ground-state approximations without deeper quantum circuits.
-
Efficient Fourier-Based Linear Combination of Unitaries and Applications in Quantum Optimization
Fourier-based LCU decomposes diagonal and non-diagonal unitaries into hardware-friendly forms for QAOA-style optimization, trading circuit depth for sampling overhead with performance guarantees.
-
Near-Optimal Quantum Time Evolution Circuits via Provably Convergent Compression
A recipe for initial points in variational compression of quantum time-evolution operators that provably converges to near-optimal O(N t polylog(N t/ε)) gate complexity for local translationally invariant Hamiltonians.
-
Fast, accurate, high-resolution simulation of large-scale Fermi-Hubbard models on a digital quantum processor
A digital quantum processor simulates the 1D Fermi-Hubbard model on up to 120 qubits, observing spin-charge separation and achieving quantitative agreement with TDVP while running up to 3000 times faster in wall-clock...
-
Non-Local Magic Resources for Fermionic Gaussian States
Closed-form formula computes non-local magic for fermionic Gaussian states from two-point correlations in polynomial time.
-
Randomized Subsystem Descent for Fermion-to-Qubit Mapping
Randomized Subsystem Descent reduces weighted Pauli weight in fermion-to-qubit mappings for Hubbard models up to 16x16 sites and molecular Hamiltonians with 54 modes.
-
Quantum many-body operator cascade as a route to chaos
Local operators in quantum chaotic systems cascade toward non-local fractal structures whose dimension is tied by unitarity to the decay rate of local correlations, demonstrated exactly in dual-unitary circuits and nu...
-
Accelerating Quantum Tensor Network Simulations with Unified Path Variations and Non-Degenerate Batched Sampling
New techniques for error-independent unified path variation, non-degenerate batched sampling, and flexible contraction accelerate tensor network quantum trajectory simulations by more than 10^8 times.
-
QCommute: a tool for symbolic computation of nested commutators in quantum many-body spin-1/2 systems
QCommute is a new C++ tool for algebraic symbolic computation of nested commutators in quantum spin-1/2 many-body systems on hypercubic lattices in the thermodynamic limit.
-
Variational decision diagrams for quantum-inspired machine learning applications
The paper proposes variational decision diagrams (VDDs) for quantum state representation in QML and reports successful training without barren plateaus on transverse-field Ising and Heisenberg Hamiltonians.
-
Spectral methods: crucial for machine learning, natural for quantum computers?
Quantum computers may enable more natural manipulation of Fourier spectra in ML models via the Quantum Fourier Transform, potentially leading to resource-efficient spectral methods.
-
PauliEngine: High-Performant Symbolic Arithmetic for Quantum Operations
PauliEngine delivers a high-performance C++ backend for Pauli string multiplication, commutators, and symbolic tracking that outperforms existing tools in benchmarks.
-
Evaluating the Limits of QAOA Parameter Transfer at High-Rounds on Sparse Ising Models With Geometrically Local Cubic Terms
Systematic numerical study of QAOA parameter transfer on heavy-hex Ising models with local cubic terms shows transferred angles from small instances yield improving expectation values up to 49 layers on instances up t...
-
How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits
A comprehensive review of scaling paths for superconducting quantum computers, with resource and sensitivity analyses for utility-scale applications under realistic error distributions.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.