Home
For authors
Submission status

Archive
Archive (English)
Current
   Volumes 113-120
   Volumes 93-112
      Volume 112
      Volume 111
      Volume 110
      Volume 109
      Volume 108
      Volume 107
      Volume 106
      Volume 105
      Volume 104
      Volume 103
      Volume 102
      Volume 101
      Volume 100
      Volume 99
      Volume 98
      Volume 97
      Volume 96
      Volume 95
      Volume 94
      Volume 93
Search
VOLUME 98 (2013) | ISSUE 8 | PAGE 573
Revisiting the hopes for scalable quantum computation
DOI: 10.7868/S0370274X13200150
Abstract
The hopes for scalable quantum computing rely on the "threshold theorem": once the error per qubit per gate is below a certain value, the methods of quantum error correction allow indefinitely long quantum computations. The proof is based on a number of assumptions, which are supposed to be satisfied exactly, like axioms, e.g. zero undesired interactions between qubits, etc. However, in the physical world no continuous quantity can be exactly zero, it can only be more or less small. Thus the "error per qubit per gate" threshold must be complemented by the required precision with which each assumption should be fulfilled. In the absence of this crucial information, the prospects of scalable quantum computing remain uncertain.