REVIEW 15 cited by
Optimal quantum simulation of linear non-unitary dynamics
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
Optimal quantum simulation of linear non-unitary dynamics
read the original abstract
We present a quantum algorithm for simulating the time evolution generated by any bounded, time-dependent operator $-A$ with non-positive logarithmic norm, thereby serving as a natural generalization of the Hamiltonian simulation problem. Our method generalizes the recent Linear-Combination-of-Hamiltonian-Simulation (LCHS) framework. In instances where $A$ is time-independent, we provide a block-encoding of the evolution operator $e^{-At}$ with $\mathcal{O}\big(t\log\frac{1}{\epsilon})$ queries to the block-encoding oracle for $A$. We also show how the normalized evolved state can be prepared with $\mathcal{O}(1/\|e^{-At}|{\vec{u}_0}\rangle\|)$ queries to the oracle that prepares the normalized initial state $|{\vec{u}_0}\rangle$. These complexities are optimal in all parameters and improve the error scaling over prior results. Furthermore, we show that any improvement of our approach exceeding a constant factor of approximately 3 is infeasible. For general time-dependent operators $A$, we also prove that a uniform trapezoidal rule on our LCHS construction yields exponential convergence, leading to simplified quantum circuits with improved gate complexity compared to prior nonuniform-quadrature methods.
Forward citations
Cited by 15 Pith papers
-
Efficient quantum algorithm for linear matrix differential equations and applications to open quantum systems
Develops a quantum algorithm for linear matrix differential equations with query complexity O~(ν L t / ε) that is nearly optimal and yields polynomial to exponential speedups for open quantum system simulation.
-
Improved sample complexity bound for sample-based Lindbladian simulation
Derives explicit sample complexity bound O(d t²/ε) for WML-based Lindbladian simulation, with typical-case O(t²/ε) when ||L||_∞² = O(1/d) and worst-case Ω(d t²/ε).
-
Quantum algorithm for solving high-dimensional linear stochastic differential equations via amplitude encoding of the noise term
Quantum algorithms achieve polylog(N) complexity for high-dimensional linear SDEs by amplitude-encoding the solution and noise via Dyson series or Euler-Maruyama approximations plus quantum linear systems solvers.
-
Theory of Quantum Imaginary-Time Mpemba Effect
A necessary and sufficient condition for the quantum imaginary-time Mpemba effect is that it depends only on the population ratios of excited states to the ground state.
-
A Unified Poisson Summation Framework for Generalized Quantum Matrix Transformations
A dual Fourier-PSF and contour-PSF framework resolves the smoothness-sparsity trade-off for efficient quantum simulation of singular and holomorphic matrix functions.
-
Quantum Eigenvalue Transformation via Linear Combination of Hamiltonian Simulation: A Weyl Calculus Approach
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.
-
Linear Combination of Hamiltonian Simulation with Commutator Scaling
Using multi-product formulas in LCHS produces commutator-sensitive error bounds and better quadrature scaling than norm-based analyses for dissipative dynamics.
-
Quantum algorithms for stochastic nonlinear differential equations
Quantum algorithm for N-dimensional stochastic nonlinear differential equations with quadratic drift and dissipation approximates low-order correlation expectations at polylog(N) cost under norm-preserving drift conditions.
-
Structure-Preserving Quantum Method of Lines for Evolutionary PDEs with Mixed Boundary Conditions
Presents structure-preserving quantum method-of-lines algorithms for parabolic and hyperbolic PDEs with mixed BCs, using Coons interpolation, similarity transforms, and explicit quantum circuit constructions with comp...
-
Quantum Implicit-Explicit Schemes for Multiscale Ordinary and Partial Differential Equations via Schr\"odingerization
A quantum IMEX scheme via Schrödingerization for multiscale ODEs and PDEs achieves ε-independent discretization and requires only an extra logarithmic factor in auxiliary register size versus prior HHL-type quantum AP...
-
Quantum circuits for the advection-diffusion equation with boundary conditions based on LCHS
Quantum circuit framework for advection-diffusion PDEs with Robin and periodic boundary conditions via LCHS, including LCU error analysis and gate complexity showing potential quantum advantage in high dimensions.
-
Quantum Eigenvalue Transformations for Arbitrary Matrices
n-regular block encodings let QSP apply degree-n polynomials directly to the eigenvalues of any square matrix, with an efficient conversion from standard block encodings.
-
Quantum Simulation of Non-Unitary Dynamics via Amplitude-Phase Separation
Introduces Amplitude-Phase Separation (APS) decomposition for quantum simulation of non-unitary dynamics, with complementary error scaling advantages in time-independent cases and unification of prior methods like LCH...
-
Quantum Simulation of Non-Hermitian Special Functions and Dynamics via Contour-based Matrix Decomposition
CBMD decomposes non-Hermitian operators via contour residues to enable optimal-query quantum simulation of first-order dynamics and special functions such as Bessel and Airy evolutions without requiring diagonalizability.
-
From Meta Idea to Advanced Mathematical Discovery -- Human-AI Co-Discovery of Sign-Embedding Quantum Algorithms
Human-AI collaboration expanded a meta-idea on rational approximation into sign-embedding quantum algorithms for matrix problems, with humans retaining final judgment on routes and refinements.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.