Operator-Schmidt decomposition of the quantum Fourier transform on C^N1 tensor C^N2

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

9 pages, LaTeX 2e; No changes in results. References and acknowledgments added. Changes in presentation added to satisfy refer

Scientific paper

Operator-Schmidt decompositions of the quantum Fourier transform on C^N1 tensor C^N2 are computed for all N1, N2 > 1. The decomposition is shown to be completely degenerate when N1 is a factor of N2 and when N1>N2. The first known special case, N1=N2=2^n, was computed by Nielsen in his study of the communication cost of computing the quantum Fourier transform of a collection of qubits equally distributed between two parties. [M. A. Nielsen, PhD Thesis, University of New Mexico (1998), Chapter 6, arXiv:quant-ph/0011036.] More generally, the special case N1=2^n1<2^n2=N2 was computed by Nielsen et. al. in their study of strength measures of quantum operations. [M.A. Nielsen et. al, (accepted for publication in Phys Rev A); arXiv:quant-ph/0208077.] Given the Schmidt decompositions presented here, it follows that in all cases the communication cost of exact computation of the quantum Fourier transform is maximal.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Operator-Schmidt decomposition of the quantum Fourier transform on C^N1 tensor C^N2 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 Operator-Schmidt decomposition of the quantum Fourier transform on C^N1 tensor C^N2, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Operator-Schmidt decomposition of the quantum Fourier transform on C^N1 tensor C^N2 will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-343071

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.