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
Warped phase transformation
Introduce one extra variable and change to it, so that a linear ODE or PDE system becomes a system of Schrödinger equations in real time — which a simulator runs as it stands. The original solution lives in the auxiliary dimension and is recovered from it afterwards.
Open the full recordFills the slot: Recast a non-Hermitian generator as Hamiltonian evolution
Unlike the LCHS identity there is no positive-semidefiniteness requirement in order to form the Schrödinger system, and that is the structural difference between the two ways through this slot. What it does require is the extra dimension: the auxiliary variable is continuous, so it has to be truncated and discretized, and the recovery is not free. The original solution is read back either as or pointwise as for a chosen , and that is the factor the non-unitarity was moved into.
The generator with no Hermiticity assumed, the interval , and an error tolerance .
Linear ODE system → Hamiltonian surrogate, with the map backmultiply into a new axis by e^-p
One auxiliary variable is introduced and the solution is multiplied into it, ; for the heat equation , "a simple calculation shows that solves , ", and comes back either as or, "since for all ", pointwise at any chosen as . assumption: The half-line is enough because of which way the wave goes: in the Fourier variable "the solution moves from the right to the left, so no boundary condition is needed at ", and "if we extend to , then the solution does not impact the region " — so the symmetric extension changes nothing where the answer is read. approximation: The -line is then cut to a finite computational domain — "due to the exponential decay of one can (computationally) impose the periodic boundary condition () along the -direction for some sufficiently large".
approximationassumption
A Hermitian generator or a family of them, the enlargement of the space that carrying them cost, and the map that reads the original solution back — with the weight that map applies stated, because that weight is where the non-unitarity was moved to rather than removed.
None found yet.
Example 2.1 of the technical companion is the one run either paper reports, and the paper frames it as justification rather than as a quantum execution: "We conduct a numerical test in one dimension to justify the above idea." The test problem is the heat equation on with the periodic conditions and , whose exact solution is known and is what the numbers are compared against. The transformation is applied as this record states it, with one change made for the numerics: the extension to is given its own rate, , where is forced on to match the exact solution and a large is chosen on so that the initial data occupies a small part of the truncated domain. The grids are points in and in , and the time horizon is not free: the modes contribute most to the propagation, their wave speed is , and the wave must not reach the artificial boundary, so . The first setting takes , , on and , giving ; the second reaches by enlarging the domain to , about 11 in absolute value, with and . Both recovery formulas are exercised — the integral and the pointwise , with taken at a grid point just to the right of because "it is better to pick the point near ... to avoid the loss of significant digits of for large ". The same settings are then run again with a finite difference and upwind scheme in place of the spectral one. What comes out is reported graphically and only graphically: numerical and exact solutions plotted together, and snapshots showing the wave has almost moved to the left end of the domain, "which validates the previous arguments". No error norm, no convergence rate and no table appears anywhere in the paper. And it is a classical computation throughout — the phase space equation is solved on a classical computer, and no quantum device or simulator is named.
Classical simulation · Example 2.1 of arXiv:2212.14703
given the linear equation for u and its initial data u_0
# worked here on the heat equation d_t u - Laplacian u = 0
introduce one auxiliary variable p > 0
set w(t,x,p) = e^{-p} u(t,x)
# then d_t w + d_p Laplacian_x w = 0 for p > 0
extend the initial data symmetrically to p < 0: w(0,x,p) = e^{-|p|} u_0(x)
# the wave moves from right to left, so no boundary condition is needed at p = 0,
# and the extension does not impact the region p > 0
truncate the p-line: impose w(t,x,p=-L) = w(t,x,p=L) = 0 for L > 0 large enough
# justified by the exponential decay of e^{-|p|}
discretise p with step Dp and Fourier transform in p
# what comes out is a Hamiltonian system; simulating it is the layer below
# recovery, afterwards:
# u(t,x) = integral_0^inf w(t,x,p) dp
# or u(t,x) = e^{p*} w(t,x,p*) for any chosen p* > 0Jin, Liu and Yu present the transformation and worked examples — the heat, convection, Fokker-Planck, linear Boltzmann and Black-Scholes equations, with extensions to Vlasov-Fokker-Planck and to the Liouville representation of nonlinear ODEs — rather than a single unified query-complexity theorem. So no like-for-like count against the LCHS figures is given here, and the absence is the paper's shape rather than an omission at this desk.
None found yet.
None found yet.
Fourier spectral discretisation of the phase space heat equation
- Quantum simulation of partial differential equations via Schrodingerisation: technical details
Shi Jin, Nana Liu, Yue Yu · 2022
About
The scheme Example 2.1 actually runs. §2.1.1 turns the heat equation into what the paper calls the phase space heat equation, on with , and this entry is how that equation is put on a grid and solved: a Fourier spectral discretisation in both the spatial and the auxiliary variable, on the periodic one-dimensional problem whose exact solution is known.
Methods
Uniform meshes and . The discrete Fourier transform in gives , where is the matrix representation of the momentum operator ; it is diagonalised as with and , so each component is a linear hyperbolic equation whose wave "moves from the right to the left with speed " and whose analytic solution is available to check against. Fully discretised, the grid values are straightened into and the transform on both variables gives , then with . The tensor products are never formed: the paper uses the matrix identity , "which avoids the use of memory-consuming tensor products".
Data
Initial data , chosen so that the exact solution is available; its DFT coefficients are plotted, and "the amplitudes decay very fast in the Fourier mode , and contribute most to the propagation". Grids and . Two parameter settings: , , on , and ; then with (about 11 in absolute value), and . Nothing is drawn from outside the paper — every input is generated from the closed-form initial condition.
Code
None found yet.
Results
The recovered is plotted against the exact solution for both recovery formulas, the pointwise and the integral , at and again at . Snapshots of the modulus in the frequency space and of in the original space show that "the waves in both spaces have almost moved to the left end, which validates the previous arguments". Agreement is reported graphically; no error norm, convergence rate or table is quoted. The run is classical, and no quantum device or simulator is named.
- Quantum simulation of partial differential equations via Schrodingerisation: technical details
Finite difference and upwind discretisation of the phase space heat equation
- Quantum simulation of partial differential equations via Schrodingerisation: technical details
Shi Jin, Nana Liu, Yue Yu · 2022
About
The paper's second and independent check of the same construction: "One can also use the finite difference discretisation to further validate the above arguments." Same equation and same settings as the spectral run, different discretisation, so what the two share is the transformation rather than the numerical method.
Methods
Central differences in with ghost points and , closed by assuming the discretisation is valid at and and then eliminating the ghost values by periodicity, give with the circulant tridiagonal ; its eigenvalues are . Since the waves travel one way, so is discretised upwind and explicitly, , closed at by the periodicity in . The result is the iteration , with block bidiagonal in and and .
Data
The same settings as the spectral run; the paper says so rather than restating the numbers.
Code
None found yet.
Results
"The numerical results are similar to that of the spectral method under the same settings", shown for both recovery formulas at . Graphical agreement again, with no error norm quoted, and classical again.
- Quantum simulation of partial differential equations via Schrodingerisation: technical details
Applied after spatial discretisation, to the ODE system
- Quantum simulation of partial differential equations via Schrodingerisation: technical details
Shi Jin, Nana Liu, Yue Yu · 2022
- Quantum simulation of partial differential equations via Schrodingerisation
Shi Jin, Nana Liu, Yue Yu · 2022
About
The same transformation in the other order, and the paper draws the distinction itself: "here we first discretise in space (hence is the difference matrix) and then use the warped phase transformation later, but in Section 2 we use the warped phase transformation first and then discretise in space". The problem statement is the ODE system with time-independent and in general non-Hermitian, which is what any linear PDE becomes after spatial discretisation; the short paper writes the same construction in the sign convention .
Methods
is split into Hermitian parts, , and "in view of the stability, it is natural to assume that is negative semi-definite" (the short paper writes with positive semi-definite under its opposite sign). The transformation is then applied to the vector rather than to : for , with the initial data symmetrically extended as in §2.1.1, which turns the ODEs into a system of linear convection equations with , recovered by . The discrete Fourier transform in gives the Hamiltonian system , and the change of variables replaces by the diagonal . The paper then checks the two orderings against each other: for the heat equation the system "coincides with (2.22) since and ", so "the two treatments are equivalent due to the fact that is a Hermitian matrix", while for the convection equation and "there is no need to apply the warped phase transformation since it is already a Hamiltonian system".
Data
None found yet.
Code
None found yet.
Results
No numerics are reported for this ordering. What the paper states for it is the general gate complexity of Theorem 3.1, which is quoted on the Schrödingerisation record's cost.
- Quantum simulation of partial differential equations via Schrodingerisation: technical details
None found yet.
References
- Quantum simulation of partial differential equations via Schrodingerisation
Shi Jin, Nana Liu, Yue Yu · 2022
- Quantum simulation of partial differential equations via Schrodingerisation: technical details
Shi Jin, Nana Liu, Yue Yu · 2022
Where the routes meet
Every circle is drawn once. This step has no smaller object recorded inside it, so the strands between its two circles are the recorded ways of taking it — one strand per method.
2 recorded ways of doing Recast a non-Hermitian generator as Hamiltonian evolution. Nothing smaller is recorded inside it, so there is no object in the middle to draw.
Everything on this figure that opens is open.
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
- Every line on this figure is one a recorded source takes.
Open the cardRead the full write-up
Where you are
Path
- Solve a nonlinear ODE dy/dt = F(y)
- Solve a linear ODE du/dt = A(t)u + b(t)
- Recast a non-Hermitian generator as Hamiltonian evolution
Ways through: 2
Routes that skip it
No recorded route avoids this step.
Narrower kinds
Nothing recorded is a narrower kind of this.
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