Quantum Multiplexers, Parrondo Games, and Proper Quantization
Faisal Shah Khan

TL;DR
This paper develops new quantizations of quantum Parrondo games using quantum multiplexers, ensuring they satisfy key game theoretic properties and providing insights into quantum analogues of classical Markov processes.
Contribution
It introduces a novel approach to quantizing Parrondo games with quantum multiplexers that meet fundamental game theoretic criteria.
Findings
New quantizations of quantum Parrondo games satisfying key properties
First game theoretic measures of quantum multiplexer behavior
Insights into quantum analogues of classical Markov processes
Abstract
A quantum logic gate of particular interest to both electrical engineers and game theorists is the quantum multiplexer. This shared interest is due to the facts that an arbitrary quantum logic gate may be expressed, up to arbitrary accuracy, via a circuit consisting entirely of variations of the quantum multiplexer, and that certain one player games, the history dependent Parrondo games, can be quantized as games via a particular variation of the quantum multiplexer. However, to date all such quantizations have lacked a certain fundamental game theoretic property. The main result in this dissertation is the development of quantizations of history dependent quantum Parrondo games that satisfy this fundamental game theoretic property. Our approach also yields fresh insight as to what should be considered as the proper quantum analogue of a classical Markov process and gives the first…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Benford’s Law and Fraud Detection · Quantum Mechanics and Applications
