PIRSA:13100129

Asymptotically Optimal Topological Quantum Compiling

Kliuchnikov, V. (2013). Asymptotically Optimal Topological Quantum Compiling. Perimeter Institute. https://pirsa.org/13100129

Kliuchnikov, Vadym. Asymptotically Optimal Topological Quantum Compiling. Perimeter Institute, Oct. 30, 2013, https://pirsa.org/13100129 

          @misc{ pirsa_PIRSA:13100129,
            doi = {10.48660/13100129},
            url = {https://pirsa.org/13100129},
            author = {Kliuchnikov, Vadym},
            keywords = {Quantum Information},
            language = {en},
            title = {Asymptotically Optimal Topological Quantum Compiling},
            publisher = {Perimeter Institute},
            year = {2013},
            month = {oct},
            note = {PIRSA:13100129 see, \url{https://pirsa.org}}
          }

Vadym Kliuchnikov University of Waterloo

Talk numberPIRSA:13100129
DOI10.48660/13100129
Collection
Talk Type Scientific Series
Subject

Abstract

In a topological quantum computer, universality is achieved by braiding and quantum information is natively protected from small local errors. We address the problem of compiling single-qubit quantum operations into braid representations for non-abelian quasiparticles described by the Fibonacci anyon model. We develop a probabilistically polynomial algorithm that outputs a braid pattern to approximate a given single-qubit unitary to a desired precision. We also classify the single-qubit unitaries that can be implemented exactly by a Fibonacci anyon braid pattern and present an efficient algorithm to produce their braid patterns. Our techniques produce braid patterns that meet the uniform asymptotic lower bound on the compiled circuit depth and thus are depth-optimal asymptotically. Our compiled circuits are significantly shorter than those output by prior state-of-the-art methods, resulting in improvements in depth by factors ranging from 20 to 1000 for precisions ranging between 10^{−10} and 10^{−30}.