Pages that link to "Item:Q1599193"
From MaRDI portal
The following pages link to Quantum summation with an application to integration. (Q1599193):
Displayed 22 items.
- Randomized and quantum algorithms yield a speed-up for initial-value problems (Q706788) (← links)
- The quantum setting with randomized queries for continuous problems (Q850543) (← links)
- A lower bound for the Sturm-Liouville eigenvalue problem on a quantum computer (Q855896) (← links)
- Almost optimal solution of initial-value problems by randomized and quantum algorithms (Q855897) (← links)
- The quantum query complexity of elliptic PDE (Q855898) (← links)
- What can quantum computers do? (Q873912) (← links)
- Lower bound for quantum integration error on anisotropic Sobolev classes (Q966549) (← links)
- On a problem in quantum summation. (Q1394934) (← links)
- Quantum integration in Sobolev classes (Q1394935) (← links)
- From Monte Carlo to quantum computation (Q1873014) (← links)
- Quantum approximation. I: Embeddings of finite-dimensional \(L_{p}\) spaces (Q1883582) (← links)
- Quantum approximation. II: Sobolev embeddings (Q1883583) (← links)
- Quantum complexity of parametric integration (Q1883586) (← links)
- Sharp error bounds on quantum Boolean summation in various settings (Q1888376) (← links)
- The power of various real-valued quantum queries (Q1888377) (← links)
- Average case quantum lower bounds for computing the Boolean mean (Q1888378) (← links)
- Quantum lower bounds by entropy numbers (Q2465304) (← links)
- On the complexity of the multivariate Sturm-Liouville eigenvalue problem (Q2465305) (← links)
- Optimal integration error on anisotropic classes for restricted Monte Carlo and quantum algorithms (Q2472367) (← links)
- On the complexity of searching for a maximum of a function on a quantum computer (Q2491387) (← links)
- Optimal query error of quantum approximation on some Sobolev classes (Q2519327) (← links)
- Improved bounds on the randomized and quantum complexity of initial-value problems (Q2576279) (← links)