About the quantum mechanical speeding up of classical algorithms
| dc.creator | Ozhigov, Yuri | |
| dc.date | 1997-06-02 | |
| dc.date | 1997-07-06 | |
| dc.date.accessioned | 2026-07-07T09:05:14Z | |
| dc.date.available | 2026-07-07T09:05:14Z | |
| dc.description | This work introduces a relative diffusion transformation (RDT) - a simple unitary transformation which acts in a subspace, localized by an oracle. Such a transformation can not be fulfilled on quantum Turing machines with this oracle in polynomial time in general case. It is proved, that every function computable in time T and space S on classical 1-dimensional cellular automaton, can be computed with certainty in time O(S \sqrt T) on quantum computer with RDTs over the parts of intermediate products of classical computation. This requires multiprocessor, which consists of \sqrt T quantum devices each of O(S) size, working in parallel-serial mode and interacting by classical lows. | |
| dc.description | 9 pages, LATEX, 2 figures in one GIF-file (the essential revision of the previous version, some errors are corrected) | |
| dc.identifier | https://arxiv.org/abs/quant-ph/9706003 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/9706003 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/149641 | |
| dc.subject | Quantum Physics | |
| dc.title | About the quantum mechanical speeding up of classical algorithms | |
| dc.type | text |