Asymptotically Optimal Topological Quantum Compiling: Every Output of the Fibonacci-Anyon Approximation Algorithm Is an ⟨F,T⟩-Circuit of Length O(log(1/ε)) Within Distance ε of Rz(φ)Research Paper
Topological quantum computing represents a gate operation by moving anyons around one another. A compiler must turn a requested single-qubit unitary into a finite braid or gate word, with enough accuracy and a length that grows slowly as the error tolerance shrinks. For Fibonacci anyons, the matrices generated by the standard elementary braids have…