Introduction to Quantum Algorithms
| dc.creator | Shor, Peter W. | |
| dc.date | 2000-04-29 | |
| dc.date | 2001-07-06 | |
| dc.date.accessioned | 2026-07-07T05:59:54Z | |
| dc.date.available | 2026-07-07T05:59:54Z | |
| dc.description | These notes discuss the quantum algorithms we know of that can solve problems significantly faster than the corresponding classical algorithms. So far, we have only discovered a few techniques which can produce speed up versus classical algorithms. It is not clear yet whether the reason for this is that we do not have enough intuition to discover more techniques, or that there are only a few problems for which quantum computers can significantly speed up the solution. | |
| dc.description | 17 pages, latex, notes for talk given for the short course at the January 2000 American Math Society meeting, minor errors corrected in version 2 | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0005003 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0005003 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/88857 | |
| dc.subject | Quantum Physics | |
| dc.title | Introduction to Quantum Algorithms | |
| dc.type | text |