Cargando…
The Complexity of Noise: A Philosophical Outlook on Quantum Error Correction
In quantum computing, where algorithms exist that can solve computational problems more efficiently than any known classical algorithms, the elimination of errors that result from external disturbances or from imperfect gates has become the "holy grail," and a worldwide quest for a...
Autor principal: | |
---|---|
Lenguaje: | eng |
Publicado: |
Morgan & Claypool Publishers
2010
|
Materias: | |
Acceso en línea: | http://cds.cern.ch/record/1486578 |
_version_ | 1780926151273742336 |
---|---|
author | Hagar, Amit |
author_facet | Hagar, Amit |
author_sort | Hagar, Amit |
collection | CERN |
description | In quantum computing, where algorithms exist that can solve computational problems more efficiently than any known classical algorithms, the elimination of errors that result from external disturbances or from imperfect gates has become the "holy grail," and a worldwide quest for a large scale fault-tolerant, and computationally superior, quantum computer is currently taking place. Optimists rely on the premise that, under a certain threshold of errors, an arbitrary long fault-tolerant quantum computation can be achieved with only moderate (i.e., at most polynomial) overhead in compu |
id | cern-1486578 |
institution | Organización Europea para la Investigación Nuclear |
language | eng |
publishDate | 2010 |
publisher | Morgan & Claypool Publishers |
record_format | invenio |
spelling | cern-14865782021-04-22T00:16:55Zhttp://cds.cern.ch/record/1486578engHagar, AmitThe Complexity of Noise: A Philosophical Outlook on Quantum Error CorrectionComputing and ComputersIn quantum computing, where algorithms exist that can solve computational problems more efficiently than any known classical algorithms, the elimination of errors that result from external disturbances or from imperfect gates has become the "holy grail," and a worldwide quest for a large scale fault-tolerant, and computationally superior, quantum computer is currently taking place. Optimists rely on the premise that, under a certain threshold of errors, an arbitrary long fault-tolerant quantum computation can be achieved with only moderate (i.e., at most polynomial) overhead in compuMorgan & Claypool Publishersoai:cds.cern.ch:14865782010 |
spellingShingle | Computing and Computers Hagar, Amit The Complexity of Noise: A Philosophical Outlook on Quantum Error Correction |
title | The Complexity of Noise: A Philosophical Outlook on Quantum Error Correction |
title_full | The Complexity of Noise: A Philosophical Outlook on Quantum Error Correction |
title_fullStr | The Complexity of Noise: A Philosophical Outlook on Quantum Error Correction |
title_full_unstemmed | The Complexity of Noise: A Philosophical Outlook on Quantum Error Correction |
title_short | The Complexity of Noise: A Philosophical Outlook on Quantum Error Correction |
title_sort | complexity of noise: a philosophical outlook on quantum error correction |
topic | Computing and Computers |
url | http://cds.cern.ch/record/1486578 |
work_keys_str_mv | AT hagaramit thecomplexityofnoiseaphilosophicaloutlookonquantumerrorcorrection AT hagaramit complexityofnoiseaphilosophicaloutlookonquantumerrorcorrection |