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.
Cost per iteration:O(d·N 1N2) =O((d R +d I)·d R ·d I), the same as one pass of the recursive algorithm
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
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.