Pauli path simulations of noisy quantum circuits beyond average case
Guillermo Gonz\'alez-Garc\'ia, J. Ignacio Cirac, Rahul Trivedi

TL;DR
This paper extends the analysis of Pauli path simulation methods for noisy quantum circuits beyond average case, showing conditions under which classical simulation becomes efficient, especially for certain QAOA instances and noise regimes.
Contribution
It provides new sufficient conditions for classical simulability of noisy quantum circuits with Clifford and T gates, beyond average case, and applies these to QAOA and noise fragility analysis.
Findings
Classical simulation becomes efficient when noise exceeds T gate fraction.
QAOA on non-local graphs loses quantum advantage under depolarizing noise.
Pauli path method can fail to produce correct results in some noisy scenarios.
Abstract
For random quantum circuits on qubits of depth with depolarizing noise, the task of sampling from the output state can be efficiently performed classically using a Pauli path method [Aharonov et al. Proceedings of the 55th Annual ACM Symposium on Theory of Computing. 2023] . This paper aims to study the performance of this method beyond random circuits. We first consider the classical simulation of local observables in circuits composed of Clifford and T gates going beyond the average case analysis, we derive sufficient conditions for simulatability in terms of the noise rate and the fraction of gates that are T gates, and show that if noise is introduced at a faster rate than T gates, the simulation becomes classically easy. As an application of this result, we study 2D QAOA circuits that attempt to find low-energy states of classical Ising models…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
