DOI: https://doi.org/10.30970/jps.08.1
QUANTUM COMPUTERS: BASIS AND ALGORITHMS (A SHORT REVIEW)
T. Krokhmalskii
Institute for Condensed Matter Physics of the National Academy of Sciences of Ukraine
1 Svientsitskii St., Lviv, UA-79011, Ukraine
|
Journal of Physical Studies 8(1), 1–15 (2004)
DOI: https://doi.org/10.30970/jps.08.1 QUANTUM COMPUTERS: BASIS AND ALGORITHMS (A SHORT REVIEW)T. Krokhmalskii
Institute for Condensed Matter Physics of the National Academy of Sciences of Ukraine |
|
This review will help to get acquainted with the theoretical fundamentals of performing quantum computations using quantum processors which essentially exploit their quantum properties. The concepts of the function computability, algorithm complexity, classical and quantum Turing machines, as well as quantum bits, gates and networks are considered. It is clarified what effects yield superefficiency of the quantum computers in comparison with the classical ones. Several examples of effective quantum algorithms are given.
PACS number(s): 03.65.Ca, 07.05.Bx, 02.70.Rw, 89.80.+h