Superposition, entanglement and quantum computation

Authors:
T. M. Forcer;A. J. G. Hey;D. A. Ross;P. G. R. Smith
Affiliations:
Department of Electronics and Computer Science, University of Southampton, Southampton, UK;Department of Electronics and Computer Science, University of Southampton, Southampton, UK;Department of Physics and Astronomy, University of Southampton, Southampton, UK;Department of Electronics and Computer Science, University of Southampton, Southampton, UK
Venue:
Quantum Information & Computation
Year:
2002

Citing 2
Cited 0

Feynman Lectures on Computation

Feynman Lectures on Computation
Algorithms for quantum computation: discrete logarithms and factoring

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper examines the roles played by superposition and entanglement in quantum computing. The analysis is illustrated by discussion of a 'classical' electronic implementation of Grover's quantum search algorithm. It is shown explicitly that the absence of multi-particle entanglement leads to exponentially rising resources for implementing such quantum algorithms.