Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.21923

Opinion bubbles in the quantum Buridan's ass problem

Leonid Chaichenets, Jaroslav Novotný, Igor Jex, Stephen M. Barnett, Tamás Kiss

quant-phSubmitted Oct 15, 2026• Announced Oct 16, 2026• 0 citations
arXivHTMLPDF

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.

No sign of AI-generated textIncrementalStrong assumptionsUnclear noveltyPossible error

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

Related papers

SYMMETRY AND QUANTUM TRANSPORT ON NETWORKS

S. Salimi, Roya Radgohar, M. M. Soltanzadeh

We study the classical and quantum transport processes on some finite networks and model them by continuous-time random walks (CTRW) and continuous-time quantum walks (CTQW), respectively. We calculate the classical and quantum transition probabilities between two nodes of the network. We numerically show that there is a high probability to find the walker at the initial node for CTQWs on the underlying networks due to the interference phenomenon, even for long times. To get global information (independent of the starting node) about the transport efficiency, we average the return probability over all nodes of the network. We apply the decay rate and the asymptotic value of the average of the return probability to evaluate the transport efficiency. Our numerical results prove that the existence of the symmetry in the underlying networks makes quantum transport less efficient than the classical one. In addition, we find that the increasing of the symmetry of these networks decreases the efficiency of quantum transport on them.

arXiv:1104.0596•International Journal of Quantum Information•Dec 1, 2010•1 citation

From Spin States to Socially Integrated Ising Models: Proposed Applications of Graph States, Stabilizer States, Toric States to Opinion Dynamics

Yasuko Kawahata

Recent research has developed the Ising model from physics, especially statistical mechanics, and it plays an important role in quantum computing, especially quantum annealing and quantum Monte Carlo methods. The model has also been used in opinion dynamics as a powerful tool for simulating social interactions and opinion formation processes. Individual opinions and preferences correspond to spin states, and social pressure and communication dynamics are modeled through interactions between spins. Quantum computing makes it possible to efficiently simulate these interactions and analyze more complex social networks.Recent research has incorporated concepts from quantum information theory such as Graph State, Stabilizer State, and Surface Code (or Toric Code) into models of opinion dynamics. The incorporation of these concepts allows for a more detailed analysis of the process of opinion formation and the dynamics of social networks. The concepts lie at the intersection of graph theory and quantum theory, and the use of Graph State in opinion dynamics can represent the interdependence of opinions and networks of influence among individuals. It helps to represent the local stability of opinions and the mechanisms for correcting misunderstandings within a social network. It allows us to understand how individual opinions are subject to social pressures and cultural influences and how they change over time.Incorporating these quantum theory concepts into opinion dynamics allows for a deeper understanding of social interactions and opinion formation processes. Moreover, these concepts can provide new insights not only in the social sciences, but also in fields as diverse as political science, economics, marketing, and urban planning.

arXiv:2312.00862•Dec 1, 2023•0 citations

Quantum-like dynamics applied to cognition: a consideration of available options

Jan Broekaert, Irina Basieva, Paweł Błasiak +1 more

Quantum probability theory (QPT) has provided a novel, rich mathematical framework for cognitive modelling, especially for situations which appear paradoxical from classical perspectives. This work concerns the dynamical aspects of QPT, as relevant to cognitive modelling. We aspire to shed light on how the mind's driving potentials (encoded in Hamiltonian and Lindbladian operators) impact the evolution of a mental state. Some existing QPT cognitive models do employ dynamical aspects when considering how a mental state changes with time, but it is often the case that several simplifying assumptions are introduced. What kind of modelling flexibility does QPT dynamics offer without any simplifying assumptions and is it likely that such flexibility will be relevant in cognitive modelling? We consider a series of nested QPT dynamical models, constructed with a view to accommodate results from a simple, hypothetical experimental paradigm on decision-making. We consider Hamiltonians more complex than the ones which have traditionally been employed with a view to explore the putative explanatory value of this additional complexity. We then proceed to compare simple models with extensions regarding both the initial state (e.g. a mixed state with a specific orthogonal decomposition; a general mixed state) and the dynamics (by introducing Hamiltonians which destroy the separability of the initial structure and by considering an open-system extension). We illustrate the relations between these models mathematically and numerically.This article is part of the themed issue 'Second quantum revolution: foundational questions'.

Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences•Oct 2, 2017•37 citations

Quantum Buridan’s ass

Jaroslav Novotný, Goce Chadzitaskos, Igor Jex +2 more

