Quantum computers and quantum algorithms. Part 2. Quantum algorithms
Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 16 (2016) no. 1, pp. 104-112.

Voir la notice de l'article provenant de la source Math-Net.Ru

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.
@article{ISU_2016_16_1_a9,
     author = {V. M. Solovyev},
     title = {Quantum computers and quantum algorithms. {Part} 2. {Quantum} algorithms},
     journal = {Izvestiya of Saratov University. Mathematics. Mechanics. Informatics},
     pages = {104--112},
     publisher = {mathdoc},
     volume = {16},
     number = {1},
     year = {2016},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ISU_2016_16_1_a9/}
}
TY  - JOUR
AU  - V. M. Solovyev
TI  - Quantum computers and quantum algorithms. Part 2. Quantum algorithms
JO  - Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
PY  - 2016
SP  - 104
EP  - 112
VL  - 16
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ISU_2016_16_1_a9/
LA  - ru
ID  - ISU_2016_16_1_a9
ER  - 
%0 Journal Article
%A V. M. Solovyev
%T Quantum computers and quantum algorithms. Part 2. Quantum algorithms
%J Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
%D 2016
%P 104-112
%V 16
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ISU_2016_16_1_a9/
%G ru
%F ISU_2016_16_1_a9
V. M. Solovyev. Quantum computers and quantum algorithms. Part 2. Quantum algorithms. Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, Tome 16 (2016) no. 1, pp. 104-112. http://geodesic.mathdoc.fr/item/ISU_2016_16_1_a9/

[1] Solovyev V. M., “Quantum Computers and Quantum Algorithms. Pt. 1: Quantum Computers”, Izv. Saratov Univ. (N.S.), Ser. Math. Mech. Inform., 15:4 (2015), 462–477 (in Russian) | DOI

[2] Algebraic and Number Theoretic Algorithms, (accessed 23, June, 2015) http://math.nist.gov/quantum/zoo/

[3] Bogdanov U. I., Kokin A. A., Lukichev V. F., Orlikovskij A. A., Semenihin I. A., Chernavskij A. U., “Quantum mechanics and the development of information technology”, Information technologies and computer systems, 2012, no. 1, 17–31 (in Russian) | MR

[4] Venegas-Andraca S. E., Quantum Walks for Computer Scientists. Synthesis Lectures on Quantum Computing, Morgan Claypool, 2008, 133 pp.

[5] Gorbachev V. N., Zhiliba A. I., Physical basis of modern information processes or textbook on quantum teleportation, quantum computing and other issues of quantum information, Tver State University, Tver, 2001, 43 pp. (in Russian)

[6] Shor P. W., Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, 25.01.1996, 28 pp., arXiv: quant-ph/9508027 | MR

[7] Williams C. P., Explorations in Quantum Computing, Springer-Verlag London Ltd., 2011, 740 pp. | MR

[8] Closing in on quantum computing, (accessed 23, June, 2015) http://www.wired.com/2014/10/quantum-computing-close

[9] Bhambri S., Quantum Clouds: A future perspective, 05.10.2014, 14 pp., arXiv: 1410.6502v1 [cs.DC]

[10] Valiev K. A., “Quantum computers and quantum computing”, Successes of physical sciences, 175:1 (2005), 3–39 (in Russian) | DOI | MR

[11] Metodi T. S., Faruque A. I., Chong F. T., Quantum Computing for Computer Architects. Synthesis Lectures on Computer Architecture, Morgan Claypool, 2011, 203 pp.