1 citations · 1 across the 2 of their papers we have counts for
5 papers · 1 filter
Properly Quantized History Dependent Parrondo Games, Markov Processes, and Multiplexing Circuits
Steven A. Bleiler, Faisal Shah Khan
In the context of quantum information theory, "quantization" of various mathematical and computational constructions is said to occur upon the replacement, at various points in the…
Quantum Multiplexers, Parrondo Games, and Proper Quantization
Faisal Shah Khan
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 q…
An Alternative Quantization Protocol for the History Dependent Parrondo Game
Faisal Shah Khan
Earlier work on the quantization of the history dependent (HD) Parrondo game by Flitney, Ng, and Abbott led to the FNA protocol. We propose an alternative quantization protocol for…
Synthesis of Ternary Quantum Logic Circuits by Decomposition
Faisal Shah Khan, Marek Perkowski
Recent research in multi-valued logic for quantum computing has shown practical advantages for scaling up a quantum computer. Multivalued quantum systems have also been used in the…
Synthesis of multi-qudit Hybrid and d-valued Quantum Logic Circuits by Decomposition
Faisal Shah Khan, Marek Perkowski
Recent research in generalizing quantum computation from 2-valued qudits to d-valued qudits has shown practical advantages for scaling up a quantum computer. A further generalizati…