The cost of quantum gate primitives

Soonchil Lee, Seong Joo Lee, Taegon Kim, Jae Seung Lee, Jacob Biamonte, Marek Perkowski

Research output: Contribution to journalArticle

19 Scopus citations

Abstract

The cost of the most frequently used gates in quantum computation is estimated by counting the sequence of basic physical operations required for implementation on a quantum computer. The sequence of physical operations comprising each gate is minimized using a software algorithm based on commutation rules. Because operation costs are machine dependent, an ideal practical quantum computer is presented and used for calculations. The presented gate costs are not necessarily minimal; however at least they provide reference to the upper bound.

Original languageEnglish (US)
Pages (from-to)561-573
Number of pages13
JournalJournal of Multiple-Valued Logic and Soft Computing
Volume12
Issue number5-6
StatePublished - Dec 1 2006

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Logic

Fingerprint Dive into the research topics of 'The cost of quantum gate primitives'. Together they form a unique fingerprint.

  • Cite this

    Lee, S., Lee, S. J., Kim, T., Lee, J. S., Biamonte, J., & Perkowski, M. (2006). The cost of quantum gate primitives. Journal of Multiple-Valued Logic and Soft Computing, 12(5-6), 561-573.