Engineering Functional Quantum Algorithms
Abstract
Suppose that a quantum circuit with K elementary gates is known for a unitary matrix U, and assume that Um 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+m2log 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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.