Theory of the Quantum Speed Up
classification
🪐 quant-ph
keywords
quantumcomputationirreversiblemeasurementaccomplishalgorithmsappearscannot
read the original abstract
Insofar as quantum computation is faster than classical, it appears to be irreversible. In all quantum algorithms found so far the speed-up depends on the extra-dynamical irreversible projection representing quantum measurement. Quantum measurement performs a computation that dynamical computation cannot accomplish as efficiently.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.