Pith. sign in

REVIEW 10 cited by

Quantum simulation of partial differential equations via Schrodingerisation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2212.13969 v1 pith:3SVJWGMN submitted 2022-12-28 quant-ph

classification quant-ph
keywords quantumequationsdifferentialpartialsimulationstateslinearproblems
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We present a simple new way - called Schrodingerisation - to simulate general linear partial differential equations via quantum simulation. Using a simple new transform, referred to as the warped phase transformation, any linear partial differential equation can be recast into a system of Schrodinger's equations - in real time - in a straightforward way. This can be seen directly on the level of the dynamical equations without more sophisticated methods. This approach is not only applicable to PDEs for classical problems but also those for quantum problems - like the preparation of quantum ground states, Gibbs states and the simulation of quantum states in random media in the semiclassical limit.

Discussion (0). Sign in to comment.

Forward citations

Cited by 10 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Optimal Bounds, Barriers, and Extensions for Non-Hermitian Bivariate Quantum Signal Processing

    quant-ph 2026-05 unverdicted novelty 8.0 of 10

    Tight anti-Hermitian query complexity d_I = Θ(β_I T + log(1/ε)/log log(1/ε)) is established for non-Hermitian M-QSP, with impossibility of √(β_I T) fast-forwarding, new angle-finding algorithms, and extensions to time...

  2. A Provable Oracle-Free Quantum Algorithm for Nonlinear Dynamics on Hybrid Oscillator-Qubit Processors

    quant-ph 2026-07 conditional novelty 7.0 of 10

    Oracle-free hybrid qubit–qumode circuits simulate polynomial-drift nonlinear ODEs via Fokker–Planck Schrödingerisation with O(d^{L+1} n^{L+2}) gates per Trotter step from an exact bipartite Pauli factorisation.

  3. Simulation of Non-Hermitian Hamiltonians with Bivariate Quantum Signal Processing

    quant-ph 2026-05 unverdicted novelty 7.0 of 10

    Bivariate quantum signal processing simulates non-Hermitian Hamiltonians H_eff = H_R + i H_I with query-optimal complexity O((α_R + β_I)T + log(1/ε)/log log(1/ε)) in the separate-oracle model.

  4. Unconditionally successful quantum Time-Marching algorithm via LCU for nonlinear Burgers equation

    quant-ph 2026-08 conditional novelty 6.0 of 10

    A quantum lattice gas implementation of Burgers' equation is shown to run through arbitrary numbers of LCU time steps without any probabilistic failure, the first such nonlinear time-marching scheme.

  5. Quantum Eigenvalue Transformation via Linear Combination of Hamiltonian Simulation: A Weyl Calculus Approach

    quant-ph 2026-06 unverdicted novelty 6.0 of 10

    Develops Weyl-calculus-based LCHS formulas for analytic f(A) yielding O(log 1/ε) quantum eigenvalue transformation and 2.1× cheaper time-dependent ODE simulation.

  6. Simulation of Non-Hermitian Hamiltonians with Bivariate Quantum Signal Processing

    quant-ph 2026-05 reject novelty 6.0 of 10

    Claims query-optimal bivariate-QSP simulation of non-Hermitian Hamiltonians, but the constructive angle-finding chain is circular and contradicted by the paper's own benchmarks.

  7. Circuit-Efficient Randomized Quantum Simulation of Non-Unitary Dynamics with Observable-Driven and Symmetry-Aware Designs

    quant-ph 2025-09 reject novelty 5.0 of 10

    A randomized compilation of LCHS for non-unitary dynamics, with an observable-driven variant and a symmetry-aware sampler, claims reduced ancilla and circuit depth at the cost of more repetitions.

  8. Solving Einstein Field Equations on a Digital Quantum Computer

    gr-qc 2026-06 unverdicted novelty 4.0 of 10

    A quantum algorithm for evolving Schwarzschild spacetime in the WEBB NR formalism is implemented in Qiskit and tested on simulators and IBM quantum computers.

  9. Logical Resource Estimation for Quantum State Preparation with Compilation

    quant-ph 2026-05 unverdicted novelty 4.0 of 10

    Sampling-based methods for quantum state preparation achieve asymptotically lower T-count than rotation-based methods and maintain an advantage in total gate count after accounting for compilation overhead.

  10. A Quantum Path to Partial Differential Equations

    quant-ph 2026-07 accept novelty 3.5 of 10

    Lecture notes that organize quantum PDE algorithms around block encodings of finite-difference and finite-element operators, tracking discretization, preparation, normalization, postselection, and measurement costs.

Pith tools