REVIEW 5 cited by
A Fourier analysis framework for approximate classical simulations of quantum circuits
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
What makes a class of quantum circuits efficiently classically simulable on average? I present a framework that applies harmonic analysis of groups to circuits with a structure encoded by group parameters. Expanding the circuits in a suitable truncated multi-path operator basis gives algorithms to evaluate the Fourier coefficients of output distributions or expectation values that are viewed as functions on the group. Under certain conditions, a truncated Fourier series can be efficiently estimated with guaranteed mean-square convergence. For classes of noisy circuits, it leads to algorithms for sampling and mean value estimation under error models with a spectral gap, where the complexity increases exponentially with the gap's inverse and polynomially with the circuit's size. This approach unifies and extends existing algorithms for noisy parametrised or random circuits using Pauli basis paths. For classes of noiseless circuits, mean values satisfying Lipschitz continuity can be on average approximated using efficient sparse Fourier decompositions. I also discuss generalisations to homogeneous spaces, qudit systems and a way to analyse random circuits via matrix coefficients of irreducible representations.
Forward citations
Cited by 5 Pith papers
-
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.
-
Hardness and Complexity Transition of Noisy Random Circuit Sampling
Under the standard ideal-RCS #P-hardness conjecture, noisy random circuit sampling remains hard for depolarizing noise γ = O(log n/(nd)), and matching simulability results make γ = Θ(log n/(nd)) the transition scale.
-
Backpropagating Pauli Propagation
A backward-propagation algorithm computes gradients for sparse Pauli dynamics in O(1) passes and O(N_P) memory, with gradient accuracy empirically comparable to the simulation's own energy accuracy.
-
Another generalization of Hadamard test: Optimal sample complexities for learning functions on the unitary group
The query complexity of estimating a function of an unknown unitary under average bias is Θ(Rep_ε(f)), where Rep_ε(f) measures the L2 tail of the function beyond degree 2m polynomials.
-
Artificial intelligence for representing and characterizing quantum systems
A review organizes AI-based quantum system characterization into ML, deep learning, and language model paradigms, covering property prediction and implicit state reconstruction.
Discussion (0). Sign in to comment.