paper

Universal Complex Quantum-Like Bits from Hermitian Weighted Graphs

arXiv:2604.23991

Abstract

We study when block-coupled regular graphs can realize prescribed complex quantum-like (QL) bit states as exact synchronized eigenstates. Two regular subgraphs and supply normalized all-ones eigenvectors and , and algebraically regular bipartite couplings reduce the full graph-supported operator exactly to a effective block on . Within this reduction we prove that two natural symmetric complexifications are not universal for state synthesis under a real-spectrum requirement: complex symmetric coupling with real diagonal regularities forces the target computational basis amplitude ratio , for , to satisfy , while real symmetric coupling with complex diagonal regularities forces . 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 (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 state-synthesis 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.

38 pages, 1 figure, 1 table. Substantially revised and expanded: rewritten introduction; added pseudo-Hermitian and exceptional-point analysis, full-spectrum isolation results, explicit finite graph-size bounds, and a worked balanced example

Universal Complex Quantum-Like Bits from Hermitian Weighted Graphs · wovepaper