dorsal/arxiv
View SchemaThe Non-mechanistic Character of Quantum Computation
| Authors | Giuseppe Castagnoli, Dalida Monti |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/9811039 |
| URL | https://arxiv.org/abs/quant-ph/9811039 |
Abstract
The higher than classical efficiency exhibited by some quantum algorithms is here ascribed to their non-mechanistic character, which becomes evident by joining the notions of entanglement and quantum measurement. Measurement analogically sets a (partial) constraint on the output of the computation of a hard-to-reverse function. This constraint goes back in time along the reversible computation process, computing the reverse function, which yields quantum efficiency. The evolution, comprising wave function collapse (here a revamped notion), is non-mechanistic as it is driven by both an initial condition and a final constraint. It seems that the more the output is constrained by measurement, the higher can be the efficiency. Setting a complete constraint, by means of a special Zeno effect, yields (speculatively) NP-complete=P.
{
"annotation_id": "aeebd367-9b5c-4f10-a968-0cc695370cf9",
"date_created": "2026-03-02T18:02:45.235000Z",
"date_modified": "2026-03-02T18:02:45.235000Z",
"file_hash": "c5acbf00391ef2ea31a2e33b56f718ba7e93e715ef0d7dd178965e50e8fc249d",
"private": false,
"record": {
"abstract": "The higher than classical efficiency exhibited by some quantum algorithms is\nhere ascribed to their non-mechanistic character, which becomes evident by\njoining the notions of entanglement and quantum measurement. Measurement\nanalogically sets a (partial) constraint on the output of the computation of a\nhard-to-reverse function. This constraint goes back in time along the\nreversible computation process, computing the reverse function, which yields\nquantum efficiency. The evolution, comprising wave function collapse (here a\nrevamped notion), is non-mechanistic as it is driven by both an initial\ncondition and a final constraint. It seems that the more the output is\nconstrained by measurement, the higher can be the efficiency. Setting a\ncomplete constraint, by means of a special Zeno effect, yields (speculatively)\nNP-complete=P.",
"arxiv_id": "quant-ph/9811039",
"authors": [
"Giuseppe Castagnoli",
"Dalida Monti"
],
"categories": [
"quant-ph"
],
"title": "The Non-mechanistic Character of Quantum Computation",
"url": "https://arxiv.org/abs/quant-ph/9811039"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "e6bface9-face-4e0c-bd4c-09b965987135",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}