Introduction
This post is a comprehensive Chinese-language review of Gregory D. Scholes' (Princeton University, Department of Chemistry) 2024 preprint *Quantum-like states on complex synchronized networks* (arXiv:2405.07950v1 [physics.soc-ph], May 2024). The central thesis: quantum-like probability laws—including interference effects—need not be exclusive to the microscopic world. Classical complex networks can host robust emergent states capable of quantum-like information processing.
Key points
- Motivation: Quantum states are famously fragile (decoherence), but Scholes asks whether quantum-*like* magic—interference, entanglement-style correlations—can survive robustly within classical systems.
- Graph foundations: The construction uses k-regular random graphs, where every vertex has exactly k edges. Their adjacency-matrix eigenvalue spectra matter: the largest eigenvalue is always k, and the second eigenvalue λ₁ governs expansion. Via the bound
- Robustness: Numerically, a k=20, n=40 graph retains its isolated largest eigenvalue even after ~300 of 400 edges are randomly deleted—robustness rooted in emergence, where coherent collective effects stand out from random background. Signed graphs (positive/negative edges) add flexibility: positive-dominant networks yield emergent states at the top of the spectrum; negative-dominant ones at the bottom.
- Five axioms for quantum-like (QL) states: 1. The graph must exhibit distinguishable emergent states in its spectrum. 2. States must be robust to construction imprecision and node-frequency disorder. 3. Qubits are two-state systems requiring network activation (unlike quantum vacua). 4. Unitary operations must be definable on graphs and subgraphs. 5. A coupling construction must produce state spaces isomorphic to tensor products of qubit Hilbert spaces.
- Building qubits: A messy k-regular random graph is partitioned into subgraphs G_a1 and G_a2, with a tensor-sum structure A = A_a1 ⊕ A_a2, plus sparse probabilistic inter-subgraph edges. With positive internal edges and negative linking edges, the emergent eigenstates become √(1/2)(a₁ − a₂) and √(1/2)(a₁ + a₂)—classical superpositions.
- Entanglement and Bell states: Coupled qubits follow a Hamiltonian
- Contextual probability (Växjö model): Following Khrennikov, probabilities are context-dependent:
- Superdense coding: Using a Bell state |Ψ⁻⟩ = (1/√2)(|a₁⟩|b₂⟩ − |a₂⟩|b₁⟩), two classical bits can be transmitted via one qubit by applying identity / NOT / phase-flip / combined operations—physically realized by flipping phases of subgraph or coupling edges in the network, not abstract matrix gates. The architecture also suits quantum sensing and pattern recognition for neuromorphic computing.
- Neural hypothesis: Brain oscillations (delta through gamma bands, 50–80 Hz gamma synchronization in visual processing, long-range beta synchrony) suggest that the brain's densely connected 'hairball' networks could synchronize and host emergent states satisfying the QL axioms—bypassing the decoherence objection to quantum biology, since these states are classical at heart. Notably, any expander graph works; biological 'messiness' is an advantage, not a flaw.
- Open questions:
small λ₁ implies large isoperimetric constant h(G)—i.e., good expander graphs, ideal substrates for emergent states.
with σ = ±1 for in-phase/out-of-phase coupling. Controlling edge signs via a phase map yields all four Bell states, with spectroscopic evidence in the paper's Fig. 5. N coupled qubits populate the single-excitation subspace, isomorphic to tensor-product spaces.
where δ is the interference term. This explains the question order effect in psychology surveys: the first measurement changes the context and thus subsequent probabilities.
Conclusion
The core insight is an emergent protection mechanism: coherent interactions across many components produce a spectrally isolated eigenvalue—an energy gap—that shields the quantum-like state from noise. The review highlights how this reframes the field: instead of asking how fragile quantum effects survive in warm, wet biology, we ask what quantum-like functions complex classical systems can exhibit. If validated, quantum computing hardware could be dramatically simplified into a classical–quantum hybrid regime. The review draws on expander graph theory (Hoory, Linial, Wigderson, 2006) and Khrennikov's Växjö contextual probability model alongside the primary Scholes preprint.
References
1. Gregory D. Scholes. *Quantum-like states on complex synchronized networks*. arXiv:2405.07950v1 [physics.soc-ph], 2024. 2. Andrei Khrennikov. *Contextual Probability and Quantum-like Modeling*. The Växjö Model, 2020. 3. Shlomo Hoory, Nathan Linial, Avi Wigderson. *Expander Graphs and Their Applications*. Bull. Amer. Math. Soc., 2006.