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.
The warm-start basin guarantee (Theorem 10) requires a full-rank Jacobian, and the analytical basin radius de- cays polynomially with degree asρ analytical ∼d −4.62 (Eq
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.