Cuffaro, Michael
(2011)
Reflections on the Role of Entanglement in the Explanation of Quantum Computational Speedup.
[Preprint]
Abstract
Of the many and varied applications of quantum information theory, perhaps the most fascinating is the subfield of quantum computation. In this subfield, computational algorithms are designed which utilise the resources available in quantum systems in order to compute solutions to computational problems with, in some cases, exponentially fewer resources than any known classical algorithm. While the fact of quantum computational speedup is almost beyond doubt, the source of quantum speedup is still a matter of debate. In this paper I argue that entanglement is a necessary component for any explanation of quantum speedup and I address some purported counterexamples that some claim show that the contrary is true. In particular, I address Cleve et al.'s solution to Deutsch's problem, Biham et al.'s mixedstate version of the DeutschJozsa algorithm, and Knill & Laflamme's deterministic quantum computation with one qubit (DQC1) model of quantum computation. I argue that these examples do not demonstrate that entanglement is unnecessary for the explanation of quantum speedup, but that they rather illuminate and clarify the role that entanglement does play.
Available Versions of this Item

Reflections on the Role of Entanglement in the Explanation of Quantum Computational Speedup. (deposited 07 Dec 2011 16:19)
[Currently Displayed]
Monthly Views for the past 3 years
Monthly Downloads for the past 3 years
Plum Analytics
Actions (login required)

View Item 