Quantum algorithms offer efficient solutions to computational problems that are expensive to solve classically. Publicly available quantum computers, such as those provided by IBM, can now be used to run small quantum circuits that execute quantum algorithms. However, these quantum computers are highly prone to noise. Here, we introduce important concepts of quantum circuit noise and connectivity that must be addressed to obtain reliable results on quantum computers. We utilize several examples to show how noise scales with circuit depth. We present Simon's algorithm, a quantum algorithm for solving a computational problem of the same name, explain how to implement it in IBM's Qiskit platform, and compare the results of running it both on a noiseless simulator and on physical hardware subject to noise. We discuss the impact of Qiskit's transpiler, which adapts ideal quantum circuits for physical hardware with limited connectivity between qubits. We show that even circuits of only a few qubits can have their success rate significantly reduced by quantum noise unless specific measures are taken to minimize its impact.
REFERENCES
1.
Richard P.
Feynman
, “
Quantum mechanical computers
,” Opt. News
11
, 11
–20
(1985
).2.
Peter W.
Shor
, “
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
,” SIAM Rev.
41
, 303
–332
(1999
).3.
Edward
Gerjuoy
, “
Shor's factoring algorithm and modern cryptography. An illustration of the capabilities inherent in quantum computers
,” Am. J. Phys.
73
, 521
–540
(2005
).4.
Lov K.
Grover
, “
A fast quantum mechanical algorithm for database search
,” in STOC 1996: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing
(1996
).5.
Lov K.
Grover
, “
From Schrödinger's equation to the quantum search algorithm
,” Am. J. Phys.
69
, 769
–777
(2001
).6.
Aram W.
Harrow
,
Avinatan
Hassidim
, and
Seth
Lloyd
, “
Quantum algorithm for linear systems of equations
,” Phys. Rev. Lett.
103
, 150502
(2009
).7.
Maria
Schuld
,
Ilya
Sinayskiy
, and
Francesco
Petruccione
, “
An introduction to quantum machine learning
,” Contemp. Phys.
56
, 172
–185
(2014
).8.
Wikipedia has an extensive list of companies involved in quantum computing or communication <https://en.wikipedia.org/wiki/List_of_companies_involved_in_quantum_computing_or_communication> (last accessed December 30,
2020
).9.
Michel H.
Devoret
,
John M.
Martinis
, and
John
Clarke
, “
Measurements of macroscopic quantum tunneling out of the zero-voltage state of a current-biased Josephson junction
,” Phys. Rev. Lett.
55
, 1908
–1911
(1985
).10.
Frank
Arute
et al, “
Quantum supremacy using a programmable superconducting processor
,” Nature
574
, 505
–510
(2019
).11.
Christopher
Monroe
,
Michael G.
Raymer
, and
Jacob
Taylor
, “
The U.S. National Quantum Initiative: From act to action
,” Science
364
, 440
–442
(2019
).12.
National Academies of Sciences, Engineering, and Medicine
, in Quantum Computing: Progress and Prospects
, edited by
Emily
Grumbling
and
Mark
Horowitz
(
The National Academies Press
,
Washington, DC
, 2019
).13.
Frederick W.
Strauch
, “
Resource letter QI-1: Quantum information
,” Am. J. Phys.
84
, 495
–507
(2016
).14.
D.
Candela
, “
Undergraduate computational physics projects on quantum computing
,” Am. J. Phys.
83
, 688
–702
(2015
).15.
Yohan
Vianna
,
Mariana R.
Barros
, and
Malena
Hor-Meyll
, “
Classical realization of the quantum Deutsch algorithm
,” Am. J. Phys.
86
, 914
–923
(2018
).16.
Isaac
Chuang
and
Michael
Nielsen
, Quantum Computation and Quantum Information
(
Cambridge U. P.
, Cambridge
, 2000
).17.
N.
David Mermin
, Quantum Computer Science
(
Cambridge U. P.
, Cambridge
, 2007
).18.
Abraham
Asfaw
et al, Learn quantum computation using Qiskit <https://qiskit.org/textbook/preface.html> (2020
).19.
Daniel
Koch
,
Laura
Wessing
, and
Paul M.
Alsing
, “
Introduction to coding quantum algorithms: A tutorial series using Qiskit
,” e-print arXiv:1903.04359v1 (2019
).20.
Daniel
Koch
et al, “
Fundamentals in quantum algorithms: A tutorial series using Qiskit continued
,” e-print arXiv:2008.10647 (2020
).21.
Javier
Rodríguez-Laguna
and
Silvia N.
Santalla
, “
Building an adiabatic quantum computer simulation in the classroom
,” Am. J. Phys.
86
, 360
–367
(2018
).22.
N. David
Mermin
, “
From Cbits to Qbits: Teaching computer scientists quantum mechanics
,” Am. J. Phys.
71
, 23
–30
(2003
).23.
Chih-Chieh
Chen
et al, “
Hybrid classical-quantum linear solver using Noisy Intermediate-Scale Quantum machines
,” Sci. Rep.
9
, 16251
(2019
).24.
Sima E.
Borujeni
et al, “
Quantum circuit representation of Bayesian networks
,” Expert Syst. Appl.
176
, 114768
(2020
).25.
James
R. Wootton
, “
Benchmarking near-term devices with quantum error correction
,” Quantum Sci. Technol.
5
, 044044
(2020
).26.
Announcement by the National Science Foundation on May 18, 2020 <https://www.nsf.gov/news/special_reports/announcements/051820.jsp> (last accessed December 30,
2020
).27.
Daniel R.
Simon
, “
On the power of quantum computation
,” in 1994 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
(
Institute of Electrical and Electronic Engineers Computer Society Press
, 1994
), pp. 115
–123
.28.
Some preliminary results of this analysis were submitted for presentation at the 2020 Annual Conference of the Utah Academy of Sciences, Arts, and Letters and are included in its proceedings.
29.
See supplementary material at https://www.scitation.org/doi/suppl/10.1119/10.0006204 for several appendixes that expand and clarify our discussion and results.
30.
Supplementary material: Demonstration of transpilation effects in Qiskit <https://github.com/Dot145/QiskitTranspilationNoise/blob/master/QuantumNoiseInQiskit.ipynb>.”
31.
Philip
Krantz
et al, “
A quantum engineer's guide to superconducting qubits
,” Appl. Phys. Rev.
6
, 021318
(2019
).32.
For an enlightening description of noise sources by Will Oliver, see <https://youtu.be/aGAb-GbrvMU?t<983> (last accessed December 30,
2020
).33.
See the IBM Research Blog post on dealing with errors in quantum computers a <https://www.ibm.com/blogs/research/2014/06/dealing-with-errors-in-quantum-computing/> (last accessed December 30,
2020
).34.
Adriano
Barenco
et al, “
Approximate quantum Fourier transform and decoherence
,” Phys. Rev. A
54
, 139
–146
(1996
).35.
See Eq. (2.37) in Ref. 17.
36.
See Eq. (2.40) and the discussion leading up to it in Ref. 17.
37.
Y. S.
Nam
and
R.
Blümel
, “
Robustness of the quantum Fourier transform with respect to static gate defects
,” Phys. Rev. A
89
, 042337
(2014
).38.
Gadi
Aleksandrowicz
et al, “Qiskit: An open-source framework for quantum computing,” Zenodo (2019
).39.
Information on IBM quantum simulators can be found at <https://www.ibm.com/quantum-computing/simulator/> (last accessed December 30, 2020).
40.
See the Qiskit page with information installing the package at <https://qiskit.org/documentation/install.html#installing-qiskit> (last accessed December 30, 2020).
41.
The Qiskit blog on medium is a helpful source for using Qiskit. It can be found at <https://medium.com/@qiskit> (last accessed December 30, 2020).
42.
Qiskit also has a YouTube channel with video lectures and helpful tutorials at <https://www.youtube.com/c/qiskit> (last accessed December 30, 2020).
43.
Clara R.
Woods
, “
Evaluating IBM's quantum compiler and quantum computer architectures as they pertain to quantum walk simulation algorithms
,” Honors thesis (
University of California
,
San Diego
, 2019
).44.
See the Qiskit webpage on its transpiler, which can be found at <https://qiskit.org/documentation/apidoc/transpiler.html#supplementary-information> (last accessed December 30, 2020).
45.
Krysta M.
Svore
,
Matthew B.
Hastings
, and
Michael
Freedman
, “
Faster phase estimation
,” arXiv:1304.0741 (2013
).46.
Pedro M. Q.
Cruz
et al, “
Optimizing quantum phase estimation for the simulation of Hamiltonian eigenstates
,” Quantum Sci. Technol.
5
, 044005
(2020
).47.
These and other quantum computers at IBM can be accessed easily via the IBM Quantum Experience, located at <https://quantum-computing.ibm.com/> (last accessed December 30, 2020).
48.
Joschka
Roffe
, “
Quantum error correction: An introductory guide
,” Contemp. Phys.
60
, 225
–245
(2019
).© 2021 Author(s). Published under an exclusive license by American Association of Physics Teachers.
2021
Author(s)
AAPT members receive access to the American Journal of Physics and The Physics Teacher as a member benefit. To learn more about this member benefit and becoming an AAPT member, visit the Joining AAPT page.
