Efficiently achieving fault-tolerant qudit quantum computation via gate teleportation

          @misc{ pirsa_PIRSA:24050013,
            doi = {10.48660/24050013},
            url = {https://pirsa.org/24050013},
            author = {de Silva, Nadish},
            keywords = {Quantum Information},
            language = {en},
            title = {Efficiently achieving fault-tolerant qudit quantum computation via gate teleportation},
            publisher = {Perimeter Institute},
            year = {2024},
            month = {may},
            note = {PIRSA:24050013 see, \url{https://pirsa.org}}
          }
          

Abstract

Quantum computers operate by manipulating quantum systems that are particularly susceptible to noise. Classical redundancy-based error correction schemes cannot be applied as quantum data cannot be copied. These challenges can be overcome by using a variation of the quantum teleportation protocol to implement those operations which cannot be easily done fault-tolerantly. This process consumes expensive resources called 'magic states'. The vast quantity of these resources states required for achieving fault-tolerance is a significant bottleneck for experimental implementations of universal quantum computers. I will discuss a program of finding and classifying those quantum operations which can be performed with efficient use of magic state resources. I will focus on the understanding of not just qubits but also the higher-dimensional 'qudit' case. This is motivated by both practical reasons and for the resulting theoretical insights into the ultimate origin of quantum computational advantages. Research into these quantum operations has remained active from their discovery twenty-five years ago to the present. Our approach introduces the novel use of tools from algebraic geometry. The results in this talk will include joint work with Chen, Lautsch, and Bampounis-Barbosa.