Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Information Processing

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

James M. Chappell, Azhar Iqbal, Max A. Lohe, Lorenz von Smekal, Derek Abbott

Published Sep 20, 2012• 6 citations
Publisher
DOI
10.1007/s11128-012-0483-7

Related papers

Conceptual aspects of geometric quantum computation

Erik Sjöqvist, Vahid Azimi Mousolou, Carlo M. Canali

arXiv:1311.7470•Quantum Information Processing•Jul 7, 2016•28 citations

An improved formalism for the Grover search algorithm

James M. Chappell, Max A. Lohe, Lorenz von Smekal +2 more

The Grover search algorithm is one of the two key algorithms in the field of quantum computing, and hence it is of significant interest to describe it in the most efficient mathematical formalism. We show firstly, that Clifford's formalism of geometric algebra, provides a significantly more efficient 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 as the precession of a spin-1/2 particle. Using this formalism we efficiently solve the exact search problem, as well as easily representing more general search situations.

arXiv:1201.1707•Jan 9, 2012•2 citations

Generalization of Grover's Algorithm to Multiobject Search in Quantum Computing, Part I: Continuous Time and Discrete Time

Goong Chen, S. A. Fulling, Jeesen Chen

L. K. Grover's search algorithm in quantum computing gives an optimal, quadratic speedup in the search for a single object in a large unsorted database. In this paper, we generalize Grover's algorithm in a Hilbert-space framework for both continuous and discrete time cases that isolates its geometrical essence to the case where more than one object satisfies the search criterion.

arXiv:quant-ph/0007123•Jul 31, 2000•0 citations

On Grover’s search algorithm from a quantum information geometry viewpoint

Carlo Cafaro, Stefano Mancini

arXiv:1110.6713•Physica A Statistical Mechanics and its Applications•Sep 29, 2011•37 citations

Analysis of Grover’S Quantum Search Algorithm on a Classical Computer

Necati Çeli̇k, Özkan Bingöl

•Jan 1, 2022•0 citations

Generalization of Grover’s algorithm to multiobject search in quantum computing, Part I: continuous time and dis- crete time

Goong Chen, S. A. Fulling, Jeesen Chen

Abstract L. K. Grover’s search algorithm in quantum computing gives an optimal, quadratic speedup in the search for a single object in a large unsorted database. In this paper, we generalize Grover’s algorithm in a Hilbert-space framework for both continuous and discrete time cases that isolates its geometrical essence to the case where more than one object satisfies the search criterion.

Chapman & Hall/CRC eBooks•Feb 14, 2002•15 citations
The Grover search algorithm is one of the two key algorithms in the field of quantum computing, and hence it is of significant interest to describe it in the most efficient mathematical formalism. We show firstly, that Clifford's formalism of geometric algebra, provides a significantly more efficient 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 as the precession of a spin-1/2 particle. Using this formalism we efficiently solve the exact search problem, as well as easily representing more general search situations.