pith. sign in

arxiv: quant-ph/0610111 · v2 · submitted 2006-10-13 · 🪐 quant-ph · cond-mat.mes-hall

Topological Quantum Compiling

classification 🪐 quant-ph cond-mat.mes-hall
keywords quantumcompilingmethodquasiparticlesthree-braidsaccuracyactingalgorithm
0
0 comments X
read the original abstract

A method for compiling quantum algorithms into specific braiding patterns for non-Abelian quasiparticles described by the so-called Fibonacci anyon model is developed. The method is based on the observation that a universal set of quantum gates acting on qubits encoded using triplets of these quasiparticles can be built entirely out of three-stranded braids (three-braids). These three-braids can then be efficiently compiled and improved to any required accuracy using the Solovay-Kitaev algorithm.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Lower overhead fault-tolerant building blocks for noisy quantum computers

    quant-ph 2026-05 unverdicted novelty 5.0

    New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.