1 citations · 1 across the 2 of their papers we have counts for
3 papers
quant-ph2005
Almost Optimal Solution of Initial-Value Problems by Randomized and Quantum Algorithms
Boleslaw Kacewicz
We establish essentially optimal bounds on the complexity of initial-value problems in the randomized and quantum settings. For this purpose we define a sequence of new algorithms…
quant-ph2004★ 1 cited
Improved Bounds on the Randomized and Quantum Complexity of Initial-Value Problems
Boleslaw Kacewicz
We deal with the problem, initiated in [8], of finding randomized and quantum complexity of initial-value problems. We showed in [8] that a speed-up in both settings over the worst…
quant-ph2003
Randomized and Quantum Algorithms Yield a Speed-Up for Initial-Value Problems
Boleslaw Kacewicz
Quantum algorithms and complexity have recently been studied not only for discrete, but also for some numerical problems. Most attention has been paid so far to the integration pro…