The interplay between symmetry and dynamics is central to physics, as well as to other branches of science. An interesting situation arises in decision-making when you are offered several equally viable solutions and you are forced to select one. The ensuing delay is generally known as Buridan’s paradox. We investigate a sketch of this situation in the context of optical multi-ports and comment on the role of symmetry and how physics deals with the dilemma of many options. It is noteworthy that in its simplest form, the evolution away from its initial state is sped up by quantum interference. However, more fully connected networks can display the frustration familiar from the classical paradox. The role of symmetry breaking is analysed for several cases and implications for the paradox are discussed. Our results have implications for quantum communications networks and other distributed quantum systems.

Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences•Sep 1, 2025•1 citation

A quantum model of opinion dynamics on networks

Weiqi Chu

Classical models of opinion dynamics represent individual opinions as scalar or vector values governed by the classical probability theory, either as deterministic quantities or random variables. This framework does not account for empirically observed phenomena such as cognitive ambivalence (where an individual simultaneously holds conflicting views) and order effects (where survey responses depend on the order in which questions are asked). We propose a quantum model of opinion dynamics in which each agent's cognitive state is represented by a density matrix that encodes both the expressed opinion and cognitive ambivalence. Survey questions become non-commuting self-adjoint operators, which provides a principled explanation for order effects. Our model also identifies quantities without classical counterparts, including quantum coherence and pairwise opinion covariances. Under a product state approximation, the quantum model reduces to the classical Friedkin--Johnsen opinion model. We test the framework on synthetic and real-world networks and observe that pairwise correlations follow network-dependent transient dynamics but converge to the same steady state regardless of the network, and that quantum coherence decays exponentially at a rate independent of the network.

physics.soc-phCross-listedarXiv:2607.01452•Jul 3, 2026•1 citation

Braess paradox in a quantum network

Abhishek Banerjee, Pratapaditya Bej

Braess, while working on traffic modeling, noticed that traffic flow in a network can be worsened by adding extra edges to an existing network. This seemingly counterintuitive phenomenon is known as the Braess paradox. We consider a quantum network, where edges represent shared entangled states between spatially separated parties (nodes). The goal is to entangle two previously uncorrelated nodes using entanglement swappings. The amount of entanglement between the distant nodes is quantified by the average concurrence of the states established, as a result of the entanglement swappings. We then introduce an additional edge of maximally entangled Bell states in the network. We show that the introduction of the additional maximally entangled states to this network leads to lower concurrence between the two previously uncorrelated nodes. Thus we demonstrate the occurrence of a phenomenon in a quantum network that is analogous to the Braess paradox in traffic networks.

