⚛️ quantum physics

Construction and Rigorous Analysis of Quantum-Like States

This paper provides a rigorous mathematical framework for constructing arbitrary single-qubit states using the eigenvectors of symmetric and asymmetric bipartite networks, demonstrating that quantum-like behavior emerges from specific graph structures rather than requiring complex synchronization.

Original authors: Ethan Dickey, Abhijeet Vyas, Sabre Kais

Published 2026-01-28

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Ethan Dickey, Abhijeet Vyas, Sabre Kais

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

The Big Idea: Turning a Crowd into a Quantum Bit

Imagine you have a huge crowd of people (a network) walking around. Usually, if they are just walking randomly, they are chaotic. But if you set up the right rules, this crowd can "sync up" and move in perfect rhythm, like a school of fish or a bridge swaying with pedestrians.

This paper asks a fascinating question: Can we use these synchronized crowds to act like quantum computers?

Specifically, the authors want to build a "Quantum-Like Bit" (or QL-bit). In a normal computer, a bit is either a 0 or a 1. In a quantum computer, a bit can be a mix of both at the same time (a superposition). The paper proves that you can create these specific "mixes" just by arranging the connections between groups of people (or nodes in a graph) in very specific ways.

The Setup: Two Groups and a Bridge

To build one of these QL-bits, the authors use a simple structure:

Two Teams (Subgraphs): Imagine two separate groups of people, Team A and Team B. Inside each team, everyone is connected to the same number of friends. This is called being "regular."
The Bridge (Connection): There is a bridge connecting Team A to Team B.

The "state" of the system (whether it acts like a 0, a 1, or a mix) depends on how the two teams are connected and how many friends they have.

The Magic Trick: Tuning the Connection

The paper shows two main ways to "tune" this system to get any specific mix of 0s and 1s you want.

Method 1: The "Uneven Teams" Trick (Symmetric Coupling)

Imagine Team A and Team B are identical in size, but you change how "popular" they are.

If Team A has 20 friends per person and Team B has 20 friends, the system is perfectly balanced (a 50/50 mix).
If you make Team A slightly more popular (say, 25 friends) and Team B slightly less (say, 20 friends), the balance shifts. The system leans more toward Team A.

The Catch: The paper proves that if you want a perfectly balanced mix (50/50) using this method, you have to make the difference in popularity infinite. That's impossible in the real world. It's like trying to balance a scale by adding an infinite amount of weight to one side.

Method 2: The "One-Way Street" Trick (Asymmetric Coupling)

To fix the problem above, the authors suggest changing the bridge. Instead of a two-way street where people walk back and forth equally, make it a one-way street.

Imagine people can walk from Team A to Team B easily, but it's harder to walk from B to A.
By adjusting how easy it is to cross in each direction, you can create any mix of 0s and 1s, including the perfect 50/50 balance, without needing infinite numbers.

The Analogy: Think of it like a water pipe. If you want a specific mix of hot and cold water, you can either change the temperature of the source (Method 1), or you can use a valve to control how much hot water flows versus cold water (Method 2). The second method gives you much finer control.

Why Does This Matter? (The "Spectral Gap")

You might wonder, "Why do we care about these specific connections?"

The paper explains that these networks have a special property called a Spectral Gap. Imagine a choir singing. Usually, everyone sings a little differently, creating a muddy sound. But in these specific networks, there is one "lead singer" (the main pattern) that is so loud and clear that it stands out completely from the background noise.

This "lead singer" is the QL-bit. Because it is so distinct from the noise, the system is very stable. Even if you remove some people from the crowd or break some connections, the "lead singer" stays in tune. This stability is what makes the system useful for computation.

The Surprising Discovery: No "Quantum" Needed

The most surprising part of the paper is that you don't actually need quantum physics to do this.

The authors prove that you don't need complex quantum mechanics, entanglement, or weird quantum particles. You just need:

A network of connections (a graph).
The connections to be roughly equal in number (regular).
The weights of the connections to be simple (like 1 or -1).

If you arrange a simple network of classical things (like computers, people, or oscillators) this way, the math naturally produces results that look exactly like quantum states. It's as if the structure of the network itself creates "quantum-like" behavior out of classical rules.

Summary of the Paper's Claims

Construction: You can build a "Quantum-Like Bit" by connecting two regular groups of nodes with a specific type of bridge.
Control: You can create any desired mix of states (any combination of 0 and 1) by either:
1. Making the two groups slightly different in size/popularity (but this fails for perfect balance).
2. Making the connection between them one-way and adjusting the flow (this works for everything).
Stability: These states are robust because of a "spectral gap," meaning the main pattern is protected from noise and errors.
Simplicity: This doesn't require real quantum mechanics; it arises naturally from the geometry of the network connections.
Randomness: The authors also show that even if the network is somewhat random (like a social network), as long as it's dense enough, these "quantum-like" states still appear.

In short, the paper provides a mathematical blueprint for building stable, quantum-like information storage using simple, classical networks, proving that the "magic" of quantum states can emerge from the simple geometry of connections.

Technical Summary: Construction and Rigorous Analysis of Quantum-Like States

Problem Statement
Recent observations suggest that complex synchronized networks can exhibit emergent quantum-like (QL) behaviors, where interacting subnetworks produce coherent states analogous to quantum superposition. While previous works (e.g., Scholes et al.) demonstrated these phenomena and provided mappings between graph eigenstates and quantum product bases, they often relied on intuitive constructions, ensemble averages, or operations that are computationally expensive (such as Cartesian graph products). There is a lack of mathematically rigorous methods to explicitly construct arbitrary single QL-bit states ( $|\psi\rangle = a|0\rangle + b|1\rangle$ ) using only the structural properties of the underlying graphs, specifically without requiring real-valued edge weights or large ensembles.

Methodology
The authors model a single QL-bit as a composite graph $G_R$ constructed from two disjoint regular subgraphs, $G_A$ and $G_B$ , with adjacency matrices $A$ and $B$ , coupled by a bipartite connection matrix $C$ . The analysis relies on spectral graph theory, specifically the properties of the top eigenvalues and their associated eigenvectors (Perron-Frobenius vectors) of regular graphs.

The paper rigorously analyzes two primary construction methods to tune the resulting emergent eigenvector into an arbitrary state:

Symmetric Coupling with Detuning: The subgraphs $G_A$ and $G_B$ are coupled via an undirected, $l$ -regular bipartite graph. The state is tuned by varying the regularities $k_A$ and $k_B$ of the subgraphs relative to the connection regularity $l$ .
Asymmetric (Directed) Coupling: The bipartite connection is allowed to be directed, represented by two distinct matrices $C_A$ and $C_B$ with regularities $l_A$ and $l_B$ . This method allows for tuning the state by adjusting the ratio of these directed regularities while keeping the subgraph regularities equal ( $k_A = k_B$ ).

The authors define tuning parameters $\Delta$ (for symmetric) and $\Delta_C$ (for asymmetric) to relate the graph structural parameters to the amplitudes $a$ and $b$ of the target state. They also introduce "switching lemmas" involving the inverses $\Delta^{-1}$ and $\Delta_C^{-1}$ to handle cases where the primary parameters diverge (specifically when $|a| \to |b|$ ).

Key Contributions and Results

Rigorous Proof of Equal Superposition: The paper proves that a symmetric construction (where $G_A$ and $G_B$ are $k$ -regular and coupled by an $l$ -regular bipartite graph with negative edge weights) yields an equal superposition of Hadamard basis states $|+\rangle$ and $|-\rangle$ . The eigenvectors are explicitly shown to be $V_R^{\pm} = \frac{1}{\sqrt{2}}(V_A \pm V_B)$ with eigenvalues $k \pm l$ .
Arbitrary State Construction via Detuning (Symmetric): The authors prove that by detuning the subgraph regularities ( $k_A \neq k_B$ ), one can construct an arbitrary state $|\psi\rangle = a|+\rangle + b|-\rangle$ . The condition for this is $\Delta = \frac{k_A - k_B}{2l} = \frac{2ab}{b^2 - a^2}$ . They demonstrate that while this covers most states, it requires unbounded differences in regularity as $|a| \to |b|$ , necessitating the use of $\Delta^{-1}$ and specific switching conditions to cover the full state space.
Arbitrary State Construction via Asymmetric Coupling: The paper proves that allowing directed connections ( $C_A \neq C_B^T$ ) with regularities $l_A$ and $l_B$ allows for the construction of any arbitrary state without requiring unbounded regularity differences, provided $k_A = k_B$ . The tuning condition is $\Delta_C = \frac{l_A}{l_B} = \frac{(a+b)^2}{(a-b)^2}$ . This method avoids the divergence issues inherent in the purely symmetric detuning approach.
Constraints and Feasibility: The authors analyze the constraints imposed by requiring integer regularities and simple graphs (no self-loops or multi-edges). They show that the achievable states are dense in the continuous space as the graph size $n$ increases, as the rational approximations of the tuning parameters improve.
Random Walk Interpretation: The paper establishes a connection between the QL-bit states and the stationary distributions of classical random walks on the composite graph. It shows that while the quantum amplitudes depend on the relative ratios of regularities ( $\Delta$ or $\Delta_C$ ), the global scaling of the degrees affects the stationary probability distribution, offering a degree of freedom to optimize spectral gaps or robustness without altering the target state.
Extension to Multi-Qubit Systems: The authors propose a framework for extending these constructions to two QL-bits by connecting two independent QL-bit graphs via cross-connection matrices. They outline how this block structure can generate the four basis states of a two-qubit system ( $|++\rangle, |+-\rangle, |-+\rangle, |--\rangle$ ) and suggest a path toward arbitrary two-qubit states.

Significance and Claims
The paper claims to be the first to provide mathematically rigorous, explicit construction methods for arbitrary single QL-bit states using only graph structural manipulations (regularities and connection directionality) without relying on real-valued edge weights or Cartesian graph products.

The authors emphasize that their results rely solely on the structure of the graph embedded in the adjacency matrix; thus, the physical phenomenon of synchronization is not strictly necessary for the mathematical existence of these states, though it provides the physical motivation. The work bridges the gap between classical network theory and quantum-like information processing by demonstrating that "quantum-like" superpositions can emerge from the spectral properties of classical, regular, and nearly-regular graphs.

The paper concludes by noting that while the current construction scales well for single bits, extending these techniques to multi-bit systems and unitary transformations (gates) remains an open area for future rigorous study. It also suggests that these findings could offer a classical perspective on how complex synchronized networks in nature (e.g., biological systems) might perform computation.