QLunch: Elias Theil

Speaker: Elias Theil from QMATH

Title: Quantum Majority Vote

Abstract: In this talk I will present the quantum majority vote algorithm. For the classical majority vote algorithm, Alice sends a string of n bits to Bob. Bob then has to output 0 or 1, depending on which symbol appears more frequent in the bitstring. In the quantum case, Bob has to find the optimal channel that performs an equivalent action on a 0,1 basis, with the additional requirement that the basis is not known beforehand. It turns out this task can be solved elegantly using representation theory. I will give a brief overview of the mathematics behind the proof and explain the connections to other problems in quantum information science.