2015/04/30 by Alex Bocharov, Shawn X. Cui, Vadym Kliuchnikov +1 · 1 citation
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Anyon #Combinatorics #Computation #Computer science #Context (archaeology) #Discrete mathematics #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum computer #Quantum entanglement #Quantum many-body systems #Quantum mechanics #Qutrit #Theoretical computer science #Topological quantum computer #Topology (electrical circuits) #Universality (dynamical systems) #Upper and lower bounds #quant-ph
paper · pdf · doi:10.1103/physreva.93.012313
published as Phys. Rev. A 93, 012313 (2016) · 15 pages, 5 figures
openalex publication_date 2016/01/08 · arxiv created 2016/06/09 · arxiv updated 2016/06/13 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05
A class of anyonic models for universal quantum computation based on weakly-integral anyons has been recently proposed. While universal set of gates cannot be obtained in this context by anyon braiding alone, designing a certain type of sector charge measurement provides universality. In this paper we develop a compilation algorithm to approximate arbitrary n-qutrit unitaries with asymptotically efficient circuits over the metaplectic anyon model. One flavor of our algorithm produces efficient circuits with upper complexity bound asymptotically in O(3^2\phantom\rule0.16em0exn\phantom\rule0.16em0exlog1/\ensuremathε) and entanglement cost that is exponential in n. Another flavor of the algorithm produces efficient circuits with upper complexity bound in O(n\phantom\rule0.16em0ex3^2\phantom\rule0.16em0exn\phantom\rule0.16em0exlog1/\ensuremathε) and no additional entanglement cost.