|
| related topics |
| {algorithm, log, probability} |
| {energy, gaussian, time} |
| {qubit, qubits, gate} |
| {state, phys, rev} |
| {alice, bob, state} |
| {measurement, state, measurements} |
| {state, states, coherent} |
| {error, code, errors} |
|
Deutsch-Jozsa algorithm for continuous variables
Arun K. Pati, Samuel L. Braunstein
abstract: We present an idealized quantum continuous variable analog of the
Deutsch-Jozsa algorithm which can be implemented on a perfect continuous
variable quantum computer. Using the Fourier transformation and XOR gate
appropriate for continuous spectra we show that under ideal operation to
infinite precision that there is an infinite reduction in number of query calls
in this scheme.
- oai_identifier:
- oai:arXiv.org:quant-ph/0207108
- categories:
- quant-ph
- comments:
- Latex file, 3 pages To appear in "Quantum Inoformation with
Continuous Variables" Edited by S. L. Braunstein and A. K. Pati, Kluwer
Academic Publisher, 2002
- arxiv_id:
- quant-ph/0207108
- created:
- 2002-07-18
Full article ▸
|
|
| related documents |
| 0508156v3 |
| 0303074v1 |
| 0208112v1 |
| 9702057v1 |
| 0609160v1 |
| 9812057v1 |
| 0209148v1 |
| 0403071v1 |
| 0206066v1 |
| 0308016v1 |
| 0612052v2 |
| 0608156v1 |
| 0609166v1 |
| 0406104v1 |
| 0401067v2 |
| 0402134v1 |
| 0403160v1 |
| 0501093v1 |
| 0312220v1 |
| 0612033v1 |
| 0606242v3 |
| 0507024v1 |
| 0502144v1 |
| 0209139v1 |
| 0406146v1 |
|