Classically estimating observables of noiseless quantum circuits
<|reference_start|>Classically estimating observables of noiseless quantum circuits: We present a classical algorithm for estimating expectation values of arbitrary observables on most quantum circuits across all circuit architectures and depths, including those with all-to-all connectivity. We prove that for any architecture where each circuit layer is equipped with a measure invariant under single-qubit rotations, our algorithm achieves a small error $\varepsilon$ on all circuits except for a small fraction $\delta$. The computational time is polynomial in qubit count and circuit depth for any small constant $\varepsilon, \delta$, and quasi-polynomial for inverse-polynomially small $\varepsilon, \delta$. For non-classically-simulable input states or observables, the expectation values can be estimated by augmenting our algorithm with classical shadows of the relevant state or observable. Our approach leverages a Pauli-path method under Heisenberg evolution. While prior works are limited to noisy quantum circuits, we establish classical simulability in noiseless regimes. Given that most quantum circuits in an architecture exhibit chaotic and locally scrambling behavior, our work demonstrates that estimating observables of such quantum dynamics is classically tractable across all geometries.<|reference_end|>
@article{angrisani2024classically,
    title={Classically estimating observables of noiseless quantum circuits},
    author={Armando Angrisani, Alexander Schmidhuber, Manuel S. Rudolph, M.
  Cerezo, Zo"e Holmes, Hsin-Yuan Huang},
    journal={arXiv preprint arXiv:2409.01706},
    year={2024},
    number={LA-UR-24-29028},
    archivePrefix={arXiv},
    eprint={2409.01706},
    primaryClass={quant-ph cs.CC math-ph math.MP}
}