Quantum Physics and Computers
| dc.creator | Barenco, Adriano | |
| dc.date | 1996-12-02 | |
| dc.date | 1996-12-03 | |
| dc.date.accessioned | 2026-07-07T11:11:56Z | |
| dc.date.available | 2026-07-07T11:11:56Z | |
| dc.description | Recent theoretical results confirm that quantum theory provides the possibility of new ways of performing efficient calculations. The most striking example is the factoring problem. It has recently been shown that computers that exploit quantum features could factor large composite integers. This task is believed to be out of reach of classical computers as soon as the number of digits in the number to factor exceeds a certain limit. The additional power of quantum computers comes from the possibility of employing a superposition of states, of following many distinct computation paths and of producing a final output that depends on the interference of all of them. This ``quantum parallelism'' outstrips by far any parallelism that can be thought of in classical computation and is responsible for the ``exponential'' speed-up of computation. This is a non-technical (or at least not too technical) introduction to the field of quantum computation. It does not cover very recent topics, such as error-correction. | |
| dc.description | 27 pages, LaTeX, 8 PostScript figures embedded. A bug in one of the postscript files has been fixed. Reprints available from the author. The files are also available from http://eve.physics.ox.ac.uk/Articles/QC.Articles.html | |
| dc.identifier | https://arxiv.org/abs/quant-ph/9612014 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/9612014 | |
| dc.identifier | Contemp.Phys.37:375-389,1996 | |
| dc.identifier | doi:10.1080/00107519608217543 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/191259 | |
| dc.subject | Quantum Physics | |
| dc.title | Quantum Physics and Computers | |
| dc.type | text |