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
Particle-hole coupled-cluster circuits
Rewrite the Hamiltonian around the reference determinant so that what the circuit has to describe is excitations out of it, then build the family from gates that move an electron without creating or destroying one. Staying inside the right particle-number sector is a property of the gates, not something the optimiser has to discover.
Open the full recordFills the slot: Choose a parameterised trial state
Barkoutsos et al. put the transformation before the circuit: they "propose a transformation of the electronic structure Hamiltonian in the second quantization framework into the particle-hole (p/h) picture, which offers a better starting point for the expansion of the trial wavefunction", so that the state "is parametrized in a way to efficiently explore the sector of the molecular Fock space that contains the desired solution". The circuit family follows from that choice — "a new family of quantum circuits based on exchange-type gates that enable accurate calculations while keeping the gate count (i.e., the circuit depth) low" — and the resulting method is named in the paper: "the particle-hole implementation of the Unitary Coupled Cluster (UCC) method within the Variational Quantum Eigensolver approach ... named q-UCC". The claim to read carefully is the last one, because it is about Trotterisation rather than about accuracy in general: they "show how a single Trotter step can accurately and efficiently reproduce the ground state energies of simple molecular systems", and *simple* is the paper's own word. No hardware run is reported.
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 excitations, Trotter-split
The p/h picture redefines creation/annihilation operators as for holes and for particles (Eqs. 5-8), so normal-ordering against gives (Eq. 9). The end state is , with parameterised by amplitudes in and . approximation: the circuit realises this exponential by a first-order Trotter split (Eq. 16) truncated at a finite number of steps n. assumption: the redefined operators still obey fermionic anti-commutation, so defines a valid quasiparticle vacuum at .
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 electronic Hamiltonian in second quantization, HF orbital basis
H_el = sum_ij h_ij a_i^dag a_j + sum_ijkl g_ijkl a_i^dag a_j^dag a_l a_k (Eq. 1)
HF reference determinant |Phi_0> = prod_{i=1}^N a_i^dag |vac> (Eq. 4)
equivalently the bit-string ket |1...1 0...0>, N occupied orbitals set to 1
(unlabeled form, Sec. III, step iii)
index convention: i,j,k,l occupied; m,n,p,q virtual; r,s,t,u either
fermion-to-qubit map: Jordan-Wigner (Sec. III, step ii)
requires cluster operator truncated at singles+doubles, T = T1 + T2
# higher T_n need only longer circuits, not new theory -- the paper restricts
# its own implementation to UCCSD as "unpractical" beyond that (Sec. II B 1)
# --- rewrite the Hamiltonian in the particle-hole picture ----------------------
redefine b_i^dag = a_i, b_i = a_i^dag (hole creation / annihilation) (Eqs. 5, 7)
b_m^dag = a_m^dag, b_m = a_m (particle creation / annihilation) (Eqs. 6, 8)
# b's still obey fermionic anti-commutation -- N_b[.] then defines a valid
# quasiparticle vacuum at |Phi_0>
normal-order N_b[.] against |Phi_0> to get
H_p/h = E_HF + sum_rs <r|F|s> N_b[a_r^dag a_s]
+ (1/2) sum_rstu <rs|g|tu> N_b[a_r^dag a_s^dag a_u a_t] (Eq. 9)
# this is the operator the device measures -- the qubit register itself is
# not re-encoded, only the Hamiltonian is rewritten
# --- build the cluster operator --------------------------------------------------
T1 = sum_{i;m} theta_i^m a_m^dag a_i (Eq. 13)
T2 = (1/2) sum_{i,j;m,n} theta_{i,j}^{m,n} a_n^dag a_m^dag a_j a_i (Eq. 14)
# sums run over ALL occupied/virtual pairs -- an active-space restriction to
# primed subsets i',m' shrinks them directly, same functional form (Eqs. 23-24)
|Psi(theta)> = exp( (T1 - T1^dag) + (T2 - T2^dag) ) |Phi_0> (Eq. 12)
# --- exponentiate by first-order Trotter splitting, n steps ----------------------
exp( (T1-T1^dag) + (T2-T2^dag) )
~= [ exp((T1-T1^dag)/n) exp((T2-T2^dag)/n) ]^n (Eq. 25)
# exact only as n -> infinity, general two-term case (Eq. 16)
# each factor realised by the excitation circuits of Fig. 1;
# the underlying Pauli-string form is given in App. A (Eq. AA.6)
# --- optimise theta by VQE, at the chosen n --------------------------------------
loop
prepare |Psi(theta)> on the device via the n-step circuit above
measure <Psi(theta)| H_p/h |Psi(theta)>
theta <- BFGS step on the measured energy (Sec. III)
until convergence
return |Psi(theta_min)>, E_GS = E_HF + E_corr_UCCSD(theta_min) (Eq. 15)
# n=1, WITH theta fully re-optimised by VQE AT that n, measures error < 1e-10 Ha
# at equilibrium H2 (Eq. 27; Fig. 5 red triangles) -- a DIFFERENT, larger
# 'Trotter error' (Eq. 26, amplitudes fixed at their exact-exponentiation
# values) is plotted in the same figure for comparison and is NOT the
# quantity claimed small here. The paper calls the n=1 result "surprising",
# explained by VQE's flexibility 'absorbing' the error, and explicitly not
# a proven bound (Sec. IV B 2; Sec. V)Barkoutsos et al. give one scaling: q-UCCSD circuit depth as — binomial coefficients — for the cluster operator truncated at , where and count only orbitals taking part in the excitations, so an active space shrinks it directly. Everything else is measured on in 6-31G (8 qubits, no Hamiltonian reduction), in simulation, with nearest-neighbour connectivity and exchange gates counted as one native two-qubit operation. q-UCCSD at a single Trotter step: 15 parameters, 708 one-qubit and 608 two-qubit gates, identical under both Hamiltonians — the particle-hole rewrite buys optimiser work, BFGS iterations falling 53 to 27 and Pauli-string evaluations to with never fixed, an overall speed-up of "about a factor 2 to 3". For the exchange-gate heuristic ansatz, reaching Ha at equilibrium takes blocks (84 parameters, 42 two-qubit gates, no one-qubit gates) against (112, 56); demanding chemical accuracy ( Ha) along the whole dissociation path erases that saving — , 140, 70 under both. Nothing bounds the VQE iteration count; is fixed empirically. No hardware run.
None found yet.
None found yet.
Particle-conserving VQE circuits · Qiskit
From the repository — run, not written up from a paper · unsupported
About
Givens-style or excitation-preserving blocks keep evolution inside a fixed-particle-number sector.
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.
- Particle-conserving VQE circuits
Givens-style or excitation-preserving blocks keep evolution inside a fixed-particle-number sector.
References
- Quantum algorithms for electronic structure calculations: particle/hole Hamiltonian and optimized wavefunction expansions
Panagiotis Kl. Barkoutsos, Jerome F. Gonthier, Igor Sokolov, Nikolaj Moll, Gian Salis, Andreas Fuhrer, Marc Ganzhorn, Daniel J. Egger, Matthias Troyer, Antonio Mezzacapo, Stefan Filipp, Ivano Tavernelli · 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.
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 — 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 energy variance
- Measure commuting terms together
- 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