Any practical construction of a quantum computer requires choosing a good set of quantum logic gates: formally, a finite set of unitary matrices that can efficiently approximate arbitrary unitary matrices through short products. We discuss how ideas relating to the Lubotzky-Phillips-Sarnak construction of expander graphs applying Bruhat-Tits theory and the theory of Automorphic representations can help construct these gate sets. We also present the first known construction of optimally efficient "golden" gates for multiple qubits.
Constructing Quantum Logic Gates through the Theory of Automorphic Representation
28.01.2025 15:00 - 16:30
Organiser:
G. Arzhantseva, Ch. Cashen
Location: