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.
Lindblad, On the generators of quantum dynamical semigroups, Communications in mathematical physics48, 119 (1976)
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 3roles
background 1polarities
background 1representative citing papers
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.
A dynamical decoupling protocol enables fast high-fidelity gates on a central qubit coupled to targets, demonstrated via IBMQ simulation and adapted for 15NV centers in diamond.
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
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.
-
Quantum Gates via Dynamical Decoupling of Central Qubit on IBMQ and 15NV Center in Diamond
A dynamical decoupling protocol enables fast high-fidelity gates on a central qubit coupled to targets, demonstrated via IBMQ simulation and adapted for 15NV centers in diamond.