Pith. sign in

REVIEW 4 cited by

Laplace transform based quantum eigenvalue transformation via linear combination of Hamiltonian simulation

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 2411.04010 v1 pith:NJREWJZB submitted 2024-11-06 quant-ph cs.NAmath.NA

classification quant-phcs.NAmath.NA
keywords eigenvaluetransformationsmatrixquantumtransformationclasscombinationdifferential
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Eigenvalue transformations, which include solving time-dependent differential equations as a special case, have a wide range of applications in scientific and engineering computation. While quantum algorithms for singular value transformations are well studied, eigenvalue transformations are distinct, especially for non-normal matrices. We propose an efficient quantum algorithm for performing a class of eigenvalue transformations that can be expressed as a certain type of matrix Laplace transformation. This allows us to significantly extend the recently developed linear combination of Hamiltonian simulation (LCHS) method [An, Liu, Lin, Phys. Rev. Lett. 131, 150603, 2023; An, Childs, Lin, arXiv:2312.03916] to represent a wider class of eigenvalue transformations, such as powers of the matrix inverse, $A^{-k}$, and the exponential of the matrix inverse, $e^{-A^{-1}}$. The latter can be interpreted as the solution of a mass-matrix differential equation of the form $A u'(t)=-u(t)$. We demonstrate that our eigenvalue transformation approach can solve this problem without explicitly inverting $A$, reducing the computational complexity.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

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

  1. Optimal quantum simulation of linear non-unitary dynamics

    quant-ph 2025-08 conditional novelty 8.0 of 10

    A query-optimal quantum algorithm for non-unitary linear dynamics using generalized LCHS with approximate exponential-decay kernels and exponentially convergent uniform quadrature.

  2. Circuit Depth Reduction of One-Ancilla Quantum Differential Equation Solver via Extrapolation

    quant-ph 2026-07 accept novelty 7.0 of 10

    Classical step-size extrapolation reduces the maximum single-run circuit depth of a one-ancilla quantum ODE solver from O(1/ε) to O(polylog(1/ε)) without adding ancillae.

  3. 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.

  4. Qubit-Efficient Quantum Algorithm for Linear Differential Equations

    quant-ph 2025-07 conditional novelty 5.0 of 10

    A single-ancilla postselection algorithm solves dissipative linear ODEs with first-order error bounds and locality-preserving circuit structure.

Pith tools