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
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
fields
quant-ph 3years
2026 3verdicts
UNVERDICTED 3roles
method 1polarities
use method 1representative citing papers
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.
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.
-
Simulation of Non-Hermitian Hamiltonians with Bivariate Quantum Signal Processing
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.
-
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.