Do quantum strategies always win?

From MaRDI portal
Publication:898440

DOI10.1007/S11128-015-1105-YzbMATH Open1327.81079DBLPjournals/qip/AnandB15arXiv1412.7399OpenAlexW3100222650WikidataQ58987460 ScholiaQ58987460MaRDI QIDQ898440FDOQ898440


Authors: Namit Anand, Colin Benjamin Edit this on Wikidata


Publication date: 9 December 2015

Published in: Quantum Information Processing (Search for Journal in Brave)

Abstract: In a seminal paper, Meyer [David Meyer, Phys. Rev. Lett. 82, 1052 (1999)] described the advantages of quantum game theory by looking at the classical penny flip game. A player using a quantum strategy can win against a classical player almost 100% of the time. Here we make a slight modification to the quantum game, with the two players sharing an entangled state to begin with. We then analyze two different scenarios, first in which quantum player makes unitary transformations to his qubit while the classical player uses a pure strategy of either flipping or not flipping the state of his qubit. In this case the quantum player always wins against the classical player. In the second scenario we have the quantum player making similar unitary transformations while the classical player makes use of a mixed strategy wherein he either flips or not with some probability "p". We show that in the second scenario, 100% win record of a quantum player is drastically reduced and for a particular probability "p" the classical player can even win against the quantum player. This is of possible relevance to the field of quantum computation as we show that in this quantum game of preserving versus destroying entanglement a particular classical algorithm can beat the quantum algorithm.


Full work available at URL: https://arxiv.org/abs/1412.7399




Recommendations




Cites Work


Cited In (16)





This page was built for publication: Do quantum strategies always win?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898440)