The polynomial degree of recursive Fourier sampling

DOI10.1007/978-3-642-18073-6_9MaRDI QIDQ3070980zbMATH OpenOpenAlexFDO

Authors Benjamin Johnson

Publication date 28 January 2011

Published in Theory of Quantum Computation, Communication, and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-18073-6_9

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94)

Recommendations

• Quantum lower bound for recursive Fourier sampling
• Polynomial degree vs. quantum query complexity
• Quantum lower bounds by polynomials
• The polynomial method strikes back: tight quantum query bounds via dual polynomials
• Algorithmic Polynomials

Cited in

(2)

• Quantum lower bound for recursive Fourier sampling
• A Computable Fourier Condition Generating Alias-Free Sampling Lattices

This page was built for publication: The polynomial degree of recursive Fourier sampling

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