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

Indian Journal of Physics

A scheme to cancel out superiority of quantum strategies in coin-tossing game

Heng-Feng Ren, Q.-L. Wang, Run-Ming Lian, Shaonan Hou

Published Nov 11, 2013• 0 citations
Publisher
DOI
10.1007/s12648-013-0404-3

Related papers

Quantum mechanics can prohibit cheating in coin tossing

Arindam Mitra

•Feb 1, 2005•1 citation

A Novel Quantum Coin Tossing Protocol with Computationally Secure

Guanghui Liu, Dong Cao

Communications in computer and information science•Jan 1, 2011•0 citations

Quantum coin-tossing in a Bayesian Jeffreys framework

Paul B. Slater

Physics Letters A•Oct 1, 1995•10 citations

Evolutionarily stable strategies in quantum games

A. Iqbal, A.H. Toor

arXiv:quant-ph/0007100•Physics Letters A•Mar 1, 2001•114 citations

Scouring Parrondo's paradox in discrete-time quantum walks

Gururaj Kadiri

We propose a quantum game based on coin-based quantum walks. Given a quantum walk and a Hermitian operator on the coin-position composite space, winning this game involves choosing an initial coin state such that the given quantum walk leads to a composite state in which the expectation value of the given Hermitian operator is greater than a certain value. Parrondo's paradox is a phenomenon where a combination of losing strategies becomes a winning strategy. We give a deterministic scheme for identifying Parrondo's paradox in our game, in the sense that, given a collection of distinct quantum steps, we identify initial coin states which happen to be losing states for all quantum walks comprised solely of these steps individually, but turn out to be winning states for a quantum walk comprised of all the given steps taken in a sequence. Unlike traditional quantum steps that allow for equal magnitude forward and backward strides based on the outcome of the coin toss, the steps of the quantum walks employed here, though still contingent upon coin toss, permit the strides to be of unequal magnitude, and not necessarily in opposite directions. We believe the results presented here will contribute to a deeper understanding of evolution of expectation values of observables in quantum walks, and facilitate the development of novel quantum algorithms.

arXiv:2401.08983•Physical Review A•Aug 14, 2024•4 citations

Quantum Approach to Game Theory

Ramón Alonso‐Sanz

Emergence, complexity and computation•Jan 1, 2019•1 citation
We propose a quantum game based on coin-based quantum walks. Given a quantum walk and a Hermitian operator on the coin-position composite space, winning this game involves choosing an initial coin state such that the given quantum walk leads to a composite state in which the expectation value of the given Hermitian operator is greater than a certain value. Parrondo's paradox is a phenomenon where a combination of losing strategies becomes a winning strategy. We give a deterministic scheme for identifying Parrondo's paradox in our game, in the sense that, given a collection of distinct quantum steps, we identify initial coin states which happen to be losing states for all quantum walks comprised solely of these steps individually, but turn out to be winning states for a quantum walk comprised of all the given steps taken in a sequence. Unlike traditional quantum steps that allow for equal magnitude forward and backward strides based on the outcome of the coin toss, the steps of the quantum walks employed here, though still contingent upon coin toss, permit the strides to be of unequal magnitude, and not necessarily in opposite directions. We believe the results presented here will contribute to a deeper understanding of evolution of expectation values of observables in quantum walks, and facilitate the development of novel quantum algorithms.