The Non-mechanistic Character of Quantum Computation

Details The Non-mechanistic Character of Quantum Computation The Non-mechanistic Character of Quantum Computation

1998-11-16

arxiv.org/abs/quant-ph/9811039v4

Physics

Quantum Physics

revision 4: further developed the notion that quantum efficiency comes from driving the computation process through a final co

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The Non-mechanistic Character of Quantum Computation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Non-mechanistic Character of Quantum Computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Non-mechanistic Character of Quantum Computation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-615638