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
Unitary coupled-cluster singles and doubles
Build the trial state from single and double excitations out of a reference determinant, exponentiated as a unitary. The family is chosen for chemistry rather than for the machine: the state you want is in it by construction, and the circuit that reaches it is deep.
Open the full recordFills the slot: Choose a parameterised trial state
O'Malley et al. report this as the first electronic structure calculation on a quantum computer "without exponentially costly precompilation", running UCC through VQE alongside the Trotterisation-and-phase-estimation route on the same device, and comparing them: they find "clear evidence that the variational quantum eigensolver is robust to certain errors". That comparison is the evidence for the whole variational branch, and it was made on molecular hydrogen.
The Hamiltonian whose ground state is wanted, together with whatever structure is to be respected — particle number, spin, point-group symmetry, a reference determinant — and the connectivity and native gate set of the device the family has to run on.
Hamiltonian whose eigenvalues are wanted → Parameterised circuit familyexponentiate T minus T-dagger onto HF
Starting from the Hartree-Fock determinant , the ansatz forms , exponentiating an anti-Hermitian generator rather than the non-unitary of classical coupled cluster. approximation: the cluster operator is cut to its first two terms, leaving and , built on assumption: occ and virt are the occupied and unoccupied sites of that fixed Hartree-Fock state. The amplitudes are not solved from CC's projection equations but varied to minimize directly. approximation: on hardware is Trotterized into a product of exponentials of its individual excitation/de-excitation terms
approximationassumption
A circuit family with a fixed structure and free real parameters, together with the number of those parameters — which is the size of the classical search problem handed to the next layer.
None found yet.
given ground-state eigenvalue problem for Hamiltonian H on N spin orbitals, eta electrons
Hartree-Fock reference determinant |phi>
requires a reference state |phi> -- here taken to be the Hartree-Fock
determinant; that is a choice specific to this construction, not a
general requirement of UCC, which the paper notes (unlike traditional
CC) can instead be built on a multireference reference (Appendix D)
# for this HF choice, occ / virt below is the fixed split of spin
# orbitals that determinant defines
# --- cluster operator, truncated to singles and doubles ---------------------
T(theta) = T1(theta) + T2(theta)
# the full cluster operator is T = sum_k T^(k)(theta); stopping at k=1,2
# is what earns this ansatz the name UCCSD, as opposed to full UCC (Appendix D)
T1(theta) = sum_{i in occ, a in virt} theta^a_i a_a^dagger a_i (Eq. D3)
T2(theta) = (1/4) sum_{i1,i2 in occ, a1,a2 in virt}
theta^{a1,a2}_{i1,i2} a_a2^dagger a_i2 a_a1^dagger a_i1 (Eq. D4)
# --- exponentiate as a unitary onto the reference ----------------------------
U(theta) = exp( T(theta) - T(theta)^dagger )
|phi(theta)> = U(theta) |phi> (Eq. D1)
# anti-Hermitian generator => U(theta) unitary for EVERY theta, so the
# variational principle holds at any theta, not only at convergence:
# E(theta) = <phi(theta)|H|phi(theta)> >= E_0 (Eq. 2)
# classical CC's non-unitary e^T has no such guarantee -- with spin-
# restricted orbitals, CCSD's projective energy is "not in general
# variational" and catastrophic failure on bond-breaking is quite
# common (Lee et al.)
# for H2 in a minimal basis exactly one amplitude survives: after the
# qubit mapping this specializes to |phi(theta)> = exp(-i theta X0 Y1) |01>
# (Eq. 3)
# --- compile onto a device: Trotterize term by term --------------------------
U_trot(theta) = prod over each excitation/de-excitation term tau of T(theta)-T(theta)^dagger
of exp( theta_tau * tau )
|phi(theta)> ~= U_trot(theta) |phi> # this, not U(theta), is what runs on hardware
# a practical circuit uses a SMALL number of Trotter steps and is therefore
# not exactly equivalent to the ideal e^{T-T^dagger} ansatz above; one step
# has been reported -- not proven in general -- to already reach chemical
# accuracy (Lee et al., citing ref. 64)
# Lee et al. count O((N-eta)^2 eta^2) such terms, each acting on O(1) spin
# orbitals, and note gate count would naively be expected to be lower-
# bounded by the free amplitudes theta^a_i, theta^{a1,a2}_{i1,i2} --
# possibly with added overhead from the fermion-to-qubit mapping and
# device connectivity (Lee et al., p.16)
# no analogous EXACT preparation is known to be efficient classically; the
# scalable routes cited here are for a fixed, already-chosen theta on
# quantum hardware (Appendix D)
return the parameterized circuit family |phi(theta)> ~= U_trot(theta) |phi>
# theta is left free here -- a separate, outer classical loop (VQE) varies it
# to minimize E(theta); that loop is not part of building this familyCircuit depth in the number of spin orbitals and the number of electrons — the figure Lee et al. quote for UCCSD when placing their own ansatz against it. It is a depth for the family, not a complexity for solving the problem: no worst-case speedup is claimed here or anywhere in this region.
None found yet.
None found yet.
UCC-VQE hydrogen curve on the Xmon superconducting processor
- Scalable Quantum Simulation of Molecular Energies
P. J. J. O'Malley, R. Babbush, I. D. Kivlichan, J. Romero, J. R. McClean, R. Barends, J. Kelly, P. Roushan, A. Tranter, N. Ding, B. Campbell, Y. Chen, Z. Chen, B. Chiaro, A. Dunsworth, A. G. Fowler, E. Jeffrey, A. Megrant, J. Y. Mutus, C. Neill, C. Quintana, D. Sank, A. Vainsencher, J. Wenner, T. C. White, P. V. Coveney, P. J. Love, H. Neven, A. Aspuru-Guzik, J. M. Martinis · 2015
About
O'Malley et al. set out to compute the potential energy curve of molecular hydrogen on superconducting hardware and to reach chemical accuracy, which they define as Hartree — the relative energy error that at room temperature already shifts a chemical rate by an order of magnitude. They report it as "the first electronic structure calculation performed on a quantum computer without exponentially costly precompilation", the point being that earlier chemistry experiments represented the Hamiltonian in a configuration basis and exponentiated an exponentially large matrix as a classical preprocessing step. The same device ran the Trotterisation-plus-phase-estimation route on the same molecule, so the two approaches could be compared directly; only the UCC-VQE half is this implementation.
Methods
Two qubits of a linear Xmon chain carry the whole molecule. The Hartree-Fock state is prepared with an gate on , and the unitary coupled cluster ansatz is applied as (Eq. 3); the paper states outright that "for molecular hydrogen in the minimal basis, there is exactly one term in the UCCSD ansatz" (Appendix D), so the circuit carries a single variational parameter. The rotation is implemented as a phase shift on all subsequent gates; a single VQE sequence is 11 single-qubit gates and two gates. Rather than close the classical feedback loop, the authors "elected to scan a thousand different values of " at each bond length, then took the smallest energy; they state this was done to simplify the classical feedback routine at the cost of more experimental trials, and that the energy surface of Fig. 2b "was locally optimized at each bond length to emulate an on-the-fly implementation". Energies are assembled from partial tomography of the terms of the two-qubit Hamiltonian — , for instance, is measured by applying gates to each qubit before readout — and summed with the tabulated coefficients (Eq. 4). The experiment is run in different gauges of the Bravyi-Kitaev transform (a flip of one or both qubits in the Hartree-Fock input state plus a sign change on the relevant Hamiltonian terms) and the statistics averaged together.
Data
Molecular hydrogen in the minimal STO-6G basis of Hartree-Fock orbitals, second-quantised and mapped to qubits by the Bravyi-Kitaev transformation; the four-qubit spin Hamiltonian is quoted as reported by Seeley, Richard and Love (J. Chem. Phys. 137, 224109 (2012)). Qubits 1 and 3 are never flipped from the Hartree-Fock start, and that symmetry reduces the problem to the two-qubit effective Hamiltonian (Eq. A6). Table I gives the six coefficients at every bond length from to Å in steps of 0.05 Å, together with the Trotter orderings and used by the phase-estimation half of the paper. The authors note in the acknowledgements that an error in the values of an earlier version of the work was brought to their attention and corrected.
Code
None found yet.
Results
Run on Xmon variant planar transmon qubits in a dilution refrigerator at a base temperature of 20 mK; for VQE, and at 4.49 and 5.53 GHz with all other qubits detuned to 3 GHz and below, energy relaxation times and s and Ramsey decay times and s. The VQE experiment predicts the dissociation energy with an error of Hartree, below the chemical accuracy threshold. That dissociation energy is taken relative to the equilibrium geometry, which the paper identifies with the minimum-energy bond length Å of the curve in Fig. 3a — not a bond length the experiment sampled, since Table I's grid runs from 0.20 to 2.85 Å in steps of 0.05 Å. The same hardware run evaluated at the theoretically optimal instead of the experimentally optimal one gives a dissociation energy error of Hartree, "more than an order of magnitude worse" — the paper calls this "the first experimental signature of robustness" of VQE to systematic error, and the comparison with its own PEA run, which showed a dissociation energy error of Hartree from a single Trotter step, is what the paper leans on for "clear evidence that the variational quantum eigensolver is robust to certain errors". Error bars come from a Gaussian process regression over the potential energy curve, propagated from shot-noise-limited expectation values.
- Scalable Quantum Simulation of Molecular Energies
In-house UCCSD benchmark code over H4, H2O and N2
- Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
Joonho Lee, William J. Huggins, Martin Head-Gordon, K. Birgitta Whaley · 2018
About
Lee et al. introduce one new ansatz, -UpCCGSD, and need two points of comparison for it: UCCGSD — a unitary generalized-singles-and-doubles ansatz that they name and are the first to study classically without approximating the energy evaluation, but whose idea they credit to Nooijen — and UCCSD as the incumbent. The comparison runs on resources and on accuracy. Their resource table is where this method's depth figure comes from: for a fixed number of Trotter steps, UCCSD costs gates at circuit depth , against and for UCCGSD and and for -UpCCGSD (Table 1). The accuracy half is what this entry records: three molecules of very different symmetries, each run through UCCSD and through the other two ansätze on the same footing.
Methods
The energy is computed variationally as a function of the cluster amplitudes, (Eq. 9), and its gradient handed to SciPy's implementation of the BFGS algorithm, a quasi-Newton method that needs no explicit Hessian. All the UCCSD calculations run in an in-house code the authors describe as using OpenFermion together with TensorFlow for efficient gradient evaluations; its stated ceiling is "about 16 spin-orbitals", which the authors say allowed them to examine the model systems presented, and they point readers wanting a production-level code to the implementation of Evangelista (J. Chem. Phys. 134, 224102 (2011)). Because it is not clear whether a given UCC class reaches its global minimum, "each gradient-based optimization was therefore carried out between thirty and two hundred times (depending on the cost) starting from randomly chosen initial points". The frozen core approximation is applied to oxygen and nitrogen. Accuracy is reported as the non-parallelity error, defined here as the difference between the maximum and the minimum error over the curve. Excited states are obtained with a variant of the orthogonally constrained VQE (OC-VQE) framework of Higgott, Wang and Brierley (arXiv:1805.08138). The authors are explicit that this is a classical benchmark of the ideal ansatz, not of a compiled circuit: "a practical implementation of UCC relies on approximating by a small number of Trotter steps, which leads to ansätze that are not exactly equivalent to the ones considered in our numerical calculations", and BFGS as performed here "is unsuitable for use on a quantum device due to the stochastic error associated with the measurement of observables in the VQE framework".
Data
Three systems. H4 in a coordinate setup with fixed Å and the separation between the two H2 units varied, in STO-3G (, ) and in 6-31G (, ) — the 6-31G case is called "the most expensive calculation reported in this work" in quantum-device terms. The double dissociation of H2O at fixed within symmetry, STO-3G (, ). The dissociation of N2 in STO-3G (, ). Full configuration interaction reference energies come from Psi4 through its OpenFermion interface; the classical coupled-cluster comparisons (RCCSD, UnrCCSD, CCVB-SD) come from the development version of Q-Chem.
Code
None found yet.
Results
All UCCSD calculations were performed with the authors' in-house code, which uses OpenFermion together with TensorFlow for efficient gradient evaluations; everything else the demonstrations required was done with the development version of Q-Chem. Both are classical computations — no quantum hardware and no quantum simulator is involved, and the paper reports no machine, cluster or wall-clock figure. All figures below are non-parallelity errors in mE. On the ground state of H4 in STO-3G, "except 1-UpCCGSD and UCCSD, all the UCC variants are numerically exact". On the first excited state of H2O in STO-3G, UCCSD's NPE is 17.57, against 0.00 for UCCGSD, 30.22 for 1-UpCCGSD, 0.98 for 2-UpCCGSD and 0.01 for 3-UpCCGSD (Table 5b) — 1-UpCCGSD is worse than UCCSD, and the paper groups the two together as the methods that "do not deliver reliable excited state energies". On the first excited state of N2 in STO-3G, UCCSD's NPE is 31.94, worse than UCCGSD's 7.79, and neither is near chemical accuracy; on the ground state of N2, UCCSD is worse in NPE than unrestricted CCSD, whose NPE is 8.98. For H4 in 6-31G the authors find RCCSD better than UCCSD and suspect that is fortuitous, since RCCSD "clearly becomes non-variational at Å". The paper's own reading of the sweep is that "UCCSD does not perform very well given the number of amplitudes" and that -UpCCGSD at a comparable amplitude count always beat it.
- Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
UCCSD VQE ansatz · Qiskit
From the repository — run, not written up from a paper · unsupported
About
A chemistry-inspired unitary coupled-cluster ansatz truncated to single and double excitations.
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.
- UCCSD VQE ansatz
A chemistry-inspired unitary coupled-cluster ansatz truncated to single and double excitations.
References
- Scalable Quantum Simulation of Molecular Energies
P. J. J. O'Malley, R. Babbush, I. D. Kivlichan, J. Romero, J. R. McClean, R. Barends, J. Kelly, P. Roushan, A. Tranter, N. Ding, B. Campbell, Y. Chen, Z. Chen, B. Chiaro, A. Dunsworth, A. G. Fowler, E. Jeffrey, A. Megrant, J. Y. Mutus, C. Neill, C. Quintana, D. Sank, A. Vainsencher, J. Wenner, T. C. White, P. V. Coveney, P. J. Love, H. Neven, A. Aspuru-Guzik, J. M. Martinis · 2015
- Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
Joonho Lee, William J. Huggins, Martin Head-Gordon, K. Birgitta Whaley · 2018
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.
15 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 — open · opened: what was inside is drawn in its place
- Choose a parameterised trial state — opens into 13 · a way across — click it to open it here
- Minimise the objective over the parameters — opens into 6 · a way across — click it to open it here
- Estimate an observable — opens into 4 · 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