|
| related topics |
| {algorithm, log, probability} |
| {time, systems, information} |
| {qubit, qubits, gate} |
| {let, theorem, proof} |
| {states, state, optimal} |
| {classical, space, random} |
| {state, states, coherent} |
| {equation, function, exp} |
| {group, space, representation} |
|
About the quantum mechanical speeding up of classical algorithms
Yuri Ozhigov
abstract: 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.
- oai_identifier:
- oai:arXiv.org:quant-ph/9706003
- categories:
- quant-ph
- comments:
- 9 pages, LATEX, 2 figures in one GIF-file (the essential revision of
the previous version, some errors are corrected)
- arxiv_id:
- quant-ph/9706003
- created:
- 1997-06-02
- updated:
- 1997-07-06
Full article ▸
|
|
| related documents |
| 9905026v1 |
| 0201152v1 |
| 0505007v3 |
| 0011052v2 |
| 0511272v1 |
| 0302022v1 |
| 9903071v1 |
| 0207131v1 |
| 0306042v1 |
| 0008095v3 |
| 0210141v2 |
| 0106152v1 |
| 0109038v1 |
| 0206089v2 |
| 0010057v1 |
| 0609220v1 |
| 9901068v1 |
| 0504067v3 |
| 0010034v1 |
| 0010021v1 |
| 0609166v1 |
| 9812057v1 |
| 9803072v1 |
| 0303074v1 |
| 0304131v1 |
|