Large quantum Fourier transforms are never exactly realized by braiding conformal blocks
- Microsoft Project Q, Kavli Institute for Theoretical Physics, University of California, Santa Barbara, California 93106-4030 (United States)
Fourier transform is an essential ingredient in Shor's factoring algorithm. In the standard quantum circuit model with the gate set {l_brace}U(2), controlled-NOT{r_brace}, the discrete Fourier transforms F{sub N}=({omega}{sup ij}){sub NxN}, i,j=0,1,...,N-1, {omega}=e{sup 2{pi}}{sup i} at {sup {approx}}{sup sol{approx}} at {sup N}, can be realized exactly by quantum circuits of size O(n{sup 2}), n=ln N, and so can the discrete sine or 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{sub N} and the discrete sine or cosine transforms can never be realized exactly by braiding conformal blocks for a fixed TQFT. It follows that an approximation is unavoidable in the implementation of Fourier transforms by braiding conformal blocks.
- OSTI ID:
- 20982268
- Journal Information:
- Physical Review. A, Vol. 75, Issue 3; Other Information: DOI: 10.1103/PhysRevA.75.032322; (c) 2007 The American Physical Society; Country of input: International Atomic Energy Agency (IAEA); ISSN 1050-2947
- Country of Publication:
- United States
- Language:
- English
Similar Records
Universal topological quantum computation with strongly correlated Majorana edge modes
Comments on one-form global symmetries and their gauging in 3d and 4d