On the power of quantum Fourier sampling

DOI10.4230/LIPICS.TQC.2016.1MaRDI QIDQ5278342zbMATH OpenFDO

Authors Bill Fefferman, Christopher Umans

Publication date 19 July 2017

Full work available at URL https://arxiv.org/abs/1507.05592

zbMATH Keywords

quantum complexity theorysampling complexity

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68)

Recommendations

• The computational complexity of linear optics
• Complexity-theoretic foundations of quantum supremacy experiments
• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy.
• The computational complexity of linear optics
• BQP and the polynomial hierarchy

Cited in

(2)

• The equivalence of sampling and searching
• scientific article; zbMATH DE number 7250161 (Why is no real title available?)

This page was built for publication: On the power of quantum Fourier sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5278342)