Likelihood Theory in a Quantum World: tests with Quantum coins and computers

Abstract

By repeated trials, one can determine the fairness of a classical coin with a confidence which grows with the number of trials. A quantum coin can be in a superposition of heads and tails and its state is most generally a density matrix. Given a string of qubits representing a series of trials, one can measure them individually and determine the state with a certain confidence. We show that there is an improved strategy which measures the qubits after entangling them, which leads to a greater confidence. This strategy is demonstrated on the simulation facility of IBM quantum computers.

arXiv commentfour pages three figures, submitted for publication

References in corpus (5)

• The Quantum Chernoff Bound
• Quantum State Discrimination
• Nonlocal properties of two-qubit gates and mixed states and optimization of quantum computations
• Minimal Universal Two-qubit Quantum Circuits
• Entropy and Geometry of Quantum States

Cited by in corpus (1)

• Implementation of a Quantum Algorithm to Estimate the Energy of a Particle in a Finite Square Well Potential on IBM Quantum Computer