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

WORLD SCIENTIFIC eBooks

At the doors of quantum games

Vassili Nikitich Kolokoltsov, Oleg Malafeyev

Published Jan 1, 2010• 0 citations
Publisher

Abstract

AbstractThe following sections are included:Quantum bits and Schrödinger's catLattices and quantum logicRendezvous of Bob and Alice
DOI
10.1142/9789814291729_0007

Related papers

Quantum Logic and Macroscopic Quantum Games

Andrey Anatoljevich Grib, Guillaume Adenier, Andrei Yu. Khrennikov +3 more

AIP conference proceedings•Jan 1, 2007•1 citation

A GAME THEORETIC APPROACH TO STUDY THE QUANTUM KEY DISTRIBUTION BB84 PROTOCOL

Mahboobeh Houshmand, Monireh Houshmand, Habib Rajabi Mashhadi

Quantum cryptography uses quantum mechanics to guarantee secure communication. BB84 is a widely used quantum key distribution that provides a way for two parties, a sender, Alice, and a receiver, Bob, to share an unconditionally secure key in the presence of an eavesdropper, Eve. Three different criteria can be assumed to study the BB84 protocol. They are the efficiency of the protocol, the probability that Eve remains undetected, and the amount of knowledge Eve has about Alice's bit sequence. In a previous approach, we only considered the probability that Eve remains undetected. We viewed this protocol as a three player static game in which Alice and Bob were two cooperative players and Eve was a competitive one. In our game model, Alice's and Bob's objective was to maximize the probability of detecting Eve, while Eve's objective was to minimize this probability. In this paper, our previous effort is extended and we also consider the other two criteria, i.e. the efficiency of the protocol and the amount of knowledge Eve has about Alice's bit sequence. Using these models, we show how game theory can be used to find the strategies for Alice, Bob and Eve.

International Journal of Quantum Information•May 25, 2011•1 citation

What can be computed without communications?

Heger Arfaoui, Pierre Fraigniaud

The main objective of this paper is to provide illustrative examples of distributed computing problems for which it is possible to design tight lower bounds for quantum algorithms without having to manipulate concepts from quantum mechanics, at all. As a case study, we address the following class of 2-player problems. Alice (resp., Bob) receives a boolean x (resp., y) as input, and must return a boolean a (resp., b) as output. A game between Alice and Bob is defined by a pair (?, f) of boolean functions. The objective of Alice and Bob playing game (?, f) is, for every pair (x, y) of inputs, to output values a and b, respectively, satisfying ?(a, b) = f(x, y), in absence of any communication between the two players, but in presence of shared resources. The ability of the two players to solve the game then depends on the type of resources they share. It is known that, for the so-called CHSH game, i.e., for the game a ? b = x ? y, the ability for the players to use entangled quantum bits (qubits) helps. We show that, apart from the CHSH game, quantum correlations do not help, in the sense that, for every game not equivalent to the CHSH game, there exists a classical protocol (using shared randomness) whose probability of success is at least as large as the one of any protocol using quantum resources. This result holds for both worst case and average case analysis. It is achieved by considering a model stronger than quantum correlations, the non-signaling model, which subsumes quantum mechanics, but is far easier to handle.

ACM SIGACT News•Sep 17, 2014•29 citations

Quantum logic

Hafiz Md. Hasan Babu

The book starts with some background and preliminary studies on quantum logic and some characteristics, as well as the evolution of quantum computers, which are discussed in this chapter.

Institute of Physics eBooks•May 1, 2020•0 citations

Quantum logic

Hafiz Md. Hasan Babu

This part of the book starts with some background and preliminary studies on quantum logic and some characteristics, as well as the evolution of quantum computers, which are discussed in this chapter.

Institute of Physics eBooks•Jun 1, 2023•0 citations

Identifying the value of a random variable unambiguously: Quantum versus classical approaches

Saronath Halder, Alexander Streltsov, Manik Banik

