English

Simulation of Non-Hermitian Hamiltonians with Bivariate Quantum Signal Processing

Quantum Physics 2026-05-13 v1 Computational Complexity Data Structures and Algorithms

Abstract

We achieve query-optimal quantum simulations of non-Hermitian Hamiltonians Heff=HR+iHIH_{\mathrm{eff}} = H_R + iH_I, where HRH_R is Hermitian and HI0H_I \succeq 0, using a bivariate extension of quantum signal processing (QSP) with non-commuting signal operators. The algorithm encodes the interaction-picture Dyson series as a polynomial on the bitorus, implemented through a structured multivariable QSP (M-QSP) circuit. A constant-ratio condition guarantees scalar angle-finding for M-QSP circuits with arbitrary non-commuting signal operators. A degree-preserving sum-of-squares spectral factorization permits scalar complementary polynomials in two variables. Angles are deterministically calculated in a classical precomputation step, running in O(dRdI)\mathcal{O}(d_R \cdot d_I) classical operations. Operator norms αR,βI\alpha_R\,,\beta_I contribute additively with query complexity O((αR+βI)T+log(1/ε)/loglog(1/ε))\mathcal{O}((\alpha_R + \beta_I)T + \log(1/\varepsilon)/\log\log(1/\varepsilon)) matching an information-theoretic lower bound in the separate-oracle model, where HRH_R and HIH_I are accessed through independent block encodings. The postselection success probability is e2βITeiHeffTψ02(1O(ε))e^{-2\beta_I T}\|e^{-iH_{\mathrm{eff}}T}|\psi_0\rangle\|^2\cdot (1 - \mathcal{O}(\varepsilon)), decomposing into a state-dependent factor eiHeffTψ02\|e^{-iH_{\mathrm{eff}}T}|\psi_0\rangle\|^2 from the intrinsic barrier and an e2βITe^{-2\beta_I T} overhead from polynomial block-encoding.

Keywords

Cite

@article{arxiv.2605.12450,
  title  = {Simulation of Non-Hermitian Hamiltonians with Bivariate Quantum Signal Processing},
  author = {Joshua M. Courtney},
  journal= {arXiv preprint arXiv:2605.12450},
  year   = {2026}
}

Comments

64 pages, 3 figures, 4 tables

R2 v1 2026-07-22T07:08:15.564Z