• Rapid Communication

Engineering functional quantum algorithms

Andreas Klappenecker and Martin Rötteler
Phys. Rev. A 67, 010302(R) – Published 17 January 2003
PDFExport Citation

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+m2lnm) 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.

  • Received 20 August 2002

DOI:https://doi.org/10.1103/PhysRevA.67.010302

©2003 American Physical Society

Authors & Affiliations

Andreas Klappenecker*

  • Department of Computer Science, Texas A&M University, College Station, Texas 77843-3112

Martin Rötteler

  • Forschungsgruppe Professor Beth, Insitut für Algorithmen und Kognitive Systeme, Universität Karlsruhe, D-76128 Karlsruhe, Germany

  • *Electronic address: klappi@cs.tamu.edu
  • Electronic address: roettele@ira.uka.de

References (Subscription Required)

Click to Expand
Issue

Vol. 67, Iss. 1 — January 2003

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×