|
| related topics |
| {states, state, optimal} |
| {qubit, qubits, gate} |
| {operator, operators, space} |
| {let, theorem, proof} |
| {time, wave, function} |
| {information, entropy, channel} |
| {state, phys, rev} |
| {cos, sin, state} |
| {algorithm, log, probability} |
| {measurement, state, measurements} |
|
Approximate programmable quantum processors
Mark Hillery, Mario Ziman, Vladimir Buzek
abstract: A quantum processor is a programmable quantum circuit in which both the data
and the program, which specifies the operation that is carried out on the data,
are quantum states. We study the situation in which we want to use such a
processor to approximate a set of unitary operators to a specified level of
precision. We measure how well an operation is performed by the process
fidelity between the desired operation and the operation produced by the
processor. We show how to find the program for a given processor that produces
the best approximation of a particular unitary operation. We also place bounds
on the dimension of the program space that is necessary to approximate a set of
unitary operators to a specified level of precision.
- oai_identifier:
- oai:arXiv.org:quant-ph/0510161
- categories:
- quant-ph
- comments:
- 8 pages
- doi:
- 10.1103/PhysRevA.73.022345
- arxiv_id:
- quant-ph/0510161
- created:
- 2005-10-20
Full article ▸
|
|
| related documents |
| 0201097v1 |
| 9712019v3 |
| 0601017v4 |
| 0602112v1 |
| 0208080v2 |
| 9911086v3 |
| 0305117v3 |
| 0308089v2 |
| 0607105v2 |
| 0511041v1 |
| 0004071v2 |
| 0305134v1 |
| 0610196v2 |
| 0603168v1 |
| 0512058v3 |
| 0610105v1 |
| 0610058v2 |
| 0605041v4 |
| 0308167v1 |
| 0001091v5 |
| 0110164v1 |
| 0308008v2 |
| 9605013v1 |
| 9505011v1 |
| 0610214v3 |
|