A note on quantum algorithms and the minimal degree of -error polynomials for symmetric functions

zbMATH Open1161.81011arXiv0802.1816MaRDI QIDQ3604066FDOQ3604066

Authors: Ronald de Wolf 

Publication date: 24 February 2009

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

Recommendations

• The polynomial method strikes back: tight quantum query bounds via dual polynomials
• The polynomial method strikes back: tight quantum query bounds via dual polynomials
• Polynomials, quantum query complexity, and Grothendieck's inequality
• SOFSEM 2005: Theory and Practice of Computer Science
• Algorithmic Polynomials

zbMATH Keywords

probability theoryquantum algorithmssymmetric functionsapproximating polynomialsquantum proof

Mathematics Subject Classification ID

Quantum computation (81P68)

Cited In (7)

• Algorithmic Polynomials
• Title not available (Why is that?)
• The power of asymmetry in constant-depth circuits
• Sum-of-squares bounds via Boolean function analysis
• On the sum-of-squares degree of symmetric quadratic functions
• On zeros of exponential polynomials and quantum algorithms
• On query complexity measures and their relations for symmetric functions

This page was built for publication: A note on quantum algorithms and the minimal degree of \(\varepsilon\)-error polynomials for symmetric functions

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