arXiv:2610.21923
Opinion bubbles in the quantum Buridan's ass problem
Leonid Chaichenets, Jaroslav Novotný, Igor Jex, Stephen M. Barnett, Tamás Kiss
Abstract
The quantum Buridan's ass problem concerns a network of interconnected nodes in which transitions between the nodes are governed by the laws of quantum mechanics. In such situations interference between probability amplitudes plays a key role in determining whether the probability of leaving the initial node is large or small and also the speed at which the associated transitions occur. In this paper we extend this idea to consider transitions between one given set of coupled nodes and the remainder of the network. We have in mind a quantum analogy to changing an opinion, in which the initially occupied set of nodes is one opinion bubble, with the remaining parts of the network corresponding to a different opinion. We find that quantum interference again plays a crucial role in the dynamics. A further key component is the role of symmetry between the nodes and their interconnections, as it is symmetry that lies at the heart of the Buridan's ass puzzle. In the classical Buridan's ass paradox it is symmetry between competing alternatives that freezes the ass into indecision. In the quantum case, however, interference results in a far richer dynamics.
AI Summary
The paper studies when a single quantum excitation can transfer between two groups of network nodes, framed as an analogy to transitions between “opinion bubbles.” The model is a continuous-time quantum walk on two regular subgraphs of sizes $m,n$ and degrees $d_A,d_B$, with uniform internal couplings $a,b$ and complete, uniform inter-subgraph coupling $c$. An explicit spectral decomposition separates states confined to each subgraph from a two-dimensional transport sector spanned by their uniform superpositions. For an initial density matrix $\rho$ supported in $A$, the transfer probability is $P_{A\to B}(\rho,t)=\langle\psi_A|\rho|\psi_A\rangle\sin^2(\omega t/2)/(1+\eta^2)$, where $\eta=(d_Aa-d_Bb)/(2c\sqrt{mn})$ and $\omega=\sqrt{(d_Aa-d_Bb)^2+4c^2mn}$. Perfect transfer requires the uniform initial state and $d_Aa=d_Bb$. Averaging over any unitarily invariant ensemble of initial states gives a minimum return probability $1-1/[m(1+\eta^2)]$, approaching unity as $m$ grows. For a single initial node coupled to an expanding regular graph, trapping approaches unity when its degree grows faster than $\sqrt n$, and vanishes when it grows more slowly. Further analysis treats node-level depletion in cliques and generalizes the coupling to a rank-one interaction between selected eigenmodes of arbitrary subgraphs. The treatment is restricted to single-excitation, coherent dynamics and specially structured couplings. Multiple coupled subgraphs and multi-excitation dynamics are left beyond the analysis; the opinion interpretation is an analogy rather than a tested model of decision-making.
Error found: Equation generalized_dependence incorrectly gives the balanced-mode oscillation frequency as sqrt(4 c_tilde^2 - (b-a)^2), whereas the stated Hermitian Hamiltonian gives sqrt(4 c_tilde^2 + (b-a)^2). Equation complete_depletion confuses amplitude with probability: the valid nodal return-probability lower bound is (1-2/m)^2 for m >= 2, not 1-2/m, although the exclusion of complete depletion for m >= 3 remains valid. The single-node numerical example with n=9 and d_B=9 uses an impossible graph degree and produces incorrect advertised values; changing the degree to eight fixes both problems.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 18 pages, 8 figures