Engineering Functional Quantum Algorithms

Abstract

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.

4 pages, 2 figures

References in corpus (1)

• Quantum Gates and Circuits

Cited by in corpus (6)

• Quantum algorithm for solving linear systems of equations
• Dynamical Properties of the Delta Kicked Harmonic Oscillator
• Implementing smooth functions of a Hermitian matrix on a quantum computer
• Quantum Pseudo-fractional Fourier Transform and its application to quantum phase estimation
• Quantum Algorithms in Cybernetics
• Quantum spectral analysis: frequency in time, with applications to signal and image processing