2019/01/30 by Arpita Maitra, Joseph Samuel, Supurna Sinha
Computer Science · Physics and Astronomy · #IBM #Measure (data warehouse) #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum state #Quantum superposition #Qubit #State (computer science) #String (physics) #Superposition principle #quant-ph
paper · pdf · doi:10.1007/s12043-020-1926-9
published as Rapid Communication, Pramana, vol 94, p57 (2020) · four pages three figures, submitted for publication
arxiv created 2019/01/30 · openalex created_date 2019/02/21 · openalex publication_date 2020/03/16 · arxiv updated 2020/04/22 · openalex updated_date 2026/08/05
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.