Engineering Functional Quantum Algorithms

Details Engineering Functional Quantum Algorithms Engineering Functional Quantum Algorithms

2002-08-20

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

Physical Review A, 67, 010302, 2003

Physics

Quantum Physics

4 pages, 2 figures

Scientific paper

10.1103/PhysRevA.67.010302

Suppose that a quantum circuit with K elementary gates is known for a unitary matrix U, and assume that U^m is a scalar matrix for some positive integer m. We show that a function of U can be realized on a quantum computer with at most O(mK+m^2log m) elementary gates. The functions of U are realized by a generic quantum circuit, which has a particularly simple structure. Among other results, we obtain efficient circuits for the fractional Fourier transform.

Affiliated with

Also associated with

No associations

Rating

Engineering Functional Quantum Algorithms 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 Engineering Functional Quantum Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Engineering Functional Quantum Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-221000