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-dependent cases.
Quantum simulation of partial differential equa- tions via schrodingerisation
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
years
2026 5roles
method 1polarities
use method 1representative citing papers
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.
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.
A quantum algorithm for evolving Schwarzschild spacetime in the WEBB NR formalism is implemented in Qiskit and tested on simulators and IBM quantum computers.
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.
citing papers explorer
-
Optimal Bounds, Barriers, and Extensions for Non-Hermitian Bivariate Quantum Signal Processing
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-dependent cases.
-
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.
-
Simulation of Non-Hermitian Hamiltonians with Bivariate Quantum Signal Processing
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.
-
Solving Einstein Field Equations on a Digital Quantum Computer
A quantum algorithm for evolving Schwarzschild spacetime in the WEBB NR formalism is implemented in Qiskit and tested on simulators and IBM quantum computers.
-
Logical Resource Estimation for Quantum State Preparation with Compilation
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.