Fourier Checking problem

E2112328 UNEXPLORED

The Fourier Checking problem is a quantum computational problem designed to separate the power of quantum algorithms from classical ones by testing whether two Boolean functions have correlated Fourier spectra.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
Fourier Checking problem canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

BQP vs. the Polynomial Hierarchy → topic → Fourier Checking problem ⓘ