|
| related topics |
| {qubit, qubits, gate} |
| {particle, mechanics, theory} |
| {key, protocol, security} |
| {measurement, state, measurements} |
| {theory, mechanics, state} |
| {algorithm, log, probability} |
| {spin, pulse, spins} |
| {state, phys, rev} |
| {classical, space, random} |
| {wave, scattering, interference} |
| {phase, path, phys} |
|
Semiclassical Fourier Transform for Quantum Computation
Robert B. Griffiths, Chi-Sheng Niu
abstract: Shor's algorithms for factorization and discrete logarithms on a quantum
computer employ Fourier transforms preceding a final measurement. It is shown
that such a Fourier transform can be carried out in a semi-classical way in
which a ``classical'' (macroscopic) signal resulting from the measurement of
one bit (embodied in a two-state quantum system) is employed to determine the
type of measurement carried out on the next bit, and so forth. In this way the
two-bit gates in the Fourier transform can all be replaced by a smaller number
of one-bit gates controlled by classical signals. Success in simplifying the
Fourier transform suggests that it may be worthwhile looking for other ways of
using semi-classical methods in quantum computing.
- oai_identifier:
- oai:arXiv.org:quant-ph/9511007
- categories:
- quant-ph
- comments:
- Latex 6 pages, two figures on one page in uuencoded Postscript
- doi:
- 10.1103/PhysRevLett.76.3228
- arxiv_id:
- quant-ph/9511007
- journal_ref:
- Phys.Rev.Lett. 76 (1996) 3228-3231
- created:
- 1995-11-07
Full article ▸
|
|
| related documents |
| 0610214v3 |
| 0601183v1 |
| 0104069v2 |
| 0505122v2 |
| 0512058v3 |
| 0204118v2 |
| 0411058v1 |
| 0505009v4 |
| 0504197v1 |
| 0511041v1 |
| 0211085v2 |
| 0005116v2 |
| 0304078v1 |
| 0408064v1 |
| 0610105v1 |
| 0410145v2 |
| 0208022v2 |
| 0507036v3 |
| 0304174v1 |
| 0403071v1 |
| 0305134v1 |
| 0306064v1 |
| 9908041v1 |
| 0608039v4 |
| 0204027v1 |
|