EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Quantum Algorithm Implementations for Beginners

Abhijith J., Adetokunbo Adedoyin, John Ambrosiano, Petr Anisimov, William Casper, Gopinath Chennupati, Carleton Coffrin, Hristo Djidjev, David Gunter, Satish Karra, Nathan Lemons, Shizeng Lin und 22 weitere

ACM Transactions on Quantum Computing · 31.12.2022 · 3 (4) · 1-92

DOI: 10.1145/3517340 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM Transactions on Quantum Computing, online erschienen am 07.07.2022. Verfasst von Abhijith J. und 33 weiteren Autor:innen. Die Arbeit wurde bisher 69-mal zitiert (Crossref) und nennt 138 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

As quantum computers become available to the general public, the need has arisen to train a cohort of quantum programmers, many of whom have been developing classical computer programs for most of their careers. While currently available quantum computers have less than 100 qubits, quantum computing hardware is widely expected to grow in terms of qubit count, quality, and connectivity. This review aims at explaining the principles of quantum programming, which are quite different from classical programming, with straightforward algebra that makes understanding of the underlying fascinating quantum mechanical principles optional. We give an introduction to quantum computing algorithms and their implementation on real quantum hardware. We survey 20 different quantum algorithms, attempting to describe each in a succinct and self-contained fashion. We show how these algorithms can be implemented on IBM’s quantum computer, and in each case, we discuss the results of the implementation with respect to differences between the simulator and the actual hardware runs. This article introduces computer scientists, physicists, and engineers to quantum algorithms and provides a blueprint for their implementations.

Zitieren

APA

J., A., Adedoyin, A., Ambrosiano, J., Anisimov, P., Casper, W., Chennupati, G., Coffrin, C., Djidjev, H., Gunter, D., Karra, S., Lemons, N., Lin, S., Malyzhenkov, A., Mascarenas, D., Mniszewski, S., Nadiga, B., O’malley, D., Oyen, D., Pakin, S., …, & Lokhov, A. Y. (2022). Quantum Algorithm Implementations for Beginners. ACM Transactions on Quantum Computing, 3(4), 1-92. https://doi.org/10.1145/3517340

Vancouver

J. A, Adedoyin A, Ambrosiano J, Anisimov P, Casper W, Chennupati G, et al. Quantum Algorithm Implementations for Beginners. ACM Transactions on Quantum Computing. 2022;3(4):1-92. doi:10.1145/3517340

BibTeX
@article{J2022,
  author = {J., Abhijith and Adedoyin, Adetokunbo and Ambrosiano, John and Anisimov, Petr and Casper, William and Chennupati, Gopinath and Coffrin, Carleton and Djidjev, Hristo and Gunter, David and Karra, Satish and Lemons, Nathan and Lin, Shizeng and Malyzhenkov, Alexander and Mascarenas, David and Mniszewski, Susan and Nadiga, Balu and O’malley, Daniel and Oyen, Diane and Pakin, Scott and Prasad, Lakshman and Roberts, Randy and Romero, Phillip and Santhi, Nandakishore and Sinitsyn, Nikolai and Swart, Pieter J. and Wendelberger, James G. and Yoon, Boram and Zamora, Richard and Zhu, Wei and Eidenbenz, Stephan and Bärtschi, Andreas and Coles, Patrick J. and Vuffray, Marc and Lokhov, Andrey Y.},
  title = {Quantum Algorithm Implementations for Beginners},
  journal = {ACM Transactions on Quantum Computing},
  year = {2022},
  volume = {3},
  number = {4},
  pages = {1--92},
  doi = {10.1145/3517340}
}
Kostenlos starten →