The quantum query complexity of approximating the median and related statistics
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Quantum complexity of integration
Journal of Complexity
Quantum summation with an application to integration
Journal of Complexity
On a problem in quantum summation
Journal of Complexity
Path Integration on a Quantum Computer
Quantum Information Processing
Quantum Lower Bounds by Polynomials
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Optimal Lower Bounds for Quantum Automata and Random Access Codes
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Quantum approximation I. Embeddings of finite-dimensional Lp spaces
Journal of Complexity
Quantum approximation II. Sobolev embeddings
Journal of Complexity
Quantum complexity of parametric integration
Journal of Complexity
Classical and Quantum Complexity of the Sturm--Liouville Eigenvalue Problem
Quantum Information Processing
A lower bound for the Sturm-Liouville eigenvalue problem on a quantum computer
Journal of Complexity - Special issue: Information-based complexity workshops FoCM conference Santander, Spain, July 2005
Almost optimal solution of initial-value problems by randomized and quantum algorithms
Journal of Complexity - Special issue: Information-based complexity workshops FoCM conference Santander, Spain, July 2005
Hi-index | 0.00 |
We use entropy numbers in combination with the polynomial method to derive a new general lower bound for the nth minimal error in the quantum setting of information-based complexity. As an application, we improve some lower bounds on quantum approximation of embeddings between finite dimensional L"p spaces and of Sobolev embeddings.