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.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
method 2
citation-polarity summary
fields
quant-ph 3roles
method 2polarities
use method 2representative citing papers
An open quantum system with bosonic modes and reservoirs implements parallel stochastic matrix-vector multiplications whose computation time is independent of input dimension, with results given by stationary energy flows and a direct mapping to electrical crossbar circuits.
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.
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.
-
Thermodynamic coprocessor for linear operations with input-size-independent calculation time based on open quantum system
An open quantum system with bosonic modes and reservoirs implements parallel stochastic matrix-vector multiplications whose computation time is independent of input dimension, with results given by stationary energy flows and a direct mapping to electrical crossbar circuits.
-
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.