2019/09/23 by S. Vijayaraj, Vijayaraj, Sujan, Satyadev Nandakumar +1
Computer Science · Physics and Astronomy · #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.1909.10424
openalex publication_date 2019/09/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Binary decisions are the simplest form of decisions that are made in our daily lives. Examples include choosing a two-way path in a maze, accepting or declining an offer, etc. These decisions are also made by computers, machines and various electronic components. But decisions made on these devices can be partial and deterministic, and hence compromised. In this paper, a simple framework to implement binary decisions using one or many qubits is presented. Such systems are based on a separate hardware infrastructure rather than computer codes. This helps enable true randomness and impartial decision making. The multi-armed bandit problem is used to highlight the decision making ability of qubits by predictive modelling based on quantum Bayesianism. Bipartite and multipartite entangled states are also used to solve specific cases of the problem.