Please use this identifier to cite or link to this item:
|Web of Science®
|An improved formalism for quantum computation based on geometric algebra - case study: Grover's search algorithm
Von Smekal, L.
|Quantum Information Processing, 2013; 12(4):1719-1735
|Springer New York LLC
|James M. Chappell, Azhar Iqbal, M. A. Lohe, Lorenz von Smekal, Derek Abbott
|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 the conventional bra-ket notation, and secondly, that the basis defined by the states of maximum and minimum weight in the Grover search space, allows a simple visualization of the Grover search analogous to the precession of a spin- 12 particle. Using this formalism we efficiently solve the exact search problem, as well as easily representing more general search situations. We do not claim the development of an improved algorithm, but show in a tutorial paper that geometric algebra provides extremely compact and elegant expressions with improved clarity for the Grover search algorithm. Being a key algorithm in quantum computing and one of the most studied, it forms an ideal basis for a tutorial on how to elucidate quantum operations in terms of geometric algebra—this is then of interest in extending the applicability of geometric algebra to more complicated problems in fields of quantum computing, quantum decision theory, and quantum information.
|Grover search algorithm
|© Springer Science+Business Media, LLC 2012
|Appears in Collections:
Electrical and Electronic Engineering publications
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.