Q-computation

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

Classical digital computer performs its algorithm via one- and two-bit operations realized by one- and two-bit "gates". The (yet hypothetic) q-digital computer would do the same. The classical logical gates become q-gates, their "circuits" are called q-circuits. They can perform what is called q-parallel computation. Q-algorithms are always reversible. Therefore we learn classical reversible computation first then we discuss the earliest q-algorithms that might overcome all classical algorithms targeting a similar task.

Original languageEnglish
Title of host publicationA Short Course in Quantum Information Theory
Subtitle of host publicationAn Approach From Theoretical Physics
Pages99-107+123-124
DOIs
Publication statusPublished - Mar 5 2007

Publication series

NameLecture Notes in Physics
Volume713
ISSN (Print)0075-8450

    Fingerprint

ASJC Scopus subject areas

  • Physics and Astronomy (miscellaneous)

Cite this

Diósi, L. (2007). Q-computation. In A Short Course in Quantum Information Theory: An Approach From Theoretical Physics (pp. 99-107+123-124). (Lecture Notes in Physics; Vol. 713). https://doi.org/10.1007/3-540-38996-2_11