Query complexity of quantum biased oracles

MaRDI QIDQ3437581zbMATH OpenFDO

Authors Rudy Raymond, S. Yamasita, Kazuo Iwama

Publication date 9 May 2007

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum computation (81P68) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Robust Quantum Algorithms with ε-Biased Oracles
• Quantum lower bounds for the Goldreich-Levin problem
• Improved Algorithms for Quantum Identification of Boolean Oracles
• Improved algorithms for quantum identification of Boolean oracles
• STACS 2004

Cited in

(2)

• The quantum query complexity of approximating the median and related statistics
• Robust Quantum Algorithms with ε-Biased Oracles

This page was built for publication: Query complexity of quantum biased oracles

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