The Quantum Schur Transform: I. Efficient Qudit Circuits

Details The Quantum Schur Transform: I. Efficient Qudit Circuits The Quantum Schur Transform: I. Efficient Qudit Circuits

2005-12-30

arxiv.org/abs/quant-ph/0601001v1

Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms (SODA), pp. 1235-1244, 2007.

Physics

Quantum Physics

24 pages

Scientific paper

We present an efficient family of quantum circuits for a fundamental primitive in quantum information theory, the Schur transform. The Schur transform on n d-dimensional quantum systems is a transform between a standard computational basis to a labelling related to the representation theory of the symmetric and unitary groups. If we desire to implement the Schur transform to an accuracy of epsilon, then our circuit construction uses a number of gates which is polynomial in n, d and log(1/epsilon). The important insights we use to perform this construction are the selection of the appropriate subgroup adapted basis and the Wigner-Eckart theorem. Our efficient circuit construction renders numerous protocols in quantum information theory computationally tractable and is an important new efficient quantum circuit family which goes significantly beyond the standard paradigm of the quantum Fourier transform.

Affiliated with

Also associated with

No associations

Rating

The Quantum Schur Transform: I. Efficient Qudit Circuits 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 The Quantum Schur Transform: I. Efficient Qudit Circuits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Quantum Schur Transform: I. Efficient Qudit Circuits will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-398966