|
| related topics |
| {let, theorem, proof} |
| {qubit, qubits, gate} |
| {algorithm, log, probability} |
| {states, state, optimal} |
| {cos, sin, state} |
|
Engineering Functional Quantum Algorithms
Andreas Klappenecker, Martin Roetteler
abstract: Suppose that a quantum circuit with K elementary gates is known for a unitary
matrix U, and assume that U^m is a scalar matrix for some positive integer m.
We show that a function of U can be realized on a quantum computer with at most
O(mK+m^2log m) elementary gates. The functions of U are realized by a generic
quantum circuit, which has a particularly simple structure. Among other
results, we obtain efficient circuits for the fractional Fourier transform.
- oai_identifier:
- oai:arXiv.org:quant-ph/0208130
- categories:
- quant-ph
- comments:
- 4 pages, 2 figures
- doi:
- 10.1103/PhysRevA.67.010302
- arxiv_id:
- quant-ph/0208130
- journal_ref:
- Physical Review A, 67, 010302, 2003
- created:
- 2002-08-20
Full article ▸
|
|
| related documents |
| 0304013v1 |
| 0606077v1 |
| 0006049v2 |
| 0406226v1 |
| 0402060v2 |
| 0210100v3 |
| 0411027v1 |
| 0002058v1 |
| 0512100v1 |
| 0211034v2 |
| 0403160v1 |
| 0608156v1 |
| 0307132v1 |
| 0605132v1 |
| 0703061v1 |
| 0401067v2 |
| 0407120v1 |
| 0504169v1 |
| 0312115v1 |
| 0701079v1 |
| 0209148v1 |
| 0603155v1 |
| 0610258v1 |
| 0304174v1 |
| 0501093v1 |
|