Izvestiya of Saratov University. Mathematics. Mechanics. Informatics
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Izv. Saratov Univ. Math. Mech. Inform.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Izvestiya of Saratov University. Mathematics. Mechanics. Informatics, 2016, Volume 16, Issue 1, Pages 104–112
DOI: https://doi.org/10.18500/1816-9791-2016-16-1-104-112 (Mi isu625) 		 
This article is cited in 1 scientific paper (total in 1 paper)

Computer Sciences

Quantum computers and quantum algorithms. Part 2. Quantum algorithms

V. M. Solovyev

Saratov State University, 83, Astrakhanskaya st., Saratov, Russia, 410012
Full-text PDF (995 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.18500/1816-9791-2016-16-1-104-112
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.
Bibliographic databases:
Document Type: Article
UDC: 519.688
Language: Russian
Citation: V. M. Solovyev, “Quantum computers and quantum algorithms. Part 2. Quantum algorithms”, Izv. Saratov Univ. Math. Mech. Inform., 16:1 (2016), 104–112
Citation in format AMSBIB
\Bibitem{Sol16}
\by V.~M.~Solovyev
\paper Quantum computers and quantum algorithms. Part 2. Quantum algorithms
\jour Izv. Saratov Univ. Math. Mech. Inform.
\yr 2016
\vol 16
\issue 1
\pages 104--112
\mathnet{http://mi.mathnet.ru/isu625}
\crossref{https://doi.org/10.18500/1816-9791-2016-16-1-104-112}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3501508}
\elib{https://elibrary.ru/item.asp?id=25897441}
Linking options:
  • https://www.mathnet.ru/eng/isu625
  • https://www.mathnet.ru/eng/isu/v16/i1/p104
    Cycle of papers
    This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Известия Саратовского университета. Новая серия. Серия Математика. Механика. Информатика
    Statistics & downloads:
    Abstract page:440
    Full-text PDF :274
    References:72
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024