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:2210.10551 · IEEE International Symposium on Network Computing and Applications (NCA)

Distributed Coordination Based on Quantum Entanglement (Work in Progress)

Yotam Ashkenazi, Shlomi Dolev

Published Dec 14, 2022• 5 citations
arXivHTMLPDF

Abstract

This paper demonstrates and proves that the coordination of actions in a distributed swarm can be enhanced by using quantum entanglement. In particular, we focus on• Global and local simultaneous random walks, using entangled qubits that collapse into the same (or opposite) direction, either random direction or totally controlled simultaneous movements.• Identifying eavesdropping from malicious eavesdroppers aimed at disturbing the simultaneous random walks by using entangled qubits that were sent at random or with predefined bases.

DOI
10.1109/nca57778.2022.10013538

Related papers

Optimal eavesdropping in quantum cryptography. I. Information bound and optimal strategy

Christopher A. Fuchs, Nicolas Gisin, Robert B. Griffiths +2 more

We consider the Bennett-Brassard cryptographic scheme, which uses two conjugate quantum bases. An eavesdropper who attempts to obtain information on qubits sent in one of the bases causes a disturbance to qubits sent in the other basis. We derive an upper bound to the accessible information in one basis, for a given error rate in the conjugate basis. Independently fixing the error rates in the conjugate bases, we show that both bounds can be attained simultaneously by an optimal eavesdropping probe. The probe interaction and its subsequent measurement are described explicitly. These results are combined to give an expression for the optimal information an eavesdropper can obtain for a given average disturbance when her interaction and measurements are performed signal by signal. Finally, the relation between quantum cryptography and violations of Bell's inequalities is discussed.

arXiv:quant-ph/9701039•Physical Review A•Aug 1, 1997•495 citations

Entangled swarm intelligence: Quantum computation for swarm robotics

Vladimir G. Ivancevic

A new paradigm of an entangled swarm intelligence is proposed. It is an abstract quantumcomputational model for a super-fast, high-dimensional, parallel and fault tolerant swarm intelligence. In other words, it is a deep convolutional neural network that is fully entangled (i.e., all processing units, or ‘multineurons’, or robots are inseparably interconnected as a single intelligent entity). It isformally defined as a tensor product of a large number of Hilbert spaces, all forming a very large matrix with elements representing individual n-qubit multineurons. This abstract quantum brain model is targeting quantum silicon chips with many millions of qubits, which will certainly be available in the near future.

Journal | MESA•Aug 28, 2016•7 citations

Quantum-Inspired Random Walk Algorithms for Global Optimization

Jincheng Zhang

This paper investigates the application of quantum-inspired concepts to enhance the performance of random walk algorithms, specifically within the domain of global optimization. Classical random walk algorithms frequently struggle with convergence issues, frequently becoming trapped within local optima, a significant limitation when dealing with complex, high-dimensional search spaces. This research proposes a novel approach where random walk behavior is modeled based on principles derived from quantum mechanics, incorporating superposition and interference effects to facilitate more extensive and efficient exploration of the solution landscape. The core idea is to replace the deterministic step size in traditional random walks with a probabilistic movement governed by a quantum-like probability distribution. We explore the mathematical formulation of this process, detailing the probabilities of transition between states and the impact of interference. The resulting algorithms demonstrate improved convergence rates and a reduced tendency to get stuck in local optima compared to standard random walk methods. The paper concludes by outlining potential future research directions, including adaptive parameter tuning and integration with other optimization techniques.

•Aug 28, 2026•0 citations

How Quantum Entanglement Helps to Coordinate Non-Communicating Players

G.V. Klimovitch

We consider a coalitional game with the same payoff for all players. To maximize the payoff, the players need to use one collective strategy, if all players are in certain states, and the other strategy otherwise. The current state of each player changes according to external conditions and is not known to the other players. In one example of such a game, quantum entanglement between players results in the optimal payoff thrice the maximal payoff for unentangled players.