Quantum resources may provide an advantage over their classical counterparts. Theoretically, in certain tasks, this advantage can be very high. In this work, we construct such a task based on a game, mediated by the Referee and played between Alice and Bob. The Referee sends Alice a value of a random variable. At the same time, the Referee also sends Bob some partial information regarding that value. Here partial information can be defined in the following way. Bob gets the information of a random set that must contain the value of the variable, which is sent to Alice by the Referee, along with other value(s). Alice is not allowed to know what information is sent to Bob by the Referee. Again, Bob does not know which value of the random variable is sent to Alice. Now, the game can be won if and only if Bob can unambiguously identify the value of the variable that is sent to Alice, with some nonzero probability, no matter what information Bob receives or which value is sent to Alice. However, to help Bob, Alice sends some limited amount of information to him, based on any strategy that is fixed by Alice and Bob before the game begins. We show that if Alice sends a limited amount of classical information, then the game cannot be won, while the quantum analog of the ``limited amount of classical information'' is sufficient for winning the game. Thus, it establishes a quantum advantage. We further analyze several variants of the game and provide certain bounds on the success probabilities. Moreover, we establish connections between the trine ensemble, mutually unbiased bases, and the encoding-decoding strategies of those variants. We also discuss the role of quantum coherence in the present context.

arXiv:2211.09194•Physical Review A•May 6, 2024•3 citations
Quantum cryptography uses quantum mechanics to guarantee secure communication. BB84 is a widely used quantum key distribution that provides a way for two parties, a sender, Alice, and a receiver, Bob, to share an unconditionally secure key in the presence of an eavesdropper, Eve. Three different criteria can be assumed to study the BB84 protocol. They are the efficiency of the protocol, the probability that Eve remains undetected, and the amount of knowledge Eve has about Alice's bit sequence. In a previous approach, we only considered the probability that Eve remains undetected. We viewed this protocol as a three player static game in which Alice and Bob were two cooperative players and Eve was a competitive one. In our game model, Alice's and Bob's objective was to maximize the probability of detecting Eve, while Eve's objective was to minimize this probability. In this paper, our previous effort is extended and we also consider the other two criteria, i.e. the efficiency of the protocol and the amount of knowledge Eve has about Alice's bit sequence. Using these models, we show how game theory can be used to find the strategies for Alice, Bob and Eve.
The main objective of this paper is to provide illustrative examples of distributed computing problems for which it is possible to design tight lower bounds for quantum algorithms without having to manipulate concepts from quantum mechanics, at all. As a case study, we address the following class of 2-player problems. Alice (resp., Bob) receives a boolean x (resp., y) as input, and must return a boolean a (resp., b) as output. A game between Alice and Bob is defined by a pair (?, f) of boolean functions. The objective of Alice and Bob playing game (?, f) is, for every pair (x, y) of inputs, to output values a and b, respectively, satisfying ?(a, b) = f(x, y), in absence of any communication between the two players, but in presence of shared resources. The ability of the two players to solve the game then depends on the type of resources they share. It is known that, for the so-called CHSH game, i.e., for the game a ? b = x ? y, the ability for the players to use entangled quantum bits (qubits) helps. We show that, apart from the CHSH game, quantum correlations do not help, in the sense that, for every game not equivalent to the CHSH game, there exists a classical protocol (using shared randomness) whose probability of success is at least as large as the one of any protocol using quantum resources. This result holds for both worst case and average case analysis. It is achieved by considering a model stronger than quantum correlations, the non-signaling model, which subsumes quantum mechanics, but is far easier to handle.
Quantum resources may provide an advantage over their classical counterparts. Theoretically, in certain tasks, this advantage can be very high. In this work, we construct such a task based on a game, mediated by the Referee and played between Alice and Bob. The Referee sends Alice a value of a random variable. At the same time, the Referee also sends Bob some partial information regarding that value. Here partial information can be defined in the following way. Bob gets the information of a random set that must contain the value of the variable, which is sent to Alice by the Referee, along with other value(s). Alice is not allowed to know what information is sent to Bob by the Referee. Again, Bob does not know which value of the random variable is sent to Alice. Now, the game can be won if and only if Bob can unambiguously identify the value of the variable that is sent to Alice, with some nonzero probability, no matter what information Bob receives or which value is sent to Alice. However, to help Bob, Alice sends some limited amount of information to him, based on any strategy that is fixed by Alice and Bob before the game begins. We show that if Alice sends a limited amount of classical information, then the game cannot be won, while the quantum analog of the ``limited amount of classical information'' is sufficient for winning the game. Thus, it establishes a quantum advantage. We further analyze several variants of the game and provide certain bounds on the success probabilities. Moreover, we establish connections between the trine ensemble, mutually unbiased bases, and the encoding-decoding strategies of those variants. We also discuss the role of quantum coherence in the present context.