Universal Complex Quantum-Like Bits from Hermitian Weighted Graphs
Ethan Dickey, Sabre Kais

TL;DR
This paper explores how Hermitian weighted graphs can realize complex quantum-like bits with arbitrary states, establishing universality conditions and dense realizations in discrete graph models.
Contribution
It demonstrates that Hermitian couplings remove phase obstructions, enabling universal realization of complex qubit states in weighted graph models.
Findings
Hermitian coupling allows realization of any target state with prescribed eigenvalues.
Discrete graph models with entries in roots of unity are dense in the space of pure states.
A universality taxonomy for complex QL-bits is established based on graph structures.
Abstract
We study when block-coupled regular graphs can realize prescribed complex quantum-like 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 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 .…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
