Robust polynomials and quantum algorithms

DOI10.1007/978-3-540-31856-9_49MaRDI QIDQ5710710zbMATH OpenOpenAlexFDO

Authors Harry Buhrman, Ilan Newman, Hein Rohrig, Ronald de Wolf

Publication date 2 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b106485, https://ir.cwi.nl/pub/11748

Mathematics Subject Classification ID

Boolean functions (06E30) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68)

Recommendations

• Robust polynomials and quantum algorithms
• Making polynomials robust to noise
• Making polynomials robust to noise
• Boolean functions with a low polynomial degree and quantum query algorithms
• Quantum lower bounds by polynomials

Cited in

(10)

• Robust polynomials and quantum algorithms
• Making polynomials robust to noise
• scientific article; zbMATH DE number 5320307 (Why is no real title available?)
• scientific article; zbMATH DE number 5320378 (Why is no real title available?)
• Robust Quantum Algorithms with ε-Biased Oracles
• scientific article; zbMATH DE number 6820205 (Why is no real title available?)
• On the robustness of bucket brigade quantum RAM
• Making polynomials robust to noise
• Improved algorithms for quantum identification of Boolean oracles
• On zeros of exponential polynomials and quantum algorithms

This page was built for publication: Robust polynomials and quantum algorithms

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