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.
Simulating quantum circuits with arbitrary local noise using Pauli Propagation
8 Pith papers cite this work. Polarity classification is still indexing.
8
Pith papers citing it
abstract
We present a polynomial-time classical algorithm for estimating expectation values of arbitrary observables on typical quantum circuits under any incoherent local noise, including non-unital or dephasing. Although previous research demonstrated that some carefully designed quantum circuits affected by non-unital noise cannot be efficiently simulated, we show that this does not apply to average-case circuits, as these can be efficiently simulated using Pauli-path methods. Specifically, we prove that, with high probability over the circuit gates choice, Pauli propagation algorithms with tailored truncation strategies achieve an inversely polynomially small simulation error. This result holds for arbitrary circuit topologies and for any local noise, under the assumption that the distribution of each circuit layer is invariant under single-qubit random gates. Under the same minimal assumptions, we also prove that most noisy circuits can be truncated to an effective logarithmic depth for the task of {estimating} expectation values of observables, thus generalizing prior results to a significantly broader class of circuit ensembles. We further numerically validate our algorithm with simulations on a $6\times6$ lattice of qubits under the effects of amplitude damping and dephasing noise, as well as real-time dynamics on an $11\times11$ lattice of qubits affected by amplitude damping.
citation-role summary
background 3
baseline 1
citation-polarity summary
representative citing papers
Above a critical noise strength, operator scrambling in random circuits is suppressed leading to classical simulability; below it, simulation stays exponentially hard.
A classical polynomial-time sampler exists for the output distribution of amplitude-damped IQP circuits with logarithmic depth and arbitrary l-local diagonal gates.
Bra-ket entanglement indicates a shift from coherence-dominated to magic-dominated entanglement generation as its value increases.
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 time for long evolutions.
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.
Gaussian randomized rounding on two-qubit marginals of depth-D circuits with local depolarizing noise p yields samples whose expected Max-Cut cost matches the noisy quantum device up to an approximation ratio of 1-O[(1-p)^D].
The paper identifies four key hurdles in the transition from NISQ to FASQ quantum computers and argues that targeting them will accelerate progress toward useful quantum advantage.
citing papers explorer
-
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.
-
Efficient simulation of noisy IQP circuits with amplitude-damping noise
A classical polynomial-time sampler exists for the output distribution of amplitude-damped IQP circuits with logarithmic depth and arbitrary l-local diagonal gates.
-
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.
-
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 time for long evolutions.
-
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.
-
Sampling (noisy) quantum circuits through randomized rounding
Gaussian randomized rounding on two-qubit marginals of depth-D circuits with local depolarizing noise p yields samples whose expected Max-Cut cost matches the noisy quantum device up to an approximation ratio of 1-O[(1-p)^D].
-
Mind the gaps: The fraught road to quantum advantage
The paper identifies four key hurdles in the transition from NISQ to FASQ quantum computers and argues that targeting them will accelerate progress toward useful quantum advantage.