Parrondo's game of quantum search based on quantum walk
- URL: http://arxiv.org/abs/2303.06579v2
- Date: Thu, 20 Jul 2023 01:01:42 GMT
- Title: Parrondo's game of quantum search based on quantum walk
- Authors: Taisuke Hosaka and Norio Konno
- Abstract summary: Parrondo game based on quantum walk and the search algorithm via quantum walk have been widely studied, respectively.
This paper newly presents a Parrondo game of quantum search based on quantum walk by combining both models.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The Parrondo game, devised by Parrondo, means that winning strategy is
constructed a combination of losing strategy. This situation is called the
Parrondo paradox. The Parrondo game based on quantum walk and the search
algorithm via quantum walk have been widely studied, respectively. This paper
newly presents a Parrondo game of quantum search based on quantum walk by
combining both models. Moreover we confirm that Parrondo's paradox exists for
our model on the one- and two-dimensional torus by numerical simulations.
Afterwards we show the range in which the paradox occurs is symmetric about the
origin on the $d$-dimensional torus $(d \geq 1)$ with even vertices and one
marked vertex.
Related papers
- A bound on the quantum value of all compiled nonlocal games [49.32403970784162]
A cryptographic compiler converts any nonlocal game into an interactive protocol with a single computationally bounded prover.
We establish a quantum soundness result for all compiled two-player nonlocal games.
arXiv Detail & Related papers (2024-08-13T08:11:56Z) - Parrondo's paradox in quantum walks with inhomogeneous coins [0.0]
Parrondo's paradox is a counterintuitive phenomenon where two losing strategies combine to produce a winning outcome.
In this study, we investigate the manifestation of Parrondo's paradox in discrete-time quantum walks.
arXiv Detail & Related papers (2024-07-23T15:14:12Z) - Scouring Parrondo's Paradox in Discrete-Time Quantum Walks [0.0]
Parrondo's paradox is a phenomenon where a combination of losing strategies becomes a winning strategy.
Unlike traditional quantum steps that allow for equal magnitude forward and backward strides based on the outcome of the coin-toss, the steps employed here permit the strides to be of unequal magnitude.
arXiv Detail & Related papers (2024-01-17T05:31:02Z) - Repeated quantum game as a stochastic game: Effects of the shadow of the
future and entanglement [0.0]
We present a systematic investigation of the quantum games, constructed using a novel repeated game protocol.
We find that how two pure strategies fare against each other is crucially dependent on the discount factor.
In the quantum game setup, always-defect strategy can be beaten by the tit-for-tat strategy for high enough discount factor.
arXiv Detail & Related papers (2023-12-08T15:54:51Z) - Photonic implementation of the quantum Morra game [69.65384453064829]
We study a faithful translation of a two-player quantum Morra game, which builds on previous work by including the classical game as a special case.
We propose a natural deformation of the game in the quantum regime in which Alice has a winning advantage, breaking the balance of the classical game.
We discuss potential applications of the quantum Morra game to the study of quantum information and communication.
arXiv Detail & Related papers (2023-11-14T19:41:50Z) - Quantum Parrondo Games in Low-Dimensional Hilbert Spaces [0.0]
We consider quantum variants of Parrondo games on low-dimensional Hilbert spaces.
The two games which form the Parrondo game are implemented as quantum walks on a small cycle of length $M$.
We show that in the quantum Parrondo game constructed in this way a systematic win or loss occurs in the long time limit.
arXiv Detail & Related papers (2023-06-29T10:37:20Z) - A vertical gate-defined double quantum dot in a strained germanium
double quantum well [48.7576911714538]
Gate-defined quantum dots in silicon-germanium heterostructures have become a compelling platform for quantum computation and simulation.
We demonstrate the operation of a gate-defined vertical double quantum dot in a strained germanium double quantum well.
We discuss challenges and opportunities and outline potential applications in quantum computing and quantum simulation.
arXiv Detail & Related papers (2023-05-23T13:42:36Z) - One-Way Ticket to Las Vegas and the Quantum Adversary [78.33558762484924]
We show that quantum Las Vegas query complexity is exactly equal to the quantum adversary bound.
This is achieved by transforming a feasible solution to the adversary inversion problem into a quantum query algorithm.
arXiv Detail & Related papers (2023-01-05T11:05:22Z) - Depth-efficient proofs of quantumness [77.34726150561087]
A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover.
In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
arXiv Detail & Related papers (2021-07-05T17:45:41Z) - On Applying the Lackadaisical Quantum Walk Algorithm to Search for
Multiple Solutions on Grids [63.75363908696257]
The lackadaisical quantum walk is an algorithm developed to search graph structures whose vertices have a self-loop of weight $l$.
This paper addresses several issues related to applying the lackadaisical quantum walk to search for multiple solutions on grids successfully.
arXiv Detail & Related papers (2021-06-11T09:43:09Z) - Territories of Parrondo's paradox and its relation with entanglement in
quantum walks [0.0]
Parrondo's paradox is a well-known counterintuitive phenomenon, where the combination of unfavorable situations can establish favorable ones.
We study one-dimensional discrete-time quantum walks, manipulating two different coins (two-state) operators representing two losing games A and B, respectively.
Our outcomes potentially encourage the development of new quantum algorithms.
arXiv Detail & Related papers (2020-06-30T07:50:24Z)
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.