RUS  ENG
Full version
JOURNALS // Izvestiya of Saratov University. Mathematics. Mechanics. Informatics // Archive

Izv. Saratov Univ. Math. Mech. Inform., 2016 Volume 16, Issue 1, Pages 104–112 (Mi isu625)

This article is cited in 2 papers

Computer Sciences

Quantum computers and quantum algorithms. Part 2. Quantum algorithms

V. M. Solovyev

Saratov State University, 83, Astrakhanskaya st., Saratov, Russia, 410012

Abstract: The paper discusses principles of construction for quantum algorithms and their main features. Distinction of quantum parallelism from classical methods of high-performance computing is shown. Quantum algorithms design strategy is presented based on quantum circuits. Methods of programming for implementation of quantum algorithms using high-level languages are proposed. An approach to implement unitary transformations based on the oracle method is described.

Key words: quantum computing, quantum computers, quantum algorithms, qubit, quantum gate, quantum superposition, quantum entanglement, quantum parallelism, quantum interference, oracle, quantum-programming languages.

UDC: 519.688

DOI: 10.18500/1816-9791-2016-16-1-104-112



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025