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

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• 3 citations
Publisher

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

Distributed Coordination Based on Quantum Entanglement

Yotam Ashkenazi, Shlomi Dolev

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. - Identifying Byzantine robots or malicious robots that are trying to gain secret information or are attacking the system using entangled qubits. - The use of Pseudo Telepathy to coordinate robots' actions.

arXiv:2210.10551•Oct 19, 2022•1 citation

What if we Could Entangle Drones? Towards the Management of a Swarm of Drones as a Non-Local Quantum Object

Serge Chaumette B

Since a few years, swarms of drones are used in both the civil and military domains. They might be composed of tens, hundreds if not thousands of drones (e.g. to achieve saturation effect). It thus becomes hard to deal with each of the individual drones that make it. Therefore, making a swarm a single object, that could then be controlled as a single entity, whatever its size and its surface, is the grail.Many projects have been working on this issue. Still, as far as we know, none has been convincingly successful. There are a number of reasons for that.From a conceptual point of view, the controls that make sense at the level of a swarm are not simply an upscale of the operations that make sense for the drones that compose it. Some controls are easy to upscale (take off, land) and to map back from the swarm to its individual components. Some are more difficult. For instance, what does it mean and does it even make sense to move a swarm to a given location? There is an underlying notion of synchronization that remains hidden if stating things so simply: when should the move begin, should the members go together, when is the move terminated, etc.? Whatever the answers to these questions, this requires stable communication and strong synchronization between the members of the swarm, which cannot be guaranteed in most theaters of operations, especially for large swarms. Additionally, there are operations that only make sense at the level of a swarm, not of an individual drone. For instance, it might be useful to split a swarm into two smaller sub swarms, and later reconnect them as a single object.From a technical point of view, two major configurations are to be considered. First, it the swarm is controlled by some central system on the ground (C2, Command and Control) it makes things partly tractable. The C2 has a global view of all the members of the swarm and the above issues can be dealt with, knowing the required information about each unitary system. Still this does not solve the problems of congestion, latences and disruptions. Second, if the swarm is composed of autonomous systems, i.e. when the swarm is composed of drones that decide on their own on their behavior, it becomes much more difficult. Still, this is the most interesting configuration in real world operation because autonomy makes it possible to address BLOS (Beyond Line of Sight) missions and avoids swarm to ground communication.The question to solve is what do we precisely expect when willing to make a swarm a single object? We claim that the perfect result would be to break the locality of each individual drone making the swarm a non-local object as if the drones were some sort of entangled (by analogy with quantum physics and the EPR principle). Therefore, our provocative claim that future swarms generation will be quantum swarms.

AHFE international•Jan 1, 2024•0 citations

Optimal Eavesdropping in Quantum Cryptography. I

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 rate in the conjugate bases, we show that both bounds can be attained simultaneously by an optimal eavesdropping probe, consisting of two qubits. The qubits' interaction and their 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•Jan 30, 1997•54 citations

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.

Physical Review A•Aug 1, 1997•475 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•1 citation

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
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.
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. - Identifying Byzantine robots or malicious robots that are trying to gain secret information or are attacking the system using entangled qubits. - The use of Pseudo Telepathy to coordinate robots' actions.
Since a few years, swarms of drones are used in both the civil and military domains. They might be composed of tens, hundreds if not thousands of drones (e.g. to achieve saturation effect). It thus becomes hard to deal with each of the individual drones that make it. Therefore, making a swarm a single object, that could then be controlled as a single entity, whatever its size and its surface, is the grail.Many projects have been working on this issue. Still, as far as we know, none has been convincingly successful. There are a number of reasons for that.From a conceptual point of view, the controls that make sense at the level of a swarm are not simply an upscale of the operations that make sense for the drones that compose it. Some controls are easy to upscale (take off, land) and to map back from the swarm to its individual components. Some are more difficult. For instance, what does it mean and does it even make sense to move a swarm to a given location? There is an underlying notion of synchronization that remains hidden if stating things so simply: when should the move begin, should the members go together, when is the move terminated, etc.? Whatever the answers to these questions, this requires stable communication and strong synchronization between the members of the swarm, which cannot be guaranteed in most theaters of operations, especially for large swarms. Additionally, there are operations that only make sense at the level of a swarm, not of an individual drone. For instance, it might be useful to split a swarm into two smaller sub swarms, and later reconnect them as a single object.From a technical point of view, two major configurations are to be considered. First, it the swarm is controlled by some central system on the ground (C2, Command and Control) it makes things partly tractable. The C2 has a global view of all the members of the swarm and the above issues can be dealt with, knowing the required information about each unitary system. Still this does not solve the problems of congestion, latences and disruptions. Second, if the swarm is composed of autonomous systems, i.e. when the swarm is composed of drones that decide on their own on their behavior, it becomes much more difficult. Still, this is the most interesting configuration in real world operation because autonomy makes it possible to address BLOS (Beyond Line of Sight) missions and avoids swarm to ground communication.The question to solve is what do we precisely expect when willing to make a swarm a single object? We claim that the perfect result would be to break the locality of each individual drone making the swarm a non-local object as if the drones were some sort of entangled (by analogy with quantum physics and the EPR principle). Therefore, our provocative claim that future swarms generation will be quantum swarms.
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 rate in the conjugate bases, we show that both bounds can be attained simultaneously by an optimal eavesdropping probe, consisting of two qubits. The qubits' interaction and their 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.
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.
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.