An improved formalism for quantum computation based on geometric algebra—case study: Grover’s search algorithm

The Grover search algorithm is one of the two key algorithms in the field of quantum computing, and hence it is desirable to represent it in the simplest and most intuitive formalism possible. We show firstly, that Clifford’s geometric algebra, provides a significantly simpler representation than th...

Ausführliche Beschreibung