Parity $\notin$ QAC0 $\iff$ QAC0 is Fourier-Concentrated
Lucas Gretta, Meghal Gupta, Malvika Raj Joshi

TL;DR
This paper explores the Fourier spectrum of shallow quantum circuits (QAC$^0$), revealing their potential to compute Parity and relate to quantum state preparation, and establishes a quantum separation from classical circuits.
Contribution
It demonstrates that Fourier concentration characterizes QAC$^0$ power, provides a quantum average-case separation from AC$^0$, and introduces a new metric, felinity, for quantum state complexity.
Findings
QAC$^0$ with significant high-level Fourier mass can compute Parity.
QAC$^0$ can correlate with MAJORITY, unlike AC$^0$.
Preparing states with non-negligible felinity implies Parity in QAC$^0$.
Abstract
A major open problem in understanding shallow quantum circuits (QAC) is whether they can compute Parity. We show that this question is solely about the Fourier spectrum of QAC: any QAC circuit with non-negligible high-level Fourier mass suffices to exactly compute PARITY in QAC. Thus, proving a quantum analog of the seminal LMN theorem for AC is necessary to bound the quantum circuit complexity of PARITY. In the other direction, LMN does not fully capture the limitations of AC. For example, despite MAJORITY having of its weight on low-degree Fourier coefficients, no AC circuit can non-trivially correlate with it. In contrast, we provide a QAC circuit that achieves correlation with MAJORITY, establishing the first average-case decision separation between AC and QAC. This suggests a uniquely quantum phenomenon: unlike in the…
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.
