9811039v4

related topics
{time, systems, information}
{measurement, state, measurements}
{algorithm, log, probability}
{qubit, qubits, gate}
{time, wave, function}
{state, algorithm, problem}
{phase, path, phys}
{entanglement, phys, rev}

The Non-mechanistic Character of Quantum Computation

Giuseppe Castagnoli, Dalida Monti

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.

oai_identifier:
oai:arXiv.org:quant-ph/9811039
categories:
quant-ph
comments:
revision 4: further developed the notion that quantum efficiency comes from driving the computation process through a final condition; various clarifications after receiving comments; reduced the number of figures; 10 text pages (1 file), 2 figures (1 additional file); submitted for the Proceedings of the International Quantum Structures Association Conference, Liptovsky Jan, September 1998
arxiv_id:
quant-ph/9811039
created:
1998-11-16
updated:
1999-01-13

Full article ▸

related documents
0611250v1
0101060v1
0012003v5
0010081v1
0207144v1
0402197v6
0512115v4
0701200v3
0610047v1
0212053v1
0305072v1
0203020v1
0507262v1
0510072v1
0110088v2
0204151v3
0110043v1
9911067v1
0112111v1
0506266v2
0605213v2
0102134v1
0003140v2
9901019v1
0108130v1