Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Empirical Analysis of Strategies Employed Within an ICT Curriculum to Increase the Quantity of Graduates Read chapter Read first chapter

2021 | OriginalPaper | Chapter

What Have Google’s Random Quantum Circuit Simulation Experiments Demonstrated About Quantum Supremacy?

Authors : Jack K. Horner, John F. Symons

Published in: Advances in Software Engineering, Education, and e-Learning

Publisher: Springer International Publishing

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Quantum computing is of high interest because it promises to perform at least some kinds of computations much faster than classical computers. Arute et al. (Nature 574:505–511, 2019; Supplemental Information for Arute F et al. 2019a. File supp_info_41586_2019_1666_MOESM1_ESM.pdf. https://​static-content.​springer.​com/​esm/​art%3A10.​1038%2Fs41586-019-1666-5/​MediaObjects/​41586_​2019_​1666_​MOESM1_​ESM.​pdf. Accessed 6 February 2020, 2019) (informally, “the Google Quantum Team”) report the results of experiments that purport to demonstrate “quantum supremacy” – the claim that the performance of some quantum computers is better than that of classical computers on some problems. Do these results close the debate over quantum supremacy? We argue that they do not. In the following, we provide an overview of the Google Quantum Team’s experiments and then identify some open questions in the quest to demonstrate quantum supremacy.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now
previous chapter ECM Factorization with QRT Maps
next chapter Chess Is Primitive Recursive
Footnotes
1
For the purpose of this paper, a “classical” computer is a computer to which a finite Turing machine ([6], 44) is homomorphic.
 
2
Informally speaking, a calculation schema can be executed concurrently if more than one instance of the schema can be executed “at the same time” on a computing system. (For a more rigorous definition, see [11], esp. Chaps. 2–4).
 
3
Arute et al. [1, 2] do not explicitly claim or imply that Eq. 1 or GQS can be extrapolated for configurations other than those tested by them.
 
4
This is a generalization of a suggestion made by Gil Kalai (See [14]).
 
5
For further detail, see Symons and Horner [25].
 
6
The configuration prescriptions used in the experiments of Arute et al. [1, 2] in particular were not produced in a software development environment all of which was produced by model checking.
 
7
Even defining what “same architecture” means in the case of classical computers is complicated (see [11, 15]).
 
8
This problem is not the same as the well-known problem of induction (see, e.g., [13], Book I, Part III; [23], Section I), i.e., the problem of inferring events we haven’t observed from those we have. The quantum/classical computer comparison conundrum trades only the fact that the concepts of “state” in quantum and classical contexts are incompatible.
 
Literature
1.
2.
3.
D. Bohm, Quantum theory. Dover reprint, 1989 (1951)
4.
5.
S.H. Bokhari, Multiprocessing the sieve of Eratosthenes. IEEE Comput. 20(4), 50–58 (1984)CrossRef
6.
G.S. Boolos, J.P. Burgess, R.C. Jeffrey, Computability and Logic, 5th edn. (Cambridge, 2007)
7.
E. M. Clarke, T. A. Henzinger, H. Veith, R. Bloem (eds.), Handbook of Model Checking (Springer, 2018)MATH
8.
9.
C. Grosche, An introduction into the Feynman path integral. arXiv: hep-th/930209v1 (1993)
10.
11.
J.L. Hennessy, D.A. Patterson, Computer Architecture, Fourth edn. (Morgan Kaufmann, 2007)MATH
12.
R.V. Hogg, J.W. McKean, A.T. Craig, Introduction to Mathematical Statistics, 6th edn. (Prentice Hall, 2005)
13.
D. Hume, A Treatise of Human Nature. Ed. by L. A. Selby-Bigge. (Oxford, 1739)
14.
15.
H. Jagode, A. Danalis, H. Anzt, J. Dongarra, PAPI software-defined events for in-depth performance analysis. Int. J. High Perform. Comput. Appl. 33, 1113–1127 (2019)CrossRef
16.
D. Kuzmin, J. Hämäläinen, Finite Element Methods for Computational Fluid Dynamics: A Practical Guide (SIAM, 2014)CrossRef
17.
18.
A. Messiah, Quantum Mechanics. Trans. by G. H. Temmer and J. Potter. Dover reprint, 1999 (1958)
19.
M.A. Nielsen, I.L. Chuang, Quantum Computation and Quantum Information. 10th Anniversary Edition. (Cambridge, 2010)
20.
P.D.T. O'Connor, Practical Reliability Engineering, 4th edn. (Wiley, 2002)
21.
R. Patton, Software Testing, 2nd edn. (Sams Publishing, Indianapolis, 2005)
22.
B. Russell, A.N. Whitehead, Principia Mathematica, vol I (Merchant Books, 1910)MATH
23.
W.C. Salmon, The Foundations of Scientific Inference (University of Pittsburgh Press, 1966)
24.
J.F. Symons, J.K. Horner, Software intensive science. Philos. Technol. 27, 461–477 (2014)CrossRef
25.
J.F. Symons, J.K. Horner, Software error as a limit to inquiry for finite agents: Challenges for the post-human scientist, in Philosophy and Computing: Essays in Epistemology, Philosophy of Mind, Logic, and Ethics, ed. by T. M. Powers, (Springer, New York, 2017), pp. 85–98CrossRef
26.
27.
A. Valmari, The state explosion problem, in Lectures on Petri Nets I: Basic Models, Lectures in Computer Science 1491, (Springer, 1998), pp. 429–528CrossRef
Metadata
Title
What Have Google’s Random Quantum Circuit Simulation Experiments Demonstrated About Quantum Supremacy?
Authors
Jack K. Horner
John F. Symons
Copyright Year
2021
Book
Advances in Software Engineering, Education, and e-Learning

Print ISBN: 978-3-030-70872-6

Electronic ISBN: 978-3-030-70873-3

Copyright Year: 2021

DOI
https://doi.org/10.1007/978-3-030-70873-3_29