Skip to main content
Erschienen in: Ethics and Information Technology 4/2017

15.09.2017 | Original Paper

The potential impact of quantum computers on society

verfasst von: Ronald de Wolf

Erschienen in: Ethics and Information Technology | Ausgabe 4/2017

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

This paper considers the potential impact that the nascent technology of quantum computing may have on society. It focuses on three areas: cryptography, optimization, and simulation of quantum systems. We will also discuss some ethical aspects of these developments, and ways to mitigate the risks.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

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!

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!

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!

Fußnoten
1
The first digital computers were built a few years later. Of course, there was already much earlier (informal) work, like Pascal and Leibniz’s 17th century work on machines for arithmetic calculations, Babbage and Lovelace’s 19th century work on the Analytical Engine, and even the still-mysterious 1st century BC Antikythera mechanism.
 
2
In the theory of computing, a computational problem is considered “easy” if it can be computed by an algorithm whose running time grows at most polynomially with the input length (i.e., a running time like n 2 or n 3 for inputs of n bits). Otherwise the problem is considered “hard”; often such hard problems take a running time that grows exponentially or nearly-exponentially with the input length n. The latter type of problem is not solvable in reasonable amounts of time for large input length.
 
3
Under several idealizing assumptions that are approximately true in practice: quantum mechanics is the correct description of Nature; Alice’s lab and Bob’s lab is secure from the eavesdropper; their communication channel is “authenticated” (they know they’re talking to one another); and their apparatuses have low and benign errors.
 
4
If neither post-quantum nor quantum cryptography works, then as a last resort one can always put one’s secrets on a high-quality memory device detached from the internet and put this (or even a print-out) in a physical safe. However, this has many obvious disadvantages over computer-based cryptography.
 
5
In contrast, running Shor’s algorithm to break current cryptography would require thousands or even millions of qubits, depending on how error-free we can make these qubits and the operations upon them.
 
6
These ethical issues are not really specific to quantum computers—they would apply also in case of much faster classical computers and/or much better classical algorithms. However, we expect the improvements in classical hardware to slow down (the end of Moore’s law is near), and we do not expect much faster classical algorithms for problems like factoring large numbers or simulating quantum systems.
 
Literatur
Zurück zum Zitat Aaronson, S. (2008). The limits of quantum computers. Scientific American, 298, 62–69.CrossRef Aaronson, S. (2008). The limits of quantum computers. Scientific American, 298, 62–69.CrossRef
Zurück zum Zitat Bennett, C. H., Brassard, G. (1984). Quantum cryptography: Public key distribution and coin tossing, Proceedings of the IEEE International Conference on Computers, Systems and Signal Processing, pp. 175–179 Bennett, C. H., Brassard, G. (1984). Quantum cryptography: Public key distribution and coin tossing, Proceedings of the IEEE International Conference on Computers, Systems and Signal Processing, pp. 175–179
Zurück zum Zitat Deutsch, D. (1998). The fabric of reality: The science of parallel universes–and its implications. London: Penguin Books. Deutsch, D. (1998). The fabric of reality: The science of parallel universes–and its implications. London: Penguin Books.
Zurück zum Zitat Dürr, C., Høyer, P. (1996). A quantum algorithm for finding the minimum. quant-ph/9607014, 18 Dürr, C., Høyer, P. (1996). A quantum algorithm for finding the minimum. quant-ph/9607014, 18
Zurück zum Zitat Dürr, C., Heiligman, M., Høyer, P., & Mhalla, M. (2006). Quantum query complexity of some graph problems. SIAM Journal on Computing, 35(6), 1310–1328. (Earlier version in ICALP’04. quant-ph/0401091).CrossRefMATHMathSciNet Dürr, C., Heiligman, M., Høyer, P., & Mhalla, M. (2006). Quantum query complexity of some graph problems. SIAM Journal on Computing, 35(6), 1310–1328. (Earlier version in ICALP’04. quant-ph/0401091).CrossRefMATHMathSciNet
Zurück zum Zitat Drucker, A., de Wolf, R. (2011). Quantum proofs for classical theorems. Theory of Computing. ToC Library, Graduate Surveys 2. arXiv:0910.3376 Drucker, A., de Wolf, R. (2011). Quantum proofs for classical theorems. Theory of Computing. ToC Library, Graduate Surveys 2. arXiv:​0910.​3376
Zurück zum Zitat Feynman, R. (1982). Simulating physics with computers. International Journal of Theoretical Physics, 21(6/7), 467–488.CrossRefMathSciNet Feynman, R. (1982). Simulating physics with computers. International Journal of Theoretical Physics, 21(6/7), 467–488.CrossRefMathSciNet
Zurück zum Zitat Grover, L.K. (1996). A fast quantum mechanical algorithm for database search, Proceedings of 28th ACM STOC, pp. 212–219, quant-ph/9605043 Grover, L.K. (1996). A fast quantum mechanical algorithm for database search, Proceedings of 28th ACM STOC, pp. 212–219, quant-ph/9605043
Zurück zum Zitat Poulin, D., Hastings, M. B., Wecker, D., Wiebe, N., Doherty, A. C., & Troyer, M. (2015). The Trotter step size required for accurate quantum simulation of quantum chemistry. Quantum Information and Computation, 15(5 & 6), 361i–384. arXiv:1406.4920.MathSciNet Poulin, D., Hastings, M. B., Wecker, D., Wiebe, N., Doherty, A. C., & Troyer, M. (2015). The Trotter step size required for accurate quantum simulation of quantum chemistry. Quantum Information and Computation, 15(5 & 6), 361i–384. arXiv:​1406.​4920.MathSciNet
Zurück zum Zitat Reiher, M., Wiebe, N., Svore, K., Wecker, D., & Troyer, M. (2017). Elucidating reaction mechanisms on quantum computers. Proceedings of the National Academy of Sciences, 114(29), 7555–7560. arXiv:1605.03590.CrossRef Reiher, M., Wiebe, N., Svore, K., Wecker, D., & Troyer, M. (2017). Elucidating reaction mechanisms on quantum computers. Proceedings of the National Academy of Sciences, 114(29), 7555–7560. arXiv:​1605.​03590.CrossRef
Zurück zum Zitat Shor, P. W. (1997). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5), 1484–1509. (Earlier version in FOCS’94. quant-ph/9508027).CrossRefMATHMathSciNet Shor, P. W. (1997). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5), 1484–1509. (Earlier version in FOCS’94. quant-ph/9508027).CrossRefMATHMathSciNet
Zurück zum Zitat Suetonius (2007) The Twelve Caesars. Penguin Classics. Translated by Robert Graves Suetonius (2007) The Twelve Caesars. Penguin Classics. Translated by Robert Graves
Zurück zum Zitat Turing, A. M. (1936). On computable numbers, with an application to the Entscheidungproblem. Proceedings of the London Mathematical Society, Vol. 42, pp. 230–265. Correction, ibidem (Vol. 43), pp. 544–546 Turing, A. M. (1936). On computable numbers, with an application to the Entscheidungproblem. Proceedings of the London Mathematical Society, Vol. 42, pp. 230–265. Correction, ibidem (Vol. 43), pp. 544–546
Zurück zum Zitat Whitfield, J. D., Love, P. J., & Aspuru-Guzik, A. (2013). Computational complexity in electronic structure. Physical Chemistry Chemical Physics, 15(2), 397–411. arXiv:1208.3334.CrossRef Whitfield, J. D., Love, P. J., & Aspuru-Guzik, A. (2013). Computational complexity in electronic structure. Physical Chemistry Chemical Physics, 15(2), 397–411. arXiv:​1208.​3334.CrossRef
Metadaten
Titel
The potential impact of quantum computers on society
verfasst von
Ronald de Wolf
Publikationsdatum
15.09.2017
Verlag
Springer Netherlands
Erschienen in
Ethics and Information Technology / Ausgabe 4/2017
Print ISSN: 1388-1957
Elektronische ISSN: 1572-8439
DOI
https://doi.org/10.1007/s10676-017-9439-z

Weitere Artikel der Ausgabe 4/2017

Ethics and Information Technology 4/2017 Zur Ausgabe