The connection between the $PQ$ penny flip game and the dihedral groups
- URL: http://arxiv.org/abs/2104.12043v1
- Date: Sun, 25 Apr 2021 01:41:36 GMT
- Title: The connection between the $PQ$ penny flip game and the dihedral groups
- Authors: Theodore Andronikos and Alla Sirokofskich
- Abstract summary: We show that the PQ penny flip game can be associated with the dihedral group $D_8$.
We establish precisely two different sequences of states that can guaranteed Q's win with probability $1.0$.
We consider general extensions of the game with the quantum player having $U(2)$ at his disposal.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: This paper is inspired by the PQ penny flip game. It employs group-theoretic
concepts to study the original game and also its possible extensions. We show
that the PQ penny flip game can be associated with the dihedral group $D_{8}$.
We prove that within $D_{8}$ there exist precisely two classes of winning
strategies for Q. We establish that there are precisely two different sequences
of states that can guaranteed Q's win with probability $1.0$. We also show that
the game can be played in the all dihedral groups $D_{8 n}$, $n \geq 1$, with
any significant change. We examine what happens when Q can draw his moves from
the entire $U(2)$ and we conclude that again, there are exactly two classes of
winning strategies for Q, each class containing now an infinite number of
equivalent strategies, but all of them send the coin through the same sequence
of states as before. Finally, we consider general extensions of the game with
the quantum player having $U(2)$ at his disposal. We prove that for Q to surely
win against Picard, he must make both the first and the last move.
Related papers
- Imperfect-Recall Games: Equilibrium Concepts and Their Complexity [74.01381499760288]
We investigate optimal decision making under imperfect recall, that is, when an agent forgets information it once held before.
In the framework of extensive-form games with imperfect recall, we analyze the computational complexities of finding equilibria in multiplayer settings.
arXiv Detail & Related papers (2024-06-23T00:27:28Z) - Universality of graph homomorphism games and the quantum coloring
problem [0.0]
We show that quantum graph parameters encode winning strategies for all possible synchronous non-local games.
Winning strategies for a synchronous game can be transformed into winning strategies for an associated graph coloring game.
arXiv Detail & Related papers (2023-05-29T14:28:28Z) - Uncoupled and Convergent Learning in Two-Player Zero-Sum Markov Games
with Bandit Feedback [49.1061436241109]
We focus on developing an algorithm that is uncoupled, convergent, and rational, with non-asymptotic convergence rates.
Our algorithm is related to [Chen et al., 2021, Cen et al., 2021] and also builds on the entropy regularization technique.
arXiv Detail & Related papers (2023-03-05T18:08:54Z) - Quantum free games [2.298932494750101]
We show a BellQMA(2) protocol for 3SAT on $n$ variables, where the total amount of communication is $tildeO(sqrtn)
arXiv Detail & Related papers (2023-02-08T20:32:24Z) - Global Nash Equilibrium in Non-convex Multi-player Game: Theory and
Algorithms [66.8634598612777]
We show that Nash equilibrium (NE) is acceptable to all players in a multi-player game.
We also show that no one can benefit unilaterally from the general theory step by step.
arXiv Detail & Related papers (2023-01-19T11:36:50Z) - Algebraic Aspects of Boundaries in the Kitaev Quantum Double Model [77.34726150561087]
We provide a systematic treatment of boundaries based on subgroups $Ksubseteq G$ with the Kitaev quantum double $D(G)$ model in the bulk.
The boundary sites are representations of a $*$-subalgebra $Xisubseteq D(G)$ and we explicate its structure as a strong $*$-quasi-Hopf algebra.
As an application of our treatment, we study patches with boundaries based on $K=G$ horizontally and $K=e$ vertically and show how these could be used in a quantum computer
arXiv Detail & Related papers (2022-08-12T15:05:07Z) - Experimental test of Tsirelson's bound with a single photonic qubit [8.8709589922781]
In the Clauser-Horne-Shimony-Holt game, two space-like separated players, Alice and Bob are each assigned a classical bit $a$ and $b$ respectively.
In the game, if the players use the classical strategies, the optimal success probability $w(textCHSH)=0.75$.
Popescu and Rohrlich noted that the perfect success probability $1$ can also be achieved in a more general theory without violating the no-signaling assumption.
arXiv Detail & Related papers (2022-01-25T09:06:53Z) - Synchronous games with $*$-isomorphic game algebras [0.0]
We show that the game algebra of any synchronous game on $n$ inputs and $k$ outputs is $*$-isomorphic to the game algebra of an associated bisynchronous game on $nk$ inputs and $nk$ outputs.
We also exhibit a $*$-isomorphism between any synchronous game algebra with $n$ questions and $k>3$ answers and a synchronous game algebra with $n(k-2)$ questions and $3$ answers.
arXiv Detail & Related papers (2021-09-10T13:19:14Z) - Quantum double aspects of surface code models [77.34726150561087]
We revisit the Kitaev model for fault tolerant quantum computing on a square lattice with underlying quantum double $D(G)$ symmetry.
We show how our constructions generalise to $D(H)$ models based on a finite-dimensional Hopf algebra $H$.
arXiv Detail & Related papers (2021-06-25T17:03:38Z) - Near-Optimal Reinforcement Learning with Self-Play [50.29853537456737]
We focus on self-play algorithms which learn the optimal policy by playing against itself without any direct supervision.
We propose an optimistic variant of the emphNash Q-learning algorithm with sample complexity $tildemathcalO(SAB)$, and a new emphNash V-learning algorithm with sample complexity $tildemathcalO(S(A+B))$.
arXiv Detail & Related papers (2020-06-22T05:00:13Z) - Complexity limitations on one-turn quantum refereed games [0.6091702876917281]
The paper studies theoretic aspects of quantum refereed games.
The abstract games are between two competing players that send quantum states to a referee.
The referee performs an efficiently implementable joint measurement on the two states to determine which of the player wins.
arXiv Detail & Related papers (2020-02-04T19:28:03Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.