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 task1.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer
About this chapter
Cite this chapter
Diósi, L. (2007). Q-computation. In: A Short Course in Quantum Information Theory. Lecture Notes in Physics, vol 713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-38996-2_11
Download citation
DOI: https://doi.org/10.1007/3-540-38996-2_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38994-1
Online ISBN: 978-3-540-38996-5
eBook Packages: Physics and AstronomyPhysics and Astronomy (R0)