Can quantum computer perform better than classical?
| dc.creator | Alicki, Robert | |
| dc.date | 2000-06-05 | |
| dc.date.accessioned | 2026-07-07T06:00:08Z | |
| dc.date.available | 2026-07-07T06:00:08Z | |
| dc.description | A theoretical model of a quantum device which can factorize any number N in two steps i.e. by preparing an input state and performing a measurement is discussed. The analysis reveals that the duration of state preparation and measurement is proportional to N while the energy consumption grows like log N. These results suggest the existence of Heisenberg-type relation putting limits on the efficiency of a quantum computer in terms of a total computation time, a total energy consumption and a classical complexity of the problem. | |
| dc.description | 2 pages, Revtex, no figures | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0006018 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0006018 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/88912 | |
| dc.subject | Quantum Physics | |
| dc.title | Can quantum computer perform better than classical? | |
| dc.type | text |