Non-Hermitian QC with real gate set {H, CCNOT, G} achieves P^#P power in poly time, showing complex numbers are unnecessary.
Title resolution pending
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
-
Non-Hermitian Computers Need No Complex Numbers
Non-Hermitian QC with real gate set {H, CCNOT, G} achieves P^#P power in poly time, showing complex numbers are unnecessary.