Quantum Computation: Particle and Wave Aspects of Algorithms

TL;DR

This paper explores how particle and wave properties underpin the power of quantum algorithms, analyzing key examples like Shor's and Grover's to highlight their efficiency advantages over classical methods.

Contribution

It provides an introduction to the role of particle and wave aspects in quantum algorithms, with analysis of prominent examples to illustrate their contribution to computational power.

Findings

Quantum algorithms leverage particle and wave duality for efficiency.

Analysis of Shor's and Grover's algorithms demonstrates their quantum advantage.

Field remains actively investigating systematic development of quantum algorithms.

Abstract

The driving force in the pursuit for quantum computation is the exciting possibility that quantum algorithms can be more efficient than their classical analogues. Research on the subject has unraveled several aspects of how that can happen. Clever quantum algorithms have been discovered in recent years, although not systematically, and the field remains under active investigation. Richard Feynman was one of the pioneers who foresaw the power of quantum computers. In this issue dedicated to him, I give an introduction to how particle and wave aspects contribute to the power of quantum computers. Shor's and Grover's algorithms are analysed as examples.