About this map
Sections
What this is
Quantum algorithms are not written from scratch. They are assembled from a small number of reusable steps, and almost every published method is a different route through the same handful of them.
This is a map of those routes. Circles are the things an algorithm can be holding. Lines are the steps that carry you from one to the next. A method is a path across.
Nothing here is generated. Every line was read out of a paper and checked against it.
How to read it
- Something you can hold — a state, a matrix, a circuit, an answer.
- The same, in the middle of a step you have opened.
- A step. Someone has published a way through it.
- A step whose way through has not been pinned to one method.
- A step nothing published fills yet.
- A step you have opened. What is drawn inside it is how it was done.
- There is a record in the repository for this one.
How to move around
- Two fingers move the map. Pinch to zoom, or hold ctrl and scroll.
- Click a step to open it in place — everything else stays where it is.
- Click a name to read the full record without leaving the map.
- Arrow keys move, plus and minus zoom, zero puts it back.
What a line is claiming
A solid line means a paper puts those two steps together and we have the citation. A long-dashed line means the route is recorded but no single method has been named for that step. A short-dashed line means nothing published fills it — the step is real, the way through is not written yet.
A count after a step's name — ×T/h, ×O(κ) — means the route walks that step that many times rather than once. It is the source's own symbol, and the card says what it stands for and what one turn costs. A step with no count is a step no source we read said is repeated, which is not the same as one taken once.
A line drawn nested under another, on the soft shaded band behind it, is a narrower version of the line above it: the same construction, re-analysed or re-tuned, filling the same step. It is why two lines can draw the identical interior and still be two entries. Lines outside the band are alternatives to their neighbours, not versions of them.
The map does not hide the gaps. An empty step is drawn as an empty step.
What is not here yet
The map covers the algorithm literature. The repository covers circuits and primitives. They overlap less than you would expect, and where a method has no record we say so on its page rather than leaving the space blank.
Where something named here does have a record, its name links straight to it.
Method
Quantum subspace expansion
Stop optimising and start measuring: take the state the ground-state run already produced, measure matrix elements in a small space of operators applied to it, and let a classical solver diagonalise the little matrix that results. The extra accuracy is bought with classical work and more measurements, not with more coherence.
Open the full recordFills the slot: Estimate an excited-state energy
McClean et al. state the shape of the guarantee rather than a bound: variational approaches "fit in a more general hierarchy of measurement and classical computation that allows one to obtain increasingly accurate solutions with additional classical resources", and they "demonstrate numerically on a sample electronic system that this method both allows for the accurate determination of excited electronic states as well as reduces the impact of decoherence, without using any additional quantum coherence time or formal error correction codes". The decoherence claim is separate and is argued from an "exactly solvable channel model of variational state preparation". What the abstract does NOT give is the mechanism at the level a reader would need to implement it — which operators span the expansion, and which matrix elements have to be measured — and neither is invented here; both sit in the body of the paper, and the honest summary of the abstract is the trade it names, not a construction it does not state.
A Hermitian H reachable as a sum of terms that can be measured separately; a statement of which state is wanted — an index k, a symmetry sector, or a target energy to sit nearest; for most of the methods here, the ground state already solved, and for the deflation route every lower state as well; a target additive error and a shot budget.
Hamiltonian whose excited state is wanted → Number with an error barreuse the eigenvectors to weigh any operator
Once the reference state is prepared, QSE builds a linear subspace spanned by particle-hole excitations approximation: truncated to this first order (k=1, linear response) of a hierarchy that would reach exact diagonalization only at k=Ne, exponential cost and diagonalizes it as the generalized eigenvalue problem , whose overlap is fixed by the reference state's 1- and 2-RDM alone, while its Hamiltonian entries reach the 3- and 4-RDM, assumption: which McClean et al. take to cost only a polynomial number of additional measurements on the same reference state. Both are estimated by measurement, giving eigenvectors and energies . The same construction, , holds for any operator in place of , so the eigenvectors already obtained can weigh that operator's matrix to read off its value for the ground or an excited state without a new optimization.
approximationassumption
A scalar estimate — of that eigenvalue, or of the gap between it and the ground state — together with the run budget it consumed. Some methods return a whole low-energy subspace at once and others return one state per run, and that difference is a cost, not a convenience.
- Estimate a Hamiltonian's ground-state energy
Given a Hamiltonian you can query and some way of preparing trial states, return an estimate of its lowest eigenvalue to a stated additive error. The state achieving that energy may or may not come back with the number; almost every application wants the number.
The route enters this slot with an ordinary VQE loop. A parameterised is prepared and its parameters driven to the Rayleigh-Ritz minimum , the energy read out by repeated state preparation and partial tomography as the contraction . McClean et al. model the preparation as a channel rather than a unitary: minimising is equivalent to solving on the transformed for the lowest eigenvalue and eigenvector pair. assumption: the model prepares an arbitrary pure state, so it fixes the optimal possible performance separately from ansatz choice or experimental protocol Symmetry can be imposed by a penalty approximation: exact only as , and only if the parameterisation can satisfy the symmetry at all; the authors call it prohibitively expensive and warn it may not generalise to excited states of a different symmetry. More than the energy leaves this slot: the 1- and 2-RDM already measured are the reference the next hop expands about, which then buys the 3- and 4-RDM with a polynomial number of additional measurements.
approximationassumption
- Estimate an observable
Given the ability to prepare and a description of an observable , return a classical scalar within of at confidence . The state is never returned; only the number is.
Here the route stops optimising. It expands about , the state at the exit of the channel, in the vectors . Partial tomography supplies the elements within that expansion, with metric , and those coupling it to the reference, with ; that row and column border the matrices, so the reference sits inside the diagonalised space. A one-body operator reaches at most the 3-RDM, a two-body the 4-RDM through a term. The classical step solves for the ground and excited states; symmetry is imposed here with no limit, by building in the same subspace and projecting onto its eigenvectors of the wanted eigenvalue. approximation: truncating the hierarchy at spans only the linear-response space, justified as the dominant contribution in a linear response theory of local time-dependent perturbations approximation: the commutator form removes the 4-RDM at measured terms and is exact only when is exact; ZC further sets the 3-particle cumulant approximation: ZA instead starts from the un-reduced 4-RDM and reconstructs it from the 2-RDM alone, setting
approximation
given a normalized reference state |Psi> already produced by a prior VQE run
that minimized <H>(theta) over the ansatz parameters (Eq. 18) -- this
method does not run that optimization, it consumes its output
the reference's 1- and 2-RDM, 1D^i_k and 2D^ij_kl (Eq. 3-4), already
measured as part of that VQE run
M spin-orbitals (JW-encoded qubits), so excitation indices i,j range
over [1, M]
optionally, an operator O (a symmetry operator, or any observable
whose value is wanted in the excited states) expressed as a sum of
one- and two-body fermion operators, as H itself is (Eq. 10)
requires |Psi> is the single state the subspace is built ABOUT, not a family
of trial states -- the paper demonstrates the k=1 truncation's accuracy
from an exact ground-state reference (Fig. 4) and separately from an
approximate, channel-degraded one (Fig. 5, amplitude/phase damping); it
states no general bound on truncation error for an arbitrary reference
# --- build the k=1 excitation subspace -------------------------------------
Bf1 = { a_i^dagger a_j |Psi> : i, j in [1, M] } (Eq. 6, Eq. 8 at k=1)
# justified only as the dominant contribution in a linear-response theory
# of local time-dependent perturbations to the system -- that result is
# cited to a separate reference, not derived in this paper (ref [28])
# Bf1 is level k=1 of a hierarchy Bf^k; k=Ne would span the whole
# Ne-fermion space and make the classical step exact diagonalization,
# but its cost then scales exponentially in system size (text after Eq. 8)
# --- measure the subspace's Hamiltonian and overlap by partial tomography --
for each (i,j), (k,l) in [1,M] x [1,M]:
H^ij_kl = <Psi| (a_i^dagger a_j)^dagger H a_k^dagger a_l |Psi> (Eq. 45, O = H)
S^ij_kl = delta_ik * 1D^j_l - 2 * 2D^jk_li (Eq. 47)
# S is the overlap/metric of the (non-orthogonal) excitation vectors --
# it is NOT the identity, which is exactly why the next step is a
# GENERALIZED eigenvalue problem, not a plain diagonalization
# S alone is fixed by the 1- and 2-RDM (Eq. 47); H is NOT -- a one-body
# term of H reaches the 3-RDM, a two-body term the 4-RDM (matrix
# elements given explicitly, Eq. 48-51), and determining these costs a
# polynomial number of measurements beyond what the ground-state VQE
# run already took (text after Eq. 5)
# --- solve the subspace problem classically ---------------------------------
solve H_LR C = S_LR C E for eigenpairs (C, E) (Eq. 7 / Eq. 21)
# E's lowest eigenvalue approximates the ground state within Bf1; its
# higher eigenvalues are the excited-state estimates this method is for
# --- optional: enforce an exact symmetry in the subspace --------------------
if a symmetry operator O with target eigenvalue o is supplied:
build O^ij_kl the same way as H^ij_kl above
project onto the eigenvectors of O_LR carrying eigenvalue o
diagonalize H_LR restricted to that projected subspace (Supp. Sec. C)
# exact for any finite subspace here -- unlike the penalty
# H -> H + sum_i lambda_i (O_i - o_i)^2 used to impose a symmetry on
# the reference state itself, which the paper notes is only exact as
# lambda_i -> infinity and "may not generalize well to excited states
# if they are of a different symmetry than the ground state" (main text, Eq. 20)
# the paper gives this projection only in prose, not as an explicit
# projector formula (Supp. Sec. C)
# --- optional variants that avoid measuring the 4-RDM -----------------------
# the fermionic QSE above is exact within Bf1 but, in the paper's own words,
# "can still be prohibitively expensive in the number of measurements
# required"; both variants below are approximations aimed at that (Supp. Sec. I)
# ZC: H^ij_kl ~= <Psi|(a_i^dagger a_j)^dagger [H, a_k^dagger a_l]|Psi>
# + Eg <Psi|(a_i^dagger a_j)^dagger a_k^dagger a_l|Psi> (Eq. 59)
# exact only when |Psi> is the exact ground state (Eg its eigenvalue);
# the commutator drops the expression to at most the 3-RDM, O(M^6)
# terms; setting the irreducible 3-particle cumulant 3Delta = 0 removes
# even that, needing nothing beyond the ORIGINAL ground-state 2-RDM
# ZA: skips the commutator and reconstructs the 4-RDM from the 2-RDM alone,
# assuming 4Delta = 3Delta = 0
# the two differ in ACCURACY, not in measurement cost: the paper states
# "both methods require only the original measurements used for the ground
# state", with ZC at "extremely high accuracy" while ZA is "qualitatively
# correct in some cases but produces sub-variational solutions in others";
# the extra structure of ZC is what buys the accuracy (Fig. 7 caption)
# both accuracy comparisons are a single numerical demonstration on H2, not
# a bound (Fig. 7)
return the eigenpairs (C, E) -- E holds ground- and excited-state energy
estimates within Bf1, C the coefficients of each state in the
a_i^dagger a_j |Psi> basis
# the identical C, with O^ij_kl computed in place of H^ij_kl, reads off <O>
# for any of these states with no new optimization -- the mechanism this
# method is reused for whenever the wanted quantity is not the energyMcClean, Schwartz, Carter and de Jong buy excited states with measurements, not coherence. At the linear-response level of the hierarchy of Eq. (8), whose index pairs each range over spin-orbitals — the paper writes the index ranges, not the counts — that is vectors , labelled matrix elements , and one generalized eigenvalue problem (Eq. 7) solved classically. The 1- and 2-RDM come from the ground-state run; for the extra 3- and 4-RDM the authors claim only "a polynomial number of additional measurements", never an exponent. Their one explicit count is the commutator form of Eq. (59), which "depends at most on the 3-RDM requiring only terms to be measured", and is exact only when is exact; the ZC and ZA cumulant approximations need nothing beyond the ground-state 2-RDM. No shot count or precision bound is given. Truncated levels the authors call "efficient"; at the classical diagonalization "scales exponentially in the size of the system".
None found yet.
None found yet.
Quantum subspace expansion · Qiskit
From the repository — run, not written up from a paper · unsupported
About
Measured response operators around a VQE state define a generalized eigenproblem for excitations and mitigation.
Methods
None found yet.
Data
None found yet.
Code
Qiskit
Results
Literature-backed method record; algorithmic scope and evidence boundary reviewed, with no benchmark run claimed.
- Quantum subspace expansion
Measured response operators around a VQE state define a generalized eigenproblem for excitations and mitigation.
References
- Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
Jarrod R. McClean, Mollie E. Schwartz, Jonathan Carter, Wibe A. de Jong · 2016
Where the routes meet
11 problems nothing else needs — the places a reader arrives. Open a line to see what is recorded inside it, or click its name to go there.
13 lines have something recorded inside that you have not opened.
Of the routes that have been taken apart, 15 are built entirely from named slots, 15 hand off part of the work and finish the rest themselves, and 20 are one undivided act. None of the three is a defect; they are different things to reuse.
Every line on this figure, in words
The lines on this figure
Solve a nonlinear ODE dy/dt = F(y)
- Embed a nonlinear system into a linear one — opens into 6 · a way across — click it to open it here
- Solve a linear ODE du/dt = A(t)u + b(t) — opens into 9 · a way across — click it to open it here
- Choose a time discretization or propagator approximation → Quantum linear solve — open
- Choose a time discretization or propagator approximation — opens into 6 · a way across — click it to open it here
- Quantum linear solve — opens into 5 · a way across — click it to open it here
- Simulate Hamiltonian evolution → Estimate an observable — open
- Simulate Hamiltonian evolution — opens into 3 · a way across — click it to open it here
- Estimate an observable — opens into 4 · a way across — click it to open it here
Estimate an excited-state energy
- Variational quantum deflation — opens into 3 · a way across — click it to open it here
- Subspace-search variational eigensolver — opens into 3 · a way across — click it to open it here
- Quantum subspace expansion
- Quantum equation of motion
- Folded-spectrum variational eigensolver — opens into 3 · a way across — click it to open it here
- Penalty-constrained variational eigensolver — opens into 3 · a way across — click it to open it here
- Multistate contracted variational eigensolver — opens into 3 · a way across — click it to open it here
Every step you can open
1 of these have an object recorded in the middle; the rest open into the methods that fill them.
- Solve a nonlinear ODE dy/dt = F(y)
- Replace a spatial domain with a finite grid
- Discretize a PDE into one linear system
- Embed a nonlinear system into a linear one
- Solve a linear ODE du/dt = A(t)u + b(t)
- Recast a non-Hermitian generator as Hamiltonian evolution
- Choose a time discretization or propagator approximation
- Quantum linear solve
- Matrix function
- QSP phase factors
- Polynomial approximation
- Block-encode a matrix
- Prepare an input state
- Amplify a success branch
- Simulate Hamiltonian evolution
- Estimate an observable
- Compile a circuit to a specific device
- Satisfy the hardware connectivity constraint
- Approximate a continuous rotation in a discrete gate set
- Recover a noiseless expectation value by post-processing
- Build logical qubits at a target logical error rate
- Estimate a Hamiltonian's ground-state energy
- Choose a parameterised trial state
- Minimise the objective over the parameters
- Estimate an excited-state energy
- Measure what the machine can actually do
- Recover the period of a periodic function
- Estimate the eigenphase of a unitary
- Find the item a check accepts
- Walk a graph to the vertex you want
- Search a cost Hamiltonian for the assignment it minimises
What is on this map, counted
What is here, counted
147 nodes — 31 slots and 116 methods.
76 of the 147 link to a record in the Atlas, between them naming 89 records. The rest name papers and nothing else: this graph describes work the catalogue has not got yet, and the nodes with no record are the list of what a corpus pass has to go and read.
0 slots have no method recorded, and 32 methods have not been taken apart. Both are shown as what they are rather than left blank.
Every claim here rests on a source. This graph cites 140 papers; they and the 172 the Atlas cites alone are registered in one place, with what each reports and everywhere it is cited from. Papers