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...

Full description

Saved in:

Bibliographic Details
Published in:	Quantum information processing Vol. 12; no. 4; pp. 1719 - 1735
Main Authors:	Chappell, James M., Iqbal, Azhar, Lohe, M. A., von Smekal, Lorenz, Abbott, Derek
Format:	Journal Article
Language:	English
Published:	Boston Springer US 01.04.2013 Springer
Subjects:	Algebra Algorithmics. Computability. Computer arithmetics Applied sciences Associative rings and algebras Classical and quantum physics: mechanics and fields Computer science; control theory; systems Data Structures and Information Theory Exact sciences and technology Mathematical Physics Mathematics Physics Physics and Astronomy Quantum computation Quantum Computing Quantum information Quantum Information Technology Quantum Physics Sciences and techniques of general use Spintronics Theoretical computing Geometric algebra Grover search algorithm Quantum algorithms Quantum computing Courseware Visualization Quantum algorithm Decision making Ideal Quantum computer Grover algorithm Search algorithm Clifford algebra Quantum information Algebraic geometry
ISSN:	1570-0755, 1573-1332
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!