Pages that link to "Item:Q1883583"
From MaRDI portal
The following pages link to Quantum approximation. II: Sobolev embeddings (Q1883583):
Displaying 17 items.
- Randomized and quantum complexity of nonlinear two-point BVPs (Q278637) (← links)
- Randomized and quantum algorithms yield a speed-up for initial-value problems (Q706788) (← links)
- Quantum approximation on anisotropic Sobolev and Hölder-Nikolskii classes (Q763719) (← 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)
- The quantum query complexity of elliptic PDE (Q855898) (← links)
- On the representation of smooth functions on the sphere using finitely many bits (Q1780689) (← links)
- On the complexity of computing the \(L_q\) norm (Q1791678) (← links)
- Quantum approximation. I: Embeddings of finite-dimensional \(L_{p}\) spaces (Q1883582) (← links)
- Quantum complexity of Sobolev imbeddings (Q1954312) (← links)
- Quantum lower bounds by entropy numbers (Q2465304) (← 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)
- Lower bound for quantum phase estimation (Q3102418) (← links)
- A general framework for quantum splines (Q4585784) (← links)
- Randomized complexity of parametric integration and the role of adaption. II: Sobolev spaces (Q6193948) (← links)
