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

Academia Press eBooks

Clifford meets Clifford in Quantum Computing: On Clifford seminearrings and Clifford groups

Albert Hoogewijs

Published Jan 1, 2005• 0 citations
OpenAlex

Related papers

The monomial representations of the Clifford group

D. M. Appleby, Bengtsson, I., Brierley, S. +3 more

Quantum Information and Computation

•May 1, 2012•29 citations

Clifford group is not a semidirect product in dimensions N divisible by four

Miroslav Korbelář, J. Tolar

Abstract The paper is devoted to projective Clifford groups of quantum N-dimensional systems (with configuration space Z N ). Clearly, Clifford gates allow only the simplest quantum computations which can be simulated on a classical computer (Gottesmann–Knill theorem). However, it may serve as a cornerstone of full quantum computation. As to its group structure it is well-known that—in N-dimensional quantum mechanics—the Clifford group is a natural semidirect product provided the dimension N is an odd number. For even N special results on the Clifford groups are scattered in the mathematical literature, but they mostly do not concern the semidirect structure. Using appropriate group presentation of S L ( 2 , Z N ) it is proved that for even N the projective Clifford groups are not natural semidirect products if and only if N is divisible by four.

arXiv:2305.13178•Journal of Physics A Mathematical and Theoretical•May 24, 2023•3 citations

Clifford Algebra, its Generalizations, and Applications to Quantum Information and Computing

Thalanayar S. Santhanam

Advances in Applied Clifford Algebras•May 8, 2010•1 citation

On Clifford groups in quantum computing

J. Tolar

The term Clifford group was introduced in 1998 by D. Gottesmann in his investigation of quantum error-correcting codes. The simplest Clifford group in multiqubit quantum computation is generated by a restricted set of unitary Clifford gates - the Hadamard, π /4-phase and controlled-X gates. Because of this restriction the Clifford model of quantum computation can be efficiently simulated on a classical computer (the Gottesmann-Knill theorem). However, this fact does not diminish the importance of the Clifford model, since it may serve as a suitable starting point for a full-fledged quantum computation. In the general case of a single or composite quantum system with finite-dimensional Hilbert space the finite Weyl-Heisenberg group of unitary operators defines the quantum kinematics and the states of the quantum register. Then the corresponding Clifford group is defined as the group of unitary operators leaving the Weyl-Heisenberg group invariant. The aim of this contribution is to show that our comprehensive results on symmetries of the Pauli gradings of quantum operator algebras - covering any single as well as composite finite quantum systems - directly correspond to Clifford groups defined as quotients with respect to U(1).

arXiv:1810.10259•Journal of Physics Conference Series•Aug 1, 2018•22 citations

Quantum Gates and Quantum Algorithms with Clifford Algebra Technique

M. Gregorič, N. S. Mankoč Borštnik

arXiv:0801.3201•International Journal of Theoretical Physics•Sep 2, 2008•6 citations

Clifford quantum computing

Michel R. P. Planat

One reports about the embedding of the Pauli group into the Clifford group, and one explicits the concept of Clifford quantum computation, following Gottesman-Knill approach. Normal subgroups of the two-qubit Clifford group are investigated and a link to the generalized quadrangle of other two and hexads in the Steiner system S(3,6,22) is found.

•Nov 21, 2007•0 citations
Abstract The paper is devoted to projective Clifford groups of quantum N-dimensional systems (with configuration space Z N ). Clearly, Clifford gates allow only the simplest quantum computations which can be simulated on a classical computer (Gottesmann–Knill theorem). However, it may serve as a cornerstone of full quantum computation. As to its group structure it is well-known that—in N-dimensional quantum mechanics—the Clifford group is a natural semidirect product provided the dimension N is an odd number. For even N special results on the Clifford groups are scattered in the mathematical literature, but they mostly do not concern the semidirect structure. Using appropriate group presentation of S L ( 2 , Z N ) it is proved that for even N the projective Clifford groups are not natural semidirect products if and only if N is divisible by four.
The term Clifford group was introduced in 1998 by D. Gottesmann in his investigation of quantum error-correcting codes. The simplest Clifford group in multiqubit quantum computation is generated by a restricted set of unitary Clifford gates - the Hadamard, π /4-phase and controlled-X gates. Because of this restriction the Clifford model of quantum computation can be efficiently simulated on a classical computer (the Gottesmann-Knill theorem). However, this fact does not diminish the importance of the Clifford model, since it may serve as a suitable starting point for a full-fledged quantum computation. In the general case of a single or composite quantum system with finite-dimensional Hilbert space the finite Weyl-Heisenberg group of unitary operators defines the quantum kinematics and the states of the quantum register. Then the corresponding Clifford group is defined as the group of unitary operators leaving the Weyl-Heisenberg group invariant. The aim of this contribution is to show that our comprehensive results on symmetries of the Pauli gradings of quantum operator algebras - covering any single as well as composite finite quantum systems - directly correspond to Clifford groups defined as quotients with respect to U(1).