|
Эта публикация цитируется в 4 научных статьях (всего в 4 статьях)
ДИСКУССИЯ
Revisiting the hopes for scalable quantum computation
M. I. Dyakonov Laboratoire Charles Coulomb, Universite Montpellier II
Аннотация:
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.
Поступила в редакцию: 24.07.2013
Образец цитирования:
M. I. Dyakonov, “Revisiting the hopes for scalable quantum computation”, Письма в ЖЭТФ, 98:8 (2013), 573–577; JETP Letters, 98:8 (2013), 514–518
Образцы ссылок на эту страницу:
https://www.mathnet.ru/rus/jetpl3557 https://www.mathnet.ru/rus/jetpl/v98/i8/p573
|
Статистика просмотров: |
Страница аннотации: | 197 | PDF полного текста: | 67 | Список литературы: | 30 | Первая страница: | 6 |
|