English

Quantum Implementation of Parrondo's Paradox

Quantum Physics 2008-09-16 v2 Computer Science and Game Theory

Abstract

We propose a quantum implementation of a capital-dependent Parrondo's paradox that uses O(log2(n))O(\log_2(n)) qubits, where nn is the number of Parrondo games. We present its implementation in the quantum computer language (QCL) and show simulation results.

Keywords

Cite

@article{arxiv.quant-ph/0502185,
  title  = {Quantum Implementation of Parrondo's Paradox},
  author = {J. A. Miszczak and P. Gawron},
  journal= {arXiv preprint arXiv:quant-ph/0502185},
  year   = {2008}
}

Comments

6 figures, revtex4