Will We Ever Have a Quantum Computer?

  • Mikhail I. Dyakonov

Part of the SpringerBriefs in Physics book series (SpringerBriefs in Physics)

Table of contents

  1. Front Matter
    Pages i-xi
  2. Mikhail I. Dyakonov
    Pages 15-20
  3. Mikhail I. Dyakonov
    Pages 33-37
  4. Mikhail I. Dyakonov
    Pages 39-43
  5. Back Matter
    Pages 45-49

About this book


This book addresses a broad community of physicists, engineers, computer scientists and industry professionals, as well as the general public, who are aware of the unprecedented media hype surrounding the supposedly imminent new era of quantum computing. The central argument of this book is that the feasibility of quantum computing in the physical world is extremely doubtful. The hypothetical quantum computer is not simply a quantum variant of the conventional digital computer, but rather a quantum extension of a classical analog computer operating with continuous parameters. In order to have a useful machine, the number of continuous parameters to control would have to be of such an astronomically large magnitude as to render the endeavor virtually infeasible. This viewpoint is based on the author’s expert understanding of the gargantuan challenges that would have to be overcome to ever make quantum computing a reality. Knowledge of secondary-school-level physics and math will be sufficient for understanding most of the text; the few paragraphs that are more technical are highlighted in italics.


Future of Quantum Computing Quantum Winter Shor's Factoring Algorithm Continuous-Variable Qubit Fault-Tolerant Quantum Computation

Authors and affiliations

  • Mikhail I. Dyakonov
    • 1
  1. 1.Laboratoire Charles CoulombUniversité de MontpellierMontpellierFrance

Bibliographic information

  • DOI
  • Copyright Information The Author(s), under exclusive license to Springer Nature Switzerland AG 2020
  • Publisher Name Springer, Cham
  • eBook Packages Physics and Astronomy
  • Print ISBN 978-3-030-42018-5
  • Online ISBN 978-3-030-42019-2
  • Series Print ISSN 2191-5423
  • Series Online ISSN 2191-5431
  • Buy this book on publisher's site