The power of various real-valued quantum queries

DOI10.1016/j.jco.2003.07.001zbMath1090.68039arXivquant-ph/0308140OpenAlexW2162315485MaRDI QIDQ1888377

Arvid J. Bessen

Publication date: 23 November 2004

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0308140

zbMATH Keywords

quantum computers

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Related Items

A lower bound for the Sturm-Liouville eigenvalue problem on a quantum computer ⋮ Quantum fuzzy inference for knowledge base design in robust intelligent controllers ⋮ Lower bound for quantum phase estimation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some new characterizations of the Chebyshev polynomials
• Quantum summation with an application to integration.
• The quantum query complexity of approximating the median and related statistics
• Quantum lower bounds by polynomials
• Quantum complexity of integration