Large Fourier transforms never exactly realized by braiding conformal blocks

Details Large Fourier transforms never exactly realized by braiding conformal blocks Large Fourier transforms never exactly realized by braiding conformal blocks

2006-09-18

arxiv.org/abs/cond-mat/0609411v2

Physics

Condensed Matter

Mesoscale and Nanoscale Physics

Scientific paper

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=\textrm{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.

Affiliated with

Also associated with

No associations

Rating

Large Fourier transforms never exactly realized by braiding conformal blocks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Large Fourier transforms never exactly realized by braiding conformal blocks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Large Fourier transforms never exactly realized by braiding conformal blocks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-646979