Randomized and quantum algorithms yield a speed-up for initial-value problems (Q706788): Difference between revisions

@@ Property / arXiv ID @@
+quant-ph/0311148
@@ Property / arXiv ID: quant-ph/0311148 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4819589
@@ Property / cites work: Q4819589 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4228473
@@ Property / cites work: Q4228473 / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum summation with an application to integration.
+Normal rank
@@ Property / cites work @@
+Quantum approximation. I: Embeddings of finite-dimensional \(L_{p}\) spaces
+Normal rank
@@ Property / cites work @@
+Quantum approximation. II: Sobolev embeddings
@@ Property / cites work: Quantum approximation. II: Sobolev embeddings / rank @@
+Normal rank
@@ Property / cites work @@
+Q4549490
@@ Property / cites work: Q4549490 / rank @@
+Normal rank
@@ Property / cites work @@
+How to increase the order to get minimal-error algorithms for systems of ODE
+Normal rank
@@ Property / cites work @@
+Minimum asymptotic error of algorithms for solving ODE
+Normal rank
@@ Property / cites work @@
+On sequential and parallel solution of initial value problems
+Normal rank
@@ Property / cites work @@
+The quantum query complexity of approximating the median and related statistics
+Normal rank
@@ Property / cites work @@
+Deterministic and stochastic error bounds in numerical analysis
+Normal rank
@@ Property / cites work @@
+Quantum complexity of integration
@@ Property / cites work: Quantum complexity of integration / rank @@
+Normal rank