Harrow (Quantum) (Sparse Linear System Linear System): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(k^{2}*logn)$ == Space Complexity == $O(log n)$ qubits (https://arxiv.org/pdf/0811.3171.pdf) == Description == Quantum algorithm == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Quantum == Year == 2009 == Reference == https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.103.150502") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(k^{2}* | $O(k^{2}*\log n)$ | ||
== Space Complexity == | == Space Complexity == | ||
$O(log n)$ qubits | $O(\log n)$ qubits | ||
(https://arxiv.org/pdf/0811.3171.pdf) | (https://arxiv.org/pdf/0811.3171.pdf) | ||
Latest revision as of 09:33, 10 April 2023
Time Complexity
$O(k^{2}*\log n)$
Space Complexity
$O(\log n)$ qubits
(https://arxiv.org/pdf/0811.3171.pdf)
Description
Quantum algorithm
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Quantum
Year
2009
Reference
https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.103.150502