|
| related topics |
| {algorithm, log, probability} |
| {measurement, state, measurements} |
| {qubit, qubits, gate} |
| {state, phys, rev} |
| {spin, pulse, spins} |
| {error, code, errors} |
| {state, algorithm, problem} |
| {cos, sin, state} |
| {key, protocol, security} |
|
Shortening Grover's search algorithm for an expectation value quantum
computer
David Collins
abstract: Quantum algorithms are conventionally formulated for implementation on a
single system of qubits amenable to projective measurements. However, in
expectation value quantum computation, such as nuclear magnetic resonance
realizations, the computer consists of an ensemble of identical qubit-systems
amenable only to expectation value measurements. The prevalent strategy in such
expectation value implementations of quantum algorithms has been to retain the
conventional formulation's unitary operations but modify its initialization and
measurement steps appropriately. This naive approach is not optimal for
Grover's algorithm and a shortened version for expectation value quantum
computers is presented.
- oai_identifier:
- oai:arXiv.org:quant-ph/0209148
- categories:
- quant-ph
- comments:
- To appear in the proceedings of QCMC'02
- arxiv_id:
- quant-ph/0209148
- created:
- 2002-09-26
Full article ▸
|
|
| related documents |
| 9702057v1 |
| 0208112v1 |
| 0206066v1 |
| 0608156v1 |
| 0012088v1 |
| 0508156v3 |
| 0701198v1 |
| 0612033v1 |
| 0105014v2 |
| 0606242v3 |
| 0005087v2 |
| 0002009v1 |
| 0507024v1 |
| 0502144v1 |
| 0209139v1 |
| 0104007v2 |
| 9908090v3 |
| 0406146v1 |
| 0001034v1 |
| 9811027v1 |
| 0703193v2 |
| 0507194v1 |
| 0011043v1 |
| 0007101v4 |
| 0209059v1 |
|