Quantum Implementation of Parrondo's Paradox
classification
🪐 quant-ph
cs.GT
keywords
implementationparrondoquantumparadoxcapital-dependentcomputergameslanguage
read the original abstract
We propose a quantum implementation of a capital-dependent Parrondo's paradox that uses $O(\log_2(n))$ qubits, where $n$ is the number of Parrondo games. We present its implementation in the quantum computer language (QCL) and show simulation results.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.