dorsal/arxiv
View SchemaShortening Grover's search algorithm for an expectation value quantum computer
| Authors | David Collins |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0209148 |
| URL | https://arxiv.org/abs/quant-ph/0209148 |
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.
{
"annotation_id": "0e941942-1f83-4cc1-b0b5-21c62bf2ccd1",
"date_created": "2026-03-02T18:01:52.434000Z",
"date_modified": "2026-03-02T18:01:52.434000Z",
"file_hash": "323f381120439e81e58d5be275208bbbee171f09ae1f872f63e7725e6a36cbd3",
"private": false,
"record": {
"abstract": "Quantum algorithms are conventionally formulated for implementation on a\nsingle system of qubits amenable to projective measurements. However, in\nexpectation value quantum computation, such as nuclear magnetic resonance\nrealizations, the computer consists of an ensemble of identical qubit-systems\namenable only to expectation value measurements. The prevalent strategy in such\nexpectation value implementations of quantum algorithms has been to retain the\nconventional formulation\u0027s unitary operations but modify its initialization and\nmeasurement steps appropriately. This naive approach is not optimal for\nGrover\u0027s algorithm and a shortened version for expectation value quantum\ncomputers is presented.",
"arxiv_id": "quant-ph/0209148",
"authors": [
"David Collins"
],
"categories": [
"quant-ph"
],
"title": "Shortening Grover\u0027s search algorithm for an expectation value quantum computer",
"url": "https://arxiv.org/abs/quant-ph/0209148"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "bffd0e11-96e1-4784-8019-7e72debfc140",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}