English

Universal Complex Quantum-Like Bits from Hermitian Weighted Graphs

Quantum Physics 2026-04-28 v1

Abstract

We study when block-coupled regular graphs can realize prescribed complex quantum-like bit states as exact synchronized eigenstates. Two regular subgraphs GAG_A and GBG_B supply normalized all-ones eigenvectors VAV_A and VBV_B, and algebraically regular bipartite couplings reduce the full graph-supported operator exactly to a 2×22\times 2 effective block on S=span{0,1}\mathcal S=\operatorname{span} \{ \lvert 0\rangle, \lvert 1\rangle \}. Within this reduction we prove that two natural symmetric complexifications are not universal under a real-spectrum requirement: complex symmetric coupling with real diagonal regularities forces the target computational basis amplitude ratio r=ω2/ω1r=\omega_2/\omega_1, for ψ=ω10+ω21\lvert \psi\rangle = \omega_1\lvert 0\rangle + \omega_2\lvert 1\rangle, to satisfy r2Rr^2\in\mathbb{R}, while real symmetric coupling with complex diagonal regularities forces r+1/rRr+1/r\in\mathbb{R}. Replacing complex symmetry by Hermitian coupling removes this phase obstruction. For any nonbasis target state, any prescribed real eigenvalue, and any prescribed nonzero signed spectral gap, a Hermitian weighted coupling realizes the target exactly. Additionally, an independently tuned directed-coupling model gives a second universality mechanism. We then pass from continuous effective parameters to finite weighted graphs with entries in {0,±1,±i}\{0, \pm1, \pm i\} (the fourth roots of unity and zero), characterize the balanced discrete coupling lattice by perfect matchings, and show that exact discrete Hermitian realizations are dense in the synchronized pure-state space. These results give a universality taxonomy for complex QL-bits and identify Hermitian conjugate pairing as the robust structural mechanism that supports arbitrary complex amplitudes with real two-level spectra.

Keywords

Cite

@article{arxiv.2604.23991,
  title  = {Universal Complex Quantum-Like Bits from Hermitian Weighted Graphs},
  author = {Ethan Dickey and Sabre Kais},
  journal= {arXiv preprint arXiv:2604.23991},
  year   = {2026}
}
R2 v1 2026-07-01T12:36:16.766Z