arXiv:2110.01877•Physical Review A•Nov 29, 2021•4 citations
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.
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,nm,nm,n and degrees dA,dBd_A,d_BdA​,dB​, with uniform internal couplings a,ba,ba,b and complete, uniform inter-subgraph coupling ccc.
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 AAA, the transfer probability is PA→B(ρ,t)=⟨ψA∣ρ∣ψA⟩sin⁡2(ωt/2)/(1+η2)P_{A\to B}(\rho,t)=\langle\psi_A|\rho|\psi_A\rangle\sin^2(\omega t/2)/(1+\eta^2)PA→B​(ρ,t)=⟨ψA​∣ρ∣ψA​⟩sin2(ωt/2)/(1+η2), where η=(dAa−dBb)/(2cmn)\eta=(d_Aa-d_Bb)/(2c\sqrt{mn})η=(dA​a−dB​b)/(2cmn​) and ω=(dAa−dBb)2+4c2mn\omega=\sqrt{(d_Aa-d_Bb)^2+4c^2mn}ω=(dA​a−dB​b)2+4c2mn​. Perfect transfer requires the uniform initial state and dAa=dBbd_Aa=d_BbdA​a=dB​b. Averaging over any unitarily invariant ensemble of initial states gives a minimum return probability 1−1/[m(1+η2)]1-1/[m(1+\eta^2)]1−1/[m(1+η2)], approaching unity as mmm grows.
For a single initial node coupled to an expanding regular graph, trapping approaches unity when its degree grows faster than n\sqrt nn​, 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.
We study the classical and quantum transport processes on some finite networks and model them by continuous-time random walks (CTRW) and continuous-time quantum walks (CTQW), respectively. We calculate the classical and quantum transition probabilities between two nodes of the network. We numerically show that there is a high probability to find the walker at the initial node for CTQWs on the underlying networks due to the interference phenomenon, even for long times. To get global information (independent of the starting node) about the transport efficiency, we average the return probability over all nodes of the network. We apply the decay rate and the asymptotic value of the average of the return probability to evaluate the transport efficiency. Our numerical results prove that the existence of the symmetry in the underlying networks makes quantum transport less efficient than the classical one. In addition, we find that the increasing of the symmetry of these networks decreases the efficiency of quantum transport on them.
Recent research has developed the Ising model from physics, especially statistical mechanics, and it plays an important role in quantum computing, especially quantum annealing and quantum Monte Carlo methods. The model has also been used in opinion dynamics as a powerful tool for simulating social interactions and opinion formation processes. Individual opinions and preferences correspond to spin states, and social pressure and communication dynamics are modeled through interactions between spins. Quantum computing makes it possible to efficiently simulate these interactions and analyze more complex social networks.Recent research has incorporated concepts from quantum information theory such as Graph State, Stabilizer State, and Surface Code (or Toric Code) into models of opinion dynamics. The incorporation of these concepts allows for a more detailed analysis of the process of opinion formation and the dynamics of social networks. The concepts lie at the intersection of graph theory and quantum theory, and the use of Graph State in opinion dynamics can represent the interdependence of opinions and networks of influence among individuals. It helps to represent the local stability of opinions and the mechanisms for correcting misunderstandings within a social network. It allows us to understand how individual opinions are subject to social pressures and cultural influences and how they change over time.Incorporating these quantum theory concepts into opinion dynamics allows for a deeper understanding of social interactions and opinion formation processes. Moreover, these concepts can provide new insights not only in the social sciences, but also in fields as diverse as political science, economics, marketing, and urban planning.
Quantum probability theory (QPT) has provided a novel, rich mathematical framework for cognitive modelling, especially for situations which appear paradoxical from classical perspectives. This work concerns the dynamical aspects of QPT, as relevant to cognitive modelling. We aspire to shed light on how the mind's driving potentials (encoded in Hamiltonian and Lindbladian operators) impact the evolution of a mental state. Some existing QPT cognitive models do employ dynamical aspects when considering how a mental state changes with time, but it is often the case that several simplifying assumptions are introduced. What kind of modelling flexibility does QPT dynamics offer without any simplifying assumptions and is it likely that such flexibility will be relevant in cognitive modelling? We consider a series of nested QPT dynamical models, constructed with a view to accommodate results from a simple, hypothetical experimental paradigm on decision-making. We consider Hamiltonians more complex than the ones which have traditionally been employed with a view to explore the putative explanatory value of this additional complexity. We then proceed to compare simple models with extensions regarding both the initial state (e.g. a mixed state with a specific orthogonal decomposition; a general mixed state) and the dynamics (by introducing Hamiltonians which destroy the separability of the initial structure and by considering an open-system extension). We illustrate the relations between these models mathematically and numerically.This article is part of the themed issue 'Second quantum revolution: foundational questions'.
The interplay between symmetry and dynamics is central to physics, as well as to other branches of science. An interesting situation arises in decision-making when you are offered several equally viable solutions and you are forced to select one. The ensuing delay is generally known as Buridan’s paradox. We investigate a sketch of this situation in the context of optical multi-ports and comment on the role of symmetry and how physics deals with the dilemma of many options. It is noteworthy that in its simplest form, the evolution away from its initial state is sped up by quantum interference. However, more fully connected networks can display the frustration familiar from the classical paradox. The role of symmetry breaking is analysed for several cases and implications for the paradox are discussed. Our results have implications for quantum communications networks and other distributed quantum systems.
Classical models of opinion dynamics represent individual opinions as scalar or vector values governed by the classical probability theory, either as deterministic quantities or random variables. This framework does not account for empirically observed phenomena such as cognitive ambivalence (where an individual simultaneously holds conflicting views) and order effects (where survey responses depend on the order in which questions are asked). We propose a quantum model of opinion dynamics in which each agent's cognitive state is represented by a density matrix that encodes both the expressed opinion and cognitive ambivalence. Survey questions become non-commuting self-adjoint operators, which provides a principled explanation for order effects. Our model also identifies quantities without classical counterparts, including quantum coherence and pairwise opinion covariances. Under a product state approximation, the quantum model reduces to the classical Friedkin--Johnsen opinion model. We test the framework on synthetic and real-world networks and observe that pairwise correlations follow network-dependent transient dynamics but converge to the same steady state regardless of the network, and that quantum coherence decays exponentially at a rate independent of the network.
Braess, while working on traffic modeling, noticed that traffic flow in a network can be worsened by adding extra edges to an existing network. This seemingly counterintuitive phenomenon is known as the Braess paradox. We consider a quantum network, where edges represent shared entangled states between spatially separated parties (nodes). The goal is to entangle two previously uncorrelated nodes using entanglement swappings. The amount of entanglement between the distant nodes is quantified by the average concurrence of the states established, as a result of the entanglement swappings. We then introduce an additional edge of maximally entangled Bell states in the network. We show that the introduction of the additional maximally entangled states to this network leads to lower concurrence between the two previously uncorrelated nodes. Thus we demonstrate the occurrence of a phenomenon in a quantum network that is analogous to the Braess paradox in traffic networks.