arXiv:quant-ph/0405093•May 17, 2004•3 citations

Rapid Mixing of Parallel Kac's Walk: From Spheres to Stiefel Manifolds

Qian Chen, Minglong Qin, Fang Song +2 more

Kac's walk is a classical local random walk whose action on a single real unit vector in dimension $d$ mixes in total variation in $Θ(d\log d)$ sequential steps~\cite{PS17}. Lu, Qin, Song, Yao, and Zhao introduced a parallel version of Kac's walk that mixes a single quantum state in $O(\log d)$ rounds~\cite{LQSY+26}. After discretizing the randomness and replacing it by suitable pseudorandom primitives, this parallel walk gives rise to pseudorandom state scramblers, and was subsequently shown to yield pseudorandom unitaries~\cite{LQSY+25}. We study what happens when the parallel Kac's walk acts simultaneously on $k$ orthonormal quantum states. We prove that, for any $1\leq k < d$, after $O\!\left((k+\log d)\log(d/\varepsilon)\right)$ steps, the joint distribution of the $k$ output states is $\varepsilon$-close, in both Wasserstein and total variation distance, to that obtained by applying a common Haar-random unitary to the same inputs. This generalizes the dispersing property of the parallel Kac's walk from a single quantum state to multiple orthonormal quantum states. Equivalently, viewing an ordered collection of $k$ orthonormal states as a point on the complex Stiefel manifold $V_{d,k}=\{X\in\mathbb C^{d\times k}:X^\dagger X=I_k\}$, we show that the parallel Kac's walk mixes rapidly on $V_{d,k}$, with both Wasserstein and total variation mixing times bounded by $O\!\left((k+\log d)\log(d/\varepsilon)\right)$. This extends the Wasserstein mixing result of Pillai, Smith, and Vaikuntanathan for the standard Kac's walk on real Stiefel manifolds~\cite{PSV26}.

quant-pharXiv:2609.37999•Sep 30, 2026•0 citations

Quantum Entanglement-Based Distributed Computing

Jincheng Zhang

This paper explores a novel approach to distributed computing leveraging the principles of quantum entanglement. The core claim is that direct information transfer, facilitated by entanglement, can circumvent the limitations of classical communication bottlenecks, ultimately enhancing computational efficiency and security. This research proposes encoding data into entangled states and utilizing their non-local properties to perform parallel computations. We detail a framework where manipulation of specific components within an entangled state impacts the entire system, enabling distributed computation. The potential for significant performance gains and improved security, compared to traditional distributed computing paradigms reliant on classical communication, is thoroughly discussed. The theoretical framework presented here offers a pathway for future research and development in quantum distributed computing systems.

