Pages that link to "Item:Q706788"
From MaRDI portal
The following pages link to Randomized and quantum algorithms yield a speed-up for initial-value problems (Q706788):
Displaying 12 items.
- Randomized and quantum complexity of nonlinear two-point BVPs (Q278637) (← links)
- Almost optimal solution of initial-value problems by randomized and quantum algorithms (Q855897) (← links)
- Solving Burgers' equation with quantum computing (Q2102229) (← links)
- Turbulence theories and statistical closure approaches (Q2233981) (← links)
- Complexity of parametric initial value problems in Banach spaces (Q2251912) (← links)
- The randomized complexity of initial value problems (Q2483198) (← links)
- On the complexity of searching for a maximum of a function on a quantum computer (Q2491387) (← links)
- Complexity of initial-value problems for ordinary differential equations of order \(k\) (Q2507590) (← links)
- Classical and quantum complexity of the Sturm-Liouville eigenvalue problem (Q2573108) (← links)
- Improved bounds on the randomized and quantum complexity of initial-value problems (Q2576279) (← links)
- On the Complexity of Parametric ODEs and Related Problems (Q4611817) (← links)
- A note on the probabilistic stability of randomized Taylor schemes (Q6105404) (← links)
