Original HHL linear-systems algorithm and its sparse-access/output-observable assumptions.
arxiv.org/abs/0811.3171 ↗HHL linear-systems reference
A linear-algebra reference that forces the catalog to show input loading, conditioning, and output observability.
Atlas stars stay in the public catalog. Saving this entry to your workspace starts an unstarred private copy.
HHL is often cited for quantum linear systems, but it is best used as a requirements checklist: sparse access, a well-conditioned system, a state-preparation model, and an observable—not a free classical vector output.
Circuit & simulation
What this takes and returns
TakesNothingWhat joins here
No input port at this edge: the record publishes no gate sequence and no register, so there is nothing here to read one off — and unlike a declared hole, nothing has been recorded about what belongs here.
Nothing in the Atlas meets this end.
ReturnsNothingWhat joins here
No output port at this edge: the record publishes no gate sequence and no register, so there is nothing here to read one off — and unlike a declared hole, nothing has been recorded about what belongs here.
Nothing in the Atlas meets this end.
This record publishes no gate sequence and no register, so there is nothing here to read an interface off. Absent rather than empty. See all 152 →
Where this sits
This record is named by the layer graph at:
- HHL: eigenvalue inversion by phase estimation Method
Takes An access model for — sparse row/column entry oracles, or a block-encoding; a unitary preparing ; a known upper bound on the condition number; the normalisation ; and a target state error . Returns A flagged state -close in to . It does not return , any entry of , or any classical functional of — those cost extra and are decided a layer above.
How it works
HHL estimates an observable of the solution to a linear system for Hermitian, -sparse (or made Hermitian via a standard block embedding). The circuit encodes 's eigenvalues into a phase register via quantum phase estimation on , applies a controlled rotation proportional to on an ancilla, and uncomputes the phase register, leaving entangled with an ancilla flag. Under the coherent access model, circuit cost scales roughly as where is 's condition number and the target precision — versus roughly for classical conjugate gradient, so the advantage narrows as grows. Crucially, is a quantum state: reading out every component costs measurements and erases any speedup, so — matching this record's caveat — HHL is only useful when a single scalar observable of , not the full vector, is the actual goal.
Implementation
from qiskit import QuantumCircuit
qc = QuantumCircuit(3)
# Prepare |b⟩ and encode a small Hermitian A.
qc.h(0)
# QPE(A), controlled reciprocal rotation, and uncompute
qc.barrier()
FINAL_CIRCUIT = qcThis is a requirements-oriented skeleton; it does not claim a full HHL implementation or application speedup.
Quantum vs classical
| Metric | Classical | Quantum |
|---|---|---|
| Dependence on N | poly(N) | O(log N) |
| Condition-number cost | O(s κ) | O(s κ² log(1/ε)) |
| Output | full solution x | |x⟩ (observable only) |
| Impact | baseline | exp. in N (with caveats) |
Classical baseline
Conjugate gradient, sparse direct solvers, preconditioned iterative methods, or classical PDE solvers.
Quantum claim
Potentially favorable scaling for estimating selected observables of a sparse, well-conditioned system under a quantum input/output model.
How to compare
Account for condition number, sparsity, state preparation, block encoding, precision, and the cost of extracting the desired observable.
Declared gaps
Nobody has reviewed this record for gaps yet.