•Sep 5, 2026•0 citations
This paper demonstrates and proves that the coordination of actions in a distributed swarm can be enhanced by using quantum entanglement. In particular, we focus on• Global and local simultaneous random walks, using entangled qubits that collapse into the same (or opposite) direction, either random direction or totally controlled simultaneous movements.• Identifying eavesdropping from malicious eavesdroppers aimed at disturbing the simultaneous random walks by using entangled qubits that were sent at random or with predefined bases.
We consider the Bennett-Brassard cryptographic scheme, which uses two conjugate quantum bases. An eavesdropper who attempts to obtain information on qubits sent in one of the bases causes a disturbance to qubits sent in the other basis. We derive an upper bound to the accessible information in one basis, for a given error rate in the conjugate basis. Independently fixing the error rates in the conjugate bases, we show that both bounds can be attained simultaneously by an optimal eavesdropping probe. The probe interaction and its subsequent measurement are described explicitly. These results are combined to give an expression for the optimal information an eavesdropper can obtain for a given average disturbance when her interaction and measurements are performed signal by signal. Finally, the relation between quantum cryptography and violations of Bell's inequalities is discussed.
A new paradigm of an entangled swarm intelligence is proposed. It is an abstract quantumcomputational model for a super-fast, high-dimensional, parallel and fault tolerant swarm intelligence. In other words, it is a deep convolutional neural network that is fully entangled (i.e., all processing units, or ‘multineurons’, or robots are inseparably interconnected as a single intelligent entity). It isformally defined as a tensor product of a large number of Hilbert spaces, all forming a very large matrix with elements representing individual n-qubit multineurons. This abstract quantum brain model is targeting quantum silicon chips with many millions of qubits, which will certainly be available in the near future.
This paper investigates the application of quantum-inspired concepts to enhance the performance of random walk algorithms, specifically within the domain of global optimization. Classical random walk algorithms frequently struggle with convergence issues, frequently becoming trapped within local optima, a significant limitation when dealing with complex, high-dimensional search spaces. This research proposes a novel approach where random walk behavior is modeled based on principles derived from quantum mechanics, incorporating superposition and interference effects to facilitate more extensive and efficient exploration of the solution landscape. The core idea is to replace the deterministic step size in traditional random walks with a probabilistic movement governed by a quantum-like probability distribution. We explore the mathematical formulation of this process, detailing the probabilities of transition between states and the impact of interference. The resulting algorithms demonstrate improved convergence rates and a reduced tendency to get stuck in local optima compared to standard random walk methods. The paper concludes by outlining potential future research directions, including adaptive parameter tuning and integration with other optimization techniques.
Kac's walk is a classical local random walk whose action on a single real unit vector in dimension ddd mixes in total variation in Θ(dlog⁡d)Θ(d\log d)Θ(dlogd) sequential steps~\cite{PS17}. Lu, Qin, Song, Yao, and Zhao introduced a parallel version of Kac's walk that mixes a single quantum state in O(log⁡d)O(\log d)O(logd) rounds~\cite{LQSY+26}. After discretizing the randomness and replacing it by suitable pseudorandom primitives, this parallel walk gives rise to pseudorandom state scramblers, and was subsequently shown to yield pseudorandom unitaries~\cite{LQSY+25}. We study what happens when the parallel Kac's walk acts simultaneously on kkk orthonormal quantum states. We prove that, for any 1≤k<d1\leq k < d1≤k<d, after O ⁣((k+log⁡d)log⁡(d/ε))O\!\left((k+\log d)\log(d/\varepsilon)\right)O((k+logd)log(d/ε)) steps, the joint distribution of the kkk output states is ε\varepsilonε-close, in both Wasserstein and total variation distance, to that obtained by applying a common Haar-random unitary to the same inputs. This generalizes the dispersing property of the parallel Kac's walk from a single quantum state to multiple orthonormal quantum states. Equivalently, viewing an ordered collection of kkk orthonormal states as a point on the complex Stiefel manifold Vd,k={X∈Cd×k:X†X=Ik}V_{d,k}=\{X\in\mathbb C^{d\times k}:X^\dagger X=I_k\}Vd,k​={X∈Cd×k:X†X=Ik​}, we show that the parallel Kac's walk mixes rapidly on Vd,kV_{d,k}Vd,k​, with both Wasserstein and total variation mixing times bounded by O ⁣((k+log⁡d)log⁡(d/ε))O\!\left((k+\log d)\log(d/\varepsilon)\right)O((k+logd)log(d/ε)). This extends the Wasserstein mixing result of Pillai, Smith, and Vaikuntanathan for the standard Kac's walk on real Stiefel manifolds~\cite{PSV26}.
This paper explores a novel approach to distributed computing leveraging the principles of quantum entanglement. The core claim is that direct information transfer, facilitated by entanglement, can circumvent the limitations of classical communication bottlenecks, ultimately enhancing computational efficiency and security. This research proposes encoding data into entangled states and utilizing their non-local properties to perform parallel computations. We detail a framework where manipulation of specific components within an entangled state impacts the entire system, enabling distributed computation. The potential for significant performance gains and improved security, compared to traditional distributed computing paradigms reliant on classical communication, is thoroughly discussed. The theoretical framework presented here offers a pathway for future research and development in quantum distributed computing systems.