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

Quantum Information Processing

Playing distributed two-party quantum games on quantum networks

Boyang Liu, Hong‐Yi Dai, Ming Zhang

Published Oct 24, 2017• 14 citations
Publisher
DOI
10.1007/s11128-017-1738-0

Related papers

Distributed Quantum Games

Ming-Xing Luo

Springer eBooks•Jan 1, 2024•0 citations

What quantum technology will bring to our daily life?

Ming Zhang

The motivation of this talk is to investigate what quantum resources will bring about in our daily life. A kind of quantization for general bipartite games is first given and then applied to both the modified classical “cash in a hat” game and modified Prisoners Dilemma game with different distribution policies. It is shown that quantum entanglement can bring full cooperation with the help of fair distribution policies. It is further demonstrated that quantum networks will make possible playing quantum game between remote players. Two schemes are given to illustrate how to play distributed quantum games between two players on the nodes of quantum networks. In our opinion, it is a worthy research topic to investigate how quantum entanglement can be exploited to achieve full cooperation with equitable distribution polices.

Chinese Automation Congress•Oct 1, 2017•0 citations

New Multi-Qubit CHSH Games and their application to Device-Independent Quantum Key Distribution protocols

Venugopal S, Kunwar Singh

In the Quantum Computing field, the CHSH (Clauser-Horne-Shimony-Holt) game plays a vital role in determining whether a system is in classical or quantum domain. This quantum advantage property is applied in determining the security of the quantum systems, especially in quantum cryptography, in the form of Device-Independent (DI) secure Quantum Key Distribution (QKD). The traditional CHSH game is designed for a system with two players, where each player has access to one entangled qubit from the Bell’s state. In 2024, Hamza Jaffali and Frédéric Holweck proposed a new three-qubit CHSH game by extending the traditional CHSH game to three players using the three-qubit Greenberger–Horne–Zeilinger (GHZ) state and W state.In this paper, first, we present our findings of new CHSH quantum games with quantum advantage in the four-qubit and five-qubit systems. These CHSH quantum games, when played using their quantum strategy, are found to outperform any classical strategy. Second, we apply the quantum advantage property of the existing three-qubit game to develop the corresponding three party DIQKD protocol. Third, we then apply the quantum advantage property of the newly developed four-qubit and five-qubit games to develop their corresponding four party and five party DIQKD protocols.

International Conference on Communication Systems & Networks (COMSNETS)•Jan 6, 2025•2 citations

A model for quantum game on networks

Xu Zhang, Guanrong Chen

Physica A Statistical Mechanics and its Applications•Dec 18, 2025•0 citations

Quantum Coordination and Nonlocal Games: Theory and Applications

Husein Natur, Uzi Pereg

Coordination is a fundamental primitive in communication and information theory, in which distributed systems must collectively generate correlated behavior rather than merely exchange messages. In quantum networks, the nature of entanglement, quantum measurements, and nonclassical correlations introduces coordination possibilities unavailable classically. This article reviews recent advances in coordination over classical and quantum communication networks, focusing on empirical and strong coordination in multi-user settings. We consider the implications of coordination for nonlocal games, showing how it provides a natural framework for understanding the correlations that enable spatially separated players to improve their probability of winning. We present a unified framework for coordination using classical or quantum communication and pre-shared correlation resources. The review covers simulation of both entanglement and separable correlations across a variety of network architectures, including two-node, cascade, broadcast, and multiple-access networks. We study the operational differences between empirical and strong coordination, and the tradeoffs between communication and correlation resources, such as pre-shared randomness and entanglement. Coordination plays a major role in device-independent quantum key distribution (DI-QKD) schemes, in which parties can generate a secret key even if the devices used in the process have been prepared by an adversary. Furthermore, we examine the role of coordination in quantum repeaters, where distributed entanglement serves as a resource for long-distance quantum communication. The review highlights connections between coordination theory and applications such as distributed quantum systems, quantum internet architectures, and future communication networks.

quant-pharXiv:2608.09540•Aug 11, 2026•0 citations

Quantum gambling based on Nash-equilibrium

Pei Zhang, Xiaoqi Zhou, Yunlong Wang +6 more

Abstract The problem of establishing a fair bet between spatially separated gambler and casino can only be solved in the classical regime by relying on a trusted third party. By combining Nash-equilibrium theory with quantum game theory, we show that a secure, remote, two-party game can be played using a quantum gambling machine which has no classical counterpart. Specifically, by modifying the Nash-equilibrium point we can construct games with arbitrary amount of bias, including a game that is demonstrably fair to both parties. We also report a proof-of-principle experimental demonstration using linear optics.

arXiv:1408.6593•npj Quantum Information•Jun 6, 2017•14 citations
The motivation of this talk is to investigate what quantum resources will bring about in our daily life. A kind of quantization for general bipartite games is first given and then applied to both the modified classical “cash in a hat” game and modified Prisoners Dilemma game with different distribution policies. It is shown that quantum entanglement can bring full cooperation with the help of fair distribution policies. It is further demonstrated that quantum networks will make possible playing quantum game between remote players. Two schemes are given to illustrate how to play distributed quantum games between two players on the nodes of quantum networks. In our opinion, it is a worthy research topic to investigate how quantum entanglement can be exploited to achieve full cooperation with equitable distribution polices.
In the Quantum Computing field, the CHSH (Clauser-Horne-Shimony-Holt) game plays a vital role in determining whether a system is in classical or quantum domain. This quantum advantage property is applied in determining the security of the quantum systems, especially in quantum cryptography, in the form of Device-Independent (DI) secure Quantum Key Distribution (QKD). The traditional CHSH game is designed for a system with two players, where each player has access to one entangled qubit from the Bell’s state. In 2024, Hamza Jaffali and Frédéric Holweck proposed a new three-qubit CHSH game by extending the traditional CHSH game to three players using the three-qubit Greenberger–Horne–Zeilinger (GHZ) state and W state.In this paper, first, we present our findings of new CHSH quantum games with quantum advantage in the four-qubit and five-qubit systems. These CHSH quantum games, when played using their quantum strategy, are found to outperform any classical strategy. Second, we apply the quantum advantage property of the existing three-qubit game to develop the corresponding three party DIQKD protocol. Third, we then apply the quantum advantage property of the newly developed four-qubit and five-qubit games to develop their corresponding four party and five party DIQKD protocols.
Coordination is a fundamental primitive in communication and information theory, in which distributed systems must collectively generate correlated behavior rather than merely exchange messages. In quantum networks, the nature of entanglement, quantum measurements, and nonclassical correlations introduces coordination possibilities unavailable classically. This article reviews recent advances in coordination over classical and quantum communication networks, focusing on empirical and strong coordination in multi-user settings. We consider the implications of coordination for nonlocal games, showing how it provides a natural framework for understanding the correlations that enable spatially separated players to improve their probability of winning. We present a unified framework for coordination using classical or quantum communication and pre-shared correlation resources. The review covers simulation of both entanglement and separable correlations across a variety of network architectures, including two-node, cascade, broadcast, and multiple-access networks. We study the operational differences between empirical and strong coordination, and the tradeoffs between communication and correlation resources, such as pre-shared randomness and entanglement. Coordination plays a major role in device-independent quantum key distribution (DI-QKD) schemes, in which parties can generate a secret key even if the devices used in the process have been prepared by an adversary. Furthermore, we examine the role of coordination in quantum repeaters, where distributed entanglement serves as a resource for long-distance quantum communication. The review highlights connections between coordination theory and applications such as distributed quantum systems, quantum internet architectures, and future communication networks.
Abstract The problem of establishing a fair bet between spatially separated gambler and casino can only be solved in the classical regime by relying on a trusted third party. By combining Nash-equilibrium theory with quantum game theory, we show that a secure, remote, two-party game can be played using a quantum gambling machine which has no classical counterpart. Specifically, by modifying the Nash-equilibrium point we can construct games with arbitrary amount of bias, including a game that is demonstrably fair to both parties. We also report a proof-of-principle experimental demonstration using linear optics.