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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call