Foundations of Physics

, Volume 44, Issue 8, pp 819–828

Quantum Computing’s Classical Problem, Classical Computing’s Quantum Problem


DOI: 10.1007/s10701-014-9807-z

Cite this article as:
Van Meter, R. Found Phys (2014) 44: 819. doi:10.1007/s10701-014-9807-z


Tasked with the challenge to build better and better computers, quantum computing and classical computing face the same conundrum: the success of classical computing systems. Small quantum computing systems have been demonstrated, and intermediate-scale systems are on the horizon, capable of calculating numeric results or simulating physical systems far beyond what humans can do by hand. However, to be commercially viable, they must surpass what our wildly successful, highly advanced classical computers can already do. At the same time, those classical computers continue to advance, but those advances are now constrained by thermodynamics, and will soon be limited by the discrete nature of atomic matter and ultimately quantum effects. Technological advances benefit both quantum and classical machinery, altering the competitive landscape. Can we build quantum computing systems that out-compute classical systems capable of some \(10^{30}\) logic gates per month? This article will discuss the interplay in these competing and cooperating technological trends.


Quantum computing Moore’s Law 

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  1. 1.Keio UniversityTokyoJapan

Personalised recommendations