Quantum Parrondo's game with random strategies

We present a quantum implementation of Parrondo's game with randomly switched strategies using 1) a quantum walk as a source of ``randomness'' and 2) a completely positive (CP) map as a randomized evolution. The game exhibits the same paradox as in the classical setting where a combination of two losing strategies might result in a winning strategy. We show that the CP-map scheme leads to significantly lower net gain than the quantum walk scheme

Parrondo's Paradox for Discrete-Time Quantum Walks in Momentum Space

We investigate the possibility of implementing a sequence of quantum walks whose probability distributions give an overall positive winning probability, while it is negative for the single walks (Parrondo's paradox). In particular, we have in mind an experimental realization with a Bose-Einstein condensate in which the walker's space is momentum space. Experimental problems in the precise implementation of the coin operations for our discrete-time quantum walks are analyzed in detail. We study time-dependent phase fluctuations of the coins as well as perturbations arising from the finite momentum width of the condensate. We confirm the visibility of Parrondo's paradox for experimentally available time scales of up to a few hundred steps of the walk

Articles indexats publicats per investigadors del Campus de Terrassa: 2018

Aquest informe recull els 290 treballs publicats per 267 investigadors/es del Campus de Terrassa en revistes indexades al Journal Citation Report durant el 2018Postprint (published version

2016 GREAT Day Program

SUNY Geneseo’s Tenth Annual GREAT Day.https://knightscholar.geneseo.edu/program-2007/1010/thumbnail.jp