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
Orbital-optimized coupled-cluster circuits
Let the orbitals move too. The usual family fixes a basis and varies the amplitudes; this one varies the molecular orbital coefficients alongside them, so the same accuracy is reachable from a smaller active space and a shallower circuit — and the energy becomes fully variational, which is what makes forces available.
Open the full recordFills the slot: Choose a parameterised trial state
Mizukami et al. state what is varied and what follows from it. OO-UCC "variationally determines the coupled cluster amplitudes and also molecular orbital coefficients", and "owing to its fully variational nature, first-order properties are readily available" — which they cash out immediately: "this feature allows the optimization of molecular structures in VQE without solving any additional equations". The resource claim is comparative and unquantified in the abstract: "the method requires smaller active space and shallower quantum circuit than UCC to achieve the same accuracy", with no number attached, so none is quoted here. Evidence is simulation, and it is worth naming what was simulated because it is a property calculation rather than a single energy: "numerical examples of OO-UCC using quantum simulators, which include the geometry optimization of the water and ammonia molecules using analytical first derivatives of the VQE".
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 familyrotate orbitals via Newton-Raphson on Hk=-g
The route starts from UCCSD, with , and factors it as . Because the singles generator is identical to the orbital-rotation operator , , assumption: the singles/orbital part can be optimized on a classical computer from the 1- and 2-electron reduced density matrices VQE already measures, rather than varied on the circuit, collapsing the ansatz to OO-UCCD, , . Orbitals move by a Newton-Raphson step built from the electronic Hessian and gradient , alternated with VQE until self-consistent. approximation: mapping onto the circuit truncates the Trotter expansion at its first step, .
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 molecular Hamiltonian H built from 1- and 2-electron integrals h_pq, h_pqrs
in a chosen orbital basis; reference determinant |0> (conventionally Hartree-Fock)
UCCSD ansatz |Psi> = e^(A1+A2) |0>, A_n = T_n - T_n^dagger (Eq. 3, Eq. 9)
a VQE circuit that already measures the 1- and 2-particle RDMs needed below
# RDMs are "readily available in VQE, because it measures [them] to
# compute electronic energy in a given quantum circuit" -- no extra
# measurement is added for the orbital step
requires no formal bound is stated on the outer loop below;
# optimizing the singles/orbital part classically from the measured RDMs, rather
# than varying it on the circuit, is presented as a design choice (Sec. II),
# not as something the paper proves necessary
# --- decompose UCCSD into a classical orbital rotation and a Trotterized doubles part ---
model |Psi'> = e^(A2) e^(A1) |0> (Eq. 10)
# a distinct wave-function model, not an exact rewrite of e^(A1+A2)|0>:
# A1 and A2 do not commute, so separating them "is different from the
# original ansatz" (Sec. II)
identify e^(A1) with the orbital-rotation operator e^(kappa) (Sec. II)
kappa = sum_pq kappa_pq (Epq - Eqp), Epq^- := Epq - Eqp
# "the singles part e^(A1) ... is identical to the orbital rotation unitary
# operator e^kappa" -- so it can be optimized on a classical computer via
# standard orbital-optimization technique instead of varied on the circuit
collapse to |Psi_OOUCCD> = e^(A2~) |0~>, |0~> = e^(A1) |0> (Eq. 11)
# --- outer loop: alternate VQE with a classical Newton-Raphson orbital step ---
repeat
run VQE, optimizing doubles amplitudes A2~ on the circuit -> E(A2~, kappa)
from the 1RDM, 2RDM VQE just measured, form
g_pq = <Psi|[H, Epq^-]|Psi> (Eq. 8)
Hess_pq,rs = (1/2) ( <Psi|[[H,Epq^-],Ers^-]|Psi> + <Psi|[[H,Ers^-],Epq^-]|Psi> ) (Eq. 7)
solve Hess kappa_step = -g for the orbital-rotation step (Eq. 6, Newton-Raphson)
kappa <- kappa + kappa_step
until self-consistent
# "we repeatedly perform the VQE and the orbital optimization until
# convergence" -- no cycle-count bound is given (Sec. II);
# "UCCSD-level ... results ... at the cost of repeated VQE optimizations" (Sec. III)
# at self-consistency the singles operator A1~ itself vanishes (the Brueckner
# condition) together with dE/dkappa = 0, simultaneously and by construction
# of the separation above -- "variational orbitals are Brueckner orbitals
# in this ansatz" (Sec. II, 'Trotterization and Brueckner orbitals')
# the paper's own printed condition is the exponential e^(A1~) = 0 -- which
# cannot literally hold for a unitary exponential of an anti-Hermitian
# operator; read here, per that same sentence's prose ("the singles'
# contribution ... vanishes"), as the operator condition A1~ = 0
# --- map the converged doubles generator onto the circuit ---
Trotterize e^(A2~) ~= prod_mu e^(A2~_mu), truncated at the first Trotter step (Eq. 14)
# this defines OO-UCCD1; a single Trotter step is a large truncation of the
# BCH-infinite UCC generator, and this paper proves no bound on the
# truncation error -- it cites Barkoutsos et al.'s empirical finding that a
# single step "reproduces ground-state energy accurately", and reports its own
# numerics (LiH, H2O, NH3) showing OO-UCCD1 tracks UCCSD1 closely (Table I, Fig. 1)
return the OO-UCCD1 circuit family together with converged (theta, kappa)
as the trial state for the eigenvalue problem
# because theta and kappa are BOTH variationally converged, the full chain rule
# dE/dx = dE/dx|_x + (dE/dtheta)(dtheta/dx) + (dE/dkappa)(dkappa/dx) (Eq. 12)
# collapses to just the Hellmann-Feynman term:
dE/dx = <Psi| dH/dx |Psi> # consequence of Eq. 12
# the d(E)/d(theta) . d(theta)/dx term vanishes because VQE has converged theta;
# the d(E)/d(kappa) . d(kappa)/dx term vanishes because the orbitals are optimized
# a non-orbital-optimized VQE keeps that second term and must instead solve a
# coupled-perturbed Hartree-Fock (CPHF) equation for the orbital response (Eq. 13)The paper's only resource figures are measured on one molecule, not derived. Mizukami, Mitarai, Nakagawa, Yamamoto, Yan and Ohnishi report, for ammonia in STO-3G with all electrons correlated and no active-space approximation, 120 VQE parameters and quantum-circuit depth 2720 for OO-UCCD truncated at the first Trotter step — the same pair they quote for plain UCCD at that truncation — against 135 and 2780 for UCCSD, likewise at one Trotter step. They call the reduction slight, and never define what the depth counts or in what gate set. It is paid for by an unbounded outer loop: singles are handled classically, so VQE and a classical Newton–Raphson orbital optimisation are repeated until convergence, UCCSD-level accuracy coming "at the cost of repeated VQE optimizations", with no bound and no measured count of cycles. Once both and are converged, a first derivative costs only the expectation value of the derivative of the Hamiltonian; second and higher derivatives still need the circuit-parameter response. The abstract's other claim — smaller active space, hence fewer qubits — is nowhere quantified.
None found yet.
None found yet.
Orbital-optimized VQE · Qiskit
From the repository — run, not written up from a paper · unsupported
About
Orbital rotations are optimized alongside circuit parameters to improve compact active-space descriptions.
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.
- Orbital-optimized VQE
Orbital rotations are optimized alongside circuit parameters to improve compact active-space descriptions.
References
- Orbital optimized unitary coupled cluster theory for quantum computer
Wataru Mizukami, Kosuke Mitarai, Yuya O. Nakagawa, Takahiro Yamamoto, Tennin Yan, Yu-ya Ohnishi · 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.
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 — 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 ×inputs — opens into 4 · 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