On the uselessness of quantum queries

DOI10.1016/j.tcs.2011.06.037zbMath1267.68116OpenAlexW1870507853MaRDI QIDQ433109

David A. Meyer, James E. Pommersheim

Publication date: 13 July 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.06.037

zbMATH Keywords

computational complexityquantum algorithmsoracle query complexity

Mathematics Subject Classification ID

Computational learning theory (68Q32) Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68) Quantum measurement theory, state operations, state preparations (81P15) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (5)

Multi-query Quantum Sums ⋮ Quantum algorithm for multivariate polynomial interpolation ⋮ Statistical properties of thermal state under quantum Hadamard transform ⋮ Oracles and query lower bounds in generalised probabilistic theories ⋮ Computation in a general physical setting

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The geometry of quantum learning
• Queries and concept learning
• How to share a secret
• Unbounded-Error Quantum Query Complexity
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Quantum algorithms and the Fourier transform
• Quantum algorithms revisited
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• On the Power of Quantum Computation
• Quantum lower bounds by polynomials

This page was built for publication: On the uselessness of quantum queries