Harrow (Quantum) (Sparse Linear System Linear System)

From Algorithm Wiki
Revision as of 11:36, 15 February 2023 by Admin (talk | contribs) (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")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Harrow_(Quantum)_(Sparse_Linear_System_Linear_System)&oldid=44558"