Speedup in quantum computation is associated with attenuation of processing probability
K. Svozil
Abstract
Quantum coherence allows the computation of an arbitrary number of distinct computational paths in parallel. Based on quantum parallelism it has been conjectured that exponential or even larger speedups of computations are possible. Here it is shown that, although in principle correct, any speedup is accompanied by an associated attenuation of detection rates. Thus, on the average, no effective speedup is obtained relative to classical (nondeterministic) devices.
Create a lesson
Related papers
Proof of the AGT Conjecture at Generic β
Le-Feng Chen, Kilar Zhang
Casimir operators of 4D\,, N=2 supersymmetry in the harmonic approach
Egor Eremeev, Evgeny Ivanov
Doubly-scaled planar N = 4 SYM \& Carroll Holography
Arjun Bagchi, Prateksh Dhivakar, Alok Laddha et al.
Quantum Selection of Classical Histories
Omer Guleryuz
Wess-Zumino gauge for analytic prepotentials of off-shell N=2 supergravity: bosonic sector
Nikita Zaigraev, Julia Zernina
Testing holographic computation of entanglement pseudo-entropy in dS3/ICFT2
Liang Li