Large Fourier transforms never exactly realized by braiding conformal blocks

Abstract

Fourier transform is an essential ingredient in Shor's factoring algorithm. In the standard quantum circuit model with the gate set $\{\U(2), \textrm{CNOT}\}$, the discrete Fourier transforms $F_N=({\omega }^{ij}{)}_{N\times N},i,j=0,1,...,N-1,\omega =e^{\frac{2\pi i}{N}}$, can be realized exactly by quantum circuits of size $O(n^2),n=\text{log}N$, and so can the discrete sine/cosine transforms. In topological quantum computing, the simplest universal topological quantum computer is based on the Fibonacci (2+1)-topological quantum field theory (TQFT), where the standard quantum circuits are replaced by unitary transformations realized by braiding conformal blocks. We report here that the large Fourier transforms $F_N$ and the discrete sine/cosine transforms can never be realized exactly by braiding conformal blocks for a fixed TQFT. It follows that approximation is unavoidable to implement the Fourier transforms by braiding conformal blocks.

References in corpus (1)

• Braid Topologies for Quantum Computation

Cited by in corpus (9)

• Introduction to topological quantum computation with non-Abelian anyons
• Resources Required for Topological Quantum Factoring
• Galois Conjugates of Topological Phases
• Skein Theory and Topological Quantum Registers: Braiding Matrices and Topological Entanglement Entropy of Non-Abelian Quantum Hall States
• On Arithmetic Modular Categories
• On classification of modular tensor categories
• Galois Orbits of TQFTs: Symmetries and Unitarity
• Additivity, Haag duality, and non-invertible symmetries
• Efficient quantum processing of 3-manifold topological invariants