当前位置: X-MOL 学术arXiv.cs.ET › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Quantum Algorithm Implementations for Beginners
arXiv - CS - Emerging Technologies Pub Date : 2018-04-10 , DOI: arxiv-1804.03719
Abhijith J., Adetokunbo Adedoyin, John Ambrosiano, Petr Anisimov, Andreas B\"artschi, William Casper, Gopinath Chennupati, Carleton Coffrin, Hristo Djidjev, David Gunter, Satish Karra, Nathan Lemons, Shizeng Lin, Alexander Malyzhenkov, David Mascarenas, Susan Mniszewski, Balu Nadiga, Daniel O'Malley, Diane Oyen, Scott Pakin, Lakshman Prasad, Randy Roberts, Phillip Romero, Nandakishore Santhi, Nikolai Sinitsyn, Pieter J. Swart, James G. Wendelberger, Boram Yoon, Richard Zamora, Wei Zhu, Stephan Eidenbenz, Patrick J. Coles, Marc Vuffray, Andrey Y. Lokhov

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 to explain 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.

中文翻译:

初学者的量子算法实现

随着公众可以使用量子计算机,需要培养一批量子程序员,其中许多人的大部分职业生涯都在开发经典计算机程序。虽然目前可用的量子计算机少于 100 个量子位,但人们普遍预计量子计算硬件将在量子位数量、质量和连接性方面增长。这篇综述旨在解释量子编程的原理,这些原理与经典编程有很大的不同,用简单的代数来理解潜在的迷人的量子力学原理是可选的。我们介绍了量子计算算法及其在真实量子硬件上的实现。我们调查了 20 种不同的量子算法,试图以简洁和独立的方式描述每一种算法。我们展示了如何在 IBM 的量子计算机上实现这些算法,并且在每种情况下,我们都会根据模拟器和实际硬件运行之间的差异讨论实现结果。本文向计算机科学家、物理学家和工程师介绍了量子算法,并为其实现提供了蓝图。
更新日期:2020-03-20
down
wechat
bug