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
Multistate contracted variational eigensolver
Optimise one circuit for several states at once and read off the transitions between them — both the energy of each transition and the oscillator strength that says how strongly light drives it. The answer is a spectrum with intensities, which is what an absorption experiment actually produces.
Open the full recordFills the slot: Estimate an excited-state energyExpand it here — a map of just this
Parrish et al. describe the extension by what it returns: MC-VQE "allows for the efficient computation of the transition energies between the ground state and several low-lying excited states of a molecule, as well as the oscillator strengths associated with these transitions". The oscillator strengths are the part no other route in this slot claims, and they are what turns a list of energies into a spectrum that can be compared with an experiment. Evidence is a simulation at a size worth stating: they "numerically simulate MC-VQE by computing the absorption spectrum of an ab initio exciton model of an 18-chromophore light-harvesting complex from purple photosynthetic bacteria". The abstract quantifies no circuit count, measurement count or scaling, and "efficient" is its word for the approach rather than a bound anyone proved here.
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 → Parameterised circuit familyChoose a parameterised trial state
MC-VQE splits this slot: only the second half is variational. A classical CIS solve fixes the contracted, orthonormal reference states on qubits, one per chromophore; the demonstration keeps that whole manifold, so there assumption: each monomer carries only a ground and a first excited state, a restriction adopted "to facilitate ease of mapping to qubits". Their amplitudes load through a fixed matryoshka ladder: an pump, then controlled gates, with angles read recursively off the CIS coefficients, , , the last resolved only up to a phase that a separate check on the forward formula fixes; none is free. All variational freedom lives in the entangler , restrictable to without loss because the real exciton Hamiltonian's adiabatic eigenfunctions can be written as real, orthonormal vectors with arbitrary total phase , and built as one six-parameter block per two-body interaction site. The ansatz is .
assumption
Parameterised circuit family → State you can prepareMinimise the objective over the parameters
The entangler is tuned to "maximally decouple" the approximate eigenstates from the rest of the Hilbert space — to block-diagonalise approximation: that decoupling is only approximate, and only in a 2-norm sense in the Hamiltonian: the state average , the second equality following "from the definition of the trace". No penalty term and no projection against lower roots: one scalar covers every state, so "all states are computed to approximately equal accuracy". Only the trace enters, so the loop measures only the diagonal elements ; off-diagonals wait until the angles converge. The demonstration ran L-BFGS on 108 parameters from a zero-entanglement guess of all-zero angles, converging in 14 iterations approximation: gradients are second-order symmetric finite differences with , not analytic assumption: barren plateaus are sidestepped because that solution lay "directly downhill" from the guess — one system, not a proof; another parametrisation needs about twice the L-BFGS iterations to reach it, and a qualitatively different solution under steepest descent.
approximationassumption
State you can prepare → Number with an error barEstimate an observable
Partial tomography of 1- and 2-body Paulis gives the diagonal ; each off-diagonal element costs two further interference-state preparations, each measured over that same Pauli set, through , built by the same ladder with coefficients . Classical diagonalisation with returns Ritz eigenvalues and rotated reference states , with . Substituting the desired operator for in that formula, on the rotated states, gives transition properties — finally the oscillator strength , the square running over Cartesian components of the vector-valued — one-body Paulis only. MC-VQE needs higher-order density matrices at no stage assumption: shot noise and device error are absent — the demonstration's expectation values were contractions of simulator wavefunction amplitudes, "equivalent to infinite averaging of discrete Pauli measurements", with noise and error channels not modelled, so no shot count is charged.
assumption
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.
None found yet.
given N chromophore monomers, each carrying two photoactive states |0_A>
(ground) and |1_A> (excited) -- a restriction adopted "to facilitate
ease of mapping to qubits", not a general limit of the method
an ab initio exciton Hamiltonian H = E*I + H1 + H2 on N qubits,
written in 1- and 2-body Pauli operators (Eq. 8)
N_Theta = N+1 target states: the CIS manifold -- 1 ground
configuration plus N singly-excited configurations, all allowed
to mix (Supp., CIS State Preparation)
requires an efficient circuit to prepare each CIS reference state |Phi_Theta>
and each interference state (|Phi_Theta> +/- |Phi_Theta'>)/sqrt(2) -- a
condition specific to this construction, met here by a "matryoshka" ladder
of one Ry pump gate on |0_A> and N-1 controlled Fy gates on the rest,
with angles read recursively off the classical CIS coefficients
mu, alpha, beta, ... (Supp. Eqs. 42-55)
# --- stage 1: classical reference states ------------------------------------
solve CIS (or another polynomial-scaling classical method) for H
-> N_Theta contracted, orthonormal reference states {|Phi_Theta>}
# this only "sketches out" the shape of each state; nothing here is
# variational, and nothing here is proved accurate
# --- stage 2: state-averaged optimisation of the entangler ------------------
U(eta) = one SO(4) two-body entangler block per two-body interaction site
of the exciton Hamiltonian, eta its 6 real angles (Eq. 67, Supp.)
# TWO separate restrictions here, and only the first is proved lossless:
# (a) restricting U to SO(2^N) is "without loss" -- the real exciton
# Hamiltonian's adiabatic eigenfunctions can be written as real,
# orthonormal vectors with only an overall +/-1 phase free
# (Supp., VQE Global Entangler Matrix)
# (b) building that SO(2^N) entangler out of ONE layer of local, per-site
# SO(4) blocks is a design choice, NOT covered by (a): the paper's
# own words are "we have elected to construct", with no completeness
# claim, and it offers further layers or entanglers extended "to the
# next layer(s) of nearest neighbors" when "additional variational
# flexibility in the ansatz is desired" (Supp., after Eq. 60)
loop, varying eta, until the state-averaged energy stops decreasing:
# the paper states no general stopping rule for this loop -- only what
# happened in its one demonstration; the phrasing here is a gloss
for each Theta in [0, N_Theta):
prepare |Phi_Theta>, apply U(eta)
measure the diagonal element only
H_ThetaTheta = <Phi_Theta| U(eta)^dagger H U(eta) |Phi_Theta> (Eq. 4)
Ebar(eta) = (1/N_Theta) * sum_Theta H_ThetaTheta (Eq. 6)
# equals the trace of the contracted Hamiltonian in the {Phi_Theta}
# basis "from the definition of the trace" -- so minimising Ebar IS
# minimising the sum of these diagonal elements, nothing more
step eta to reduce Ebar
# demonstration: L-BFGS from an all-zero initial guess, second-order
# symmetric finite-difference gradients (delta_theta = 0.01),
# converged in 14 iterations on the N=18 system -- offered as an
# empirical route around barren plateaus (the minimum found lay
# "directly downhill" from the guess), not a proven one; a
# different logical SO(4) parametrisation of the same block took
# about twice as many L-BFGS iterations to the same solution
U_fixed <- U(eta) at the stopping point
# one scalar objective covers every state, so all N_Theta states are
# "computed to approximately equal accuracy" -- no penalty term or
# projection singles out the ground state, unlike orthogonality-
# constrained VQE
# --- stage 3: off-diagonal elements, entangler now fixed --------------------
for each pair Theta, Theta' with Theta != Theta':
prepare (|Phi_Theta> + |Phi_Theta'>)/sqrt(2), apply U_fixed, measure H
prepare (|Phi_Theta> - |Phi_Theta'>)/sqrt(2), apply U_fixed, measure H
H_ThetaTheta' = [ (sum-state expectation) - (difference-state expectation) ] / 2
(Eq. 5)
# two further circuits per off-diagonal element, this pair costed
# separately AFTER eta has converged -- not folded into stage 2
# only 1- and 2-body Pauli expectation values are ever measured here;
# no 3- or 4-particle density matrix is required anywhere in MC-VQE
# --- stage 4: classical diagonalisation of the N_Theta x N_Theta problem ----
diagonalize H_ThetaTheta':
H_Theta''Theta' V_Theta'Theta = V_Theta''Theta E_Theta,
V_Theta'Theta V_Theta'Theta'' = delta(Theta, Theta'') (Eq. 2)
# E_Theta are RITZ approximations to the exact eigenvalues, not the
# eigenvalues themselves
|Gamma_Theta> = sum_Theta' |Phi_Theta'> V_Theta'Theta # rotated references
|Psi_Theta> = U_fixed |Gamma_Theta> # approximate eigenstates
# --- transition properties: stage 3's formula, mu_hat standing in for H ----
mu_hat = sum_A mu_I^A * I_A + mu_Z^A * Z_A + mu_X^A * X_A
# one-body Paulis only; obtained by substituting the desired operator
# for H in the stage-3 formula (Eq. 5, 77)
for each pair Theta, Theta':
O_ThetaTheta' = (2/3) * (E_Theta' - E_Theta) * <Psi_Theta| mu_hat |Psi_Theta'>^2
# sum over the Cartesian components of the vector-valued mu_hat (Eq. 76)
return {E_Theta} and {O_ThetaTheta'} over the CIS manifold
-> an excitation-energy and oscillator-strength spectrum, e.g. an
absorption spectrum built by broadening each transition
# demonstrated noiseless, at infinite shots: 1- and 2-body expectation values
# were contractions of simulator wavefunction amplitudes, "equivalent to
# infinite averaging of discrete Pauli measurements", with no noise or
# error channel modelled and so no shot count charged; N=18, a SINGLE
# entangler layer, 108 parameters, matched FCI to tens of microeV in
# energy and well under 1% in oscillator strength -- one system, not proved
# depth linear and gate count quadratic in N is claimed only for exciton
# models "with local Hamiltonian connectivity", in the Outlook, and without
# derivation -- do not read it as proved or as general to other HamiltoniansParrish, Hohenstein, McMahon and Martínez count MC-VQE in contracted Hamiltonian elements: optimising the state-averaged entangler "requires only the measurement of diagonal matrix elements ", and the off-diagonal elements — written , though only are distinct — are determined afterwards, two interference-state circuits each (Eq. 5), from 1- and 2-body Paulis alone: one-body terms plus four per monomer pair (Eq. 8), truncated to nearest-neighbour pairs in the demonstration, where on qubits. Nothing bounds the outer loop: the demonstration reports 108 parameters — six per entangler, one entangler per interaction site, a single layer — converging in "14 L-BFGS iterations" of second-order symmetric finite differences, to within tens of eV and oscillator strength of FCI on the LH2 B850 ring; one noiseless, infinite-shot simulation, not proved, and a different parametrisation "takes approximately twice as many iterations". The Outlook claims depth linear and gate count quadratic in for exciton models "with local Hamiltonian connectivity", without derivation.
None found yet.
None found yet.
Multistate contracted VQE · Qiskit
From the repository — run, not written up from a paper · unsupported
About
A contracted reference subspace is jointly entangled before a small effective Hamiltonian is diagonalized.
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.
- Multistate contracted VQE
A contracted reference subspace is jointly entangled before a small effective Hamiltonian is diagonalized.
References
- Quantum Computation of Electronic Transitions using a Variational Quantum Eigensolver
Robert M. Parrish, Edward G. Hohenstein, Peter L. McMahon, Todd J. Martinez · 2019
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
Compile a circuit to a specific device
- NISQ transpilation (retargetable pass pipeline) — open · opened: what was inside is drawn in its place
- Satisfy the hardware connectivity constraint — opens into 3 · a way across — click it to open it here
- Fault-tolerant compilation (Clifford+T pipeline) — opens into 2 · 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