Algorithms · Quantum linear algebra
HHL linear-systems reference
A linear-algebra reference that forces the catalog to show input loading, conditioning, and output observability.
Strong empiricalUpdated
Open on the mapView frozen graph
3 steps across 3 wires. Hover a step, or press play to go through them in order.
Expected outcomes
- Observable of x70%
- Steps3
- Wires3
- InputSparse A, |b⟩
- Output|x⟩ state
- RiskReadout cost
- Papers1
A part this method uses, worked through
This page says quantum phase estimation
— here is a concrete, runnable instance of it.
Phase estimation of P(3*pi/4)
3 counting qubits estimating the phase of P(3π/4), which is 2π·3/8 exactly: a phase 3-bit QPE can represent exactly.
Where it ends up
- 1011100%
The counting register reads 011 = 3 with probability 1: angle/(2π) = 3/8, recovered exactly.
One of its steps changes only phase: the outcome probabilities stay put while the state does not.
Open this part in StudioHHL 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.
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 →
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.
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 →
- Input
- Sparse A, |b⟩
- Output
- |x⟩ state
- Risk
- Readout cost
- Assumption
- Sparse / well-conditioned
- Access
- Block encoding or oracle
- Observable
- Problem-specific
QPE(A)on |b⟩, phase registerλ⁻¹on phase register, solution ancillaUncomputeon |b⟩, phase register
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.
Nobody has reviewed this record for gaps yet.
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.
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.
Related entries
- Quantum phase estimation
Algorithms
- Quantum amplitude estimation
Algorithms
- Variational quantum eigensolver for ground-state energy
Algorithms
References
- Quantum algorithm for solving linear systems of equations
Aram W. Harrow, Avinatan Hassidim, Seth Lloyd · 2008
Original HHL linear-systems algorithm and its sparse-access/output-observable assumptions.