Parity vs. AC^0 with simple quantum preprocessing
From MaRDI portal
Publication:6906334
Cites work
- Analysis of Boolean Functions
- Approximate Degree in Classical and Quantum Computing
- Average-case quantum advantage with shallow circuits
- Bounded indistinguishability and the complexity of recovering secrets
- Classical verification of quantum computations
- Complexity measures and decision tree complexity: a survey.
- Constant depth circuits, Fourier transform, and learnability
- Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits
- scientific article; zbMATH DE number 1962817 (Why is no real title available?)
- Interactive shallow Clifford circuits: Quantum advantage against NC¹ and beyond
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- NLTS Hamiltonians from good quantum codes
- Quantum advantage with shallow circuits
- Quantum algorithms and approximating polynomials for composed functions with shared inputs
- Quantum lower bounds by polynomials
- The acrobatics of BQP
- The approximate degree of DNF and CNF formulas
- Tight bounds on the Fourier spectrum of \(\mathsf{AC}^0\)
- Verification of quantum computation: an overview of existing approaches
This page was built for publication: Parity vs. \(\text{AC}^0\) with simple quantum preprocessing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906334)
