Universal Complex Quantum-Like Bits from Hermitian Weighted Graphs
Abstract
We study when block-coupled regular graphs can realize prescribed complex quantum-like bit states as exact synchronized eigenstates. Two regular subgraphs GA and GB supply normalized all-ones eigenvectors VA and VB, and algebraically regular bipartite couplings reduce the full graph-supported operator exactly to a 2× 2 effective block on S=span \ 0, 1 \. 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/ω1, for = ω1 0 + ω2 1, to satisfy r2∈R, while real symmetric coupling with complex diagonal regularities forces r+1/r∈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\ (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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.