MethodLayer 2
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.
The generator with no Hermiticity assumed, the interval , and an error tolerance .
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.
Same contract as the slot it fills.
This one, drawn
From Linear ODE system to Hamiltonian surrogate, with the map back
A circle is an object you are holding. This method is drawn heavier, opened into its own steps; the other lines between the same two ends are the alternatives recorded for the same slot. Circles are named on hover, and each one is a link.
Nothing drawn here has a recorded way through it that this figure leaves shut. See it on the map
What it fills
- Recast a non-Hermitian generator as Hamiltonian evolution
Given a generator whose evolution is not unitary, produce a Hermitian generator — or a quadrature-indexed family of them — on a space at least as large, whose unitary evolution reproduces the original dynamics, together with the map that recovers the original solution. Both halves are required: a construction that reaches a Hamiltonian and cannot get back is not a route.
When it applies
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.
Requires
Every step this method names moves its route along, so there is nothing it needs alongside them.
Example
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* > 0Cost, as the source states it
Jin, 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.
Implementations
Fourier spectral discretisation of the phase space heat equation
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.
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".
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.
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.
Finite difference and upwind discretisation of the phase space heat equation
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.
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 .
The same settings as the spectral run; the paper says so rather than restating the numbers.
"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.
Applied after spatial discretisation, to the ODE system
- Quantum simulation of partial differential equations via Schrodingerisation: technical details
- Quantum simulation of partial differential equations via Schrodingerisation
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 .
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".
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.
What it needs
Nothing below this — it bottoms out here.
Other ways to fill the same slot
Different approaches
- Kernel-weighted combination of unitary propagators
Split into its Hermitian and anti-Hermitian parts, , and write the non-unitary propagator as a kernel-weighted integral over the unitary propagators generated by the one-parameter family . Every member of that family is Hermitian by construction, so each is an ordinary Hamiltonian simulation problem and the combination is an LCU over them.
In the Atlas
No record in the Atlas covers this yet. The catalogue is circuits and primitives; this part of the literature is not in it.