The quantum setting with randomized queries for continuous problems
From MaRDI portal
Publication:850543
DOI10.1007/s11128-006-0013-6zbMath1103.68056arXivquant-ph/0601196OpenAlexW2145198520MaRDI QIDQ850543
Publication date: 3 November 2006
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0601196
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)
Related Items (3)
Optimal pointwise approximation of SDE's from inexact information ⋮ Strong approximation of solutions of stochastic differential equations with time-irregular coefficients via randomized Euler algorithm ⋮ On the complexity of the multivariate Sturm-Liouville eigenvalue problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal linear randomized methods for linear operators in Hilbert spaces
- Deterministic and stochastic error bounds in numerical analysis
- There exists a linear problem with infinite combinatory complexity
- Quantum integration in Sobolev classes
- Delayed curse of dimension for Gaussian integration
- Quantum summation with an application to integration.
- Quantum approximation. I: Embeddings of finite-dimensional \(L_{p}\) spaces
- Quantum approximation. II: Sobolev embeddings
- Sharp error bounds on quantum Boolean summation in various settings
- Average case quantum lower bounds for computing the Boolean mean
- Classical and quantum complexity of the Sturm-Liouville eigenvalue problem
- Improved bounds on the randomized and quantum complexity of initial-value problems
- The quantum query complexity of approximating the median and related statistics
- Lower bound for quantum phase estimation
- Noisy Information and Computational Complexity
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Complexity Theory
- On the Power of Quantum Algorithms for Vector Valued Mean Computation
- On tractability of path integration
- Quantum complexity of integration
This page was built for publication: The quantum setting with randomized queries for continuous problems
