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

arXiv:quant-ph/0010071 · Physical Review A

Clifford algebras and universal sets of quantum gates

Alexander Yu. Vlasov

Published Apr 17, 2001• 42 citations
arXivHTMLPDF

Abstract

In this paper is shown an application of Clifford algebras to the construction of computationally universal sets of quantum gates for n-qubit systems. It is based on the well-known application of Lie algebras together with the especially simple commutation law for Clifford algebras, which states that all basic elements either commute or anticommute.

DOI
10.1103/physreva.63.054302

Related papers

Algebra of quantum computations with higher dimensional systems

Alexander Y. Vlasov

Here is discussed application of the Weyl pair to construction of universal set of quantum gates for high-dimensional quantum system. An application of Lie algebras (Hamiltonians) for construction of universal gates is revisited first. It is shown next, how for quantum computation with qubits can be used two-dimensional analog of this Cayley-Weyl matrix algebras, i.e. Clifford algebras, and discussed well known applications to product operator formalism in NMR, Jordan-Wigner construction in fermionic quantum computations. It is introduced universal set of quantum gates for higher dimensional system ("qudit"), as some generalization of these models. Finally it is briefly mentioned possible application of such algebraic methods to design of quantum processors (programmable gates arrays) and dsicussed generalization to quantum computation wiht continuous variables.

arXiv:quant-ph/0210049•Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Jul 23, 2003•17 citations

Noncommutative tori and universal sets of nonbinary quantum gates

Alexander Yu. Vlasov

We address the problem of universality in simulation of evolution of quantum system and in theory of quantum computations related with the possibility of expression or approximation of arbitrary unitary transformation by composition of specific unitary transformations (quantum gates) from given set. In an earlier paper application of Clifford algebras to constructions of universal sets of binary quantum gates Uk∈U(2n) was shown. For application of a similar approach to nonbinary quantum gates Uk∈U(ln), in present work we used rational noncommutative torus T1/l2n. A set of universal nonbinary two-gates is presented here as one example.

arXiv:quant-ph/0012009•Journal of Mathematical Physics•Jun 1, 2002•17 citations

Noncommutative tori and universal sets of non-binary quantum gates

Vlasov, A Yu

Problem of universality in simulation of evolution of quantum system and in theory of quantum computations related with possibility of expression or approximation of arbitrary unitary transformation by composition of specific unitary transformations (quantum gates) from given set. In earlier paper (quant-ph/0010071) was shown application of Clifford algebras to constructions of universal sets of binary quantum gates $U_k \\in U(2^n)$. For application of similar approach to non-binary quantum gates $U_k \\in U(l^n)$ in present work is used rational noncommutative torus ${\\Bbb T}^{2n}_{1/l}$. Set of universal non-binary two-gates is presented here as one of examples.

•Dec 1, 2000•22 citations

Clifford algebras, noncommutative tori and universal quantum computers

Alexander Yu. Vlasov

Recently author suggested [quant-ph/0010071] an application of Clifford algebras for construction of a "compiler" for universal binary quantum computer together with later development [quant-ph/0012009] of the similar idea for a non-binary base. The non-binary case is related with application of some extension of idea of Clifford algebras. It is noncommutative torus defined by polynomial algebraic relations of order l. For l=2 it coincides with definition of Clifford algebra. Here is presented the joint consideration and comparison of both cases together with some discussion on possible physical consequences.

arXiv:quant-ph/0109010•Sep 3, 2001•0 citations

A Unified Clifford Algebra Framework for Quantum Computation: From Specific Spinor Realizations to General Operator Representations

Luciano Silva

This paper presents a unified algebraic framework for $n$-qubit quantum computation rooted in the complex Clifford algebra $Cl(2n, \mathbb{C})$. We leverage the fundamental isomorphism $Cl(2n, \mathbb{C}) \cong M(2^n, \mathbb{C})$ to directly identify the algebra of all $n$-qubit quantum operators (including states, gates, and observables) with elements of $Cl(2n, \mathbb{C})$. This operator-centric perspective treats quantum states, whether pure or mixed, as density multivectors $\rho \in Cl(2n, \mathbb{C})$ satisfying standard physical constraints ($\rho^\dagger = \rho$, $2^n \langle \rho \rangle_0 = 1$, positivity), and unitary gates $U$ as multivectors obeying $U^\dagger U = I$. Quantum evolution $\rho' = U\rho U^\dagger$ and measurements $p(m) = 2^n \langle P_m \rho \rangle_0$ are thus described by intrinsic Clifford algebraic operations. This contrasts with, yet encompasses, specific realizations like spinor representations based on Witt ideals ($S = Cl(2n, \mathbb{C})\prod_j f_j f_j^\dagger$), which are shown to be particular constructions within this universal algebra. By analyzing Deutsch's algorithm through these different lenses, we demonstrate the generality and unifying power of the operator-centric multivector approach. This formulation not only provides a comprehensive algebraic language that naturally handles mixed states and general quantum processes but also opens avenues for applying the rich geometric and structural tools of Clifford algebras—such as grade decomposition and invariant theory—to gain deeper insights into quantum information, entanglement, and dynamics.

•May 23, 2025•0 citations

Quantum Gates and Clifford Algebras

Alexander Yu. Vlasov

Clifford algebras are used for definition of spinors. Because of using spin-1/2 systems as an adequate model of quantum bit, a relation of the algebras with quantum information science has physical reasons. But there are simple mathematical properties of the algebras those also justifies such applications. First, any complex Clifford algebra with 2n generators, Cl(2n,C), has representation as algebra of all 2^n x 2^n complex matrices and so includes unitary matrix of any quantum n-gate. An arbitrary element of whole algebra corresponds to general form of linear complex transformation. The last property is also useful because linear operators are not necessary should be unitary if they used for description of restriction of some unitary operator to subspace. The second advantage is simple algebraic structure of Cl(2n) that can be expressed via tenzor product of standard "building units" and similar with behavior of composite quantum systems. The compact notation with 2n generators also can be used in software for modeling of simple quantum circuits by modern conventional computers.

arXiv:quant-ph/9907079•Jul 26, 1999•6 citations
In this paper is shown an application of Clifford algebras to the construction of computationally universal sets of quantum gates for n-qubit systems. It is based on the well-known application of Lie algebras together with the especially simple commutation law for Clifford algebras, which states that all basic elements either commute or anticommute.
Here is discussed application of the Weyl pair to construction of universal set of quantum gates for high-dimensional quantum system. An application of Lie algebras (Hamiltonians) for construction of universal gates is revisited first. It is shown next, how for quantum computation with qubits can be used two-dimensional analog of this Cayley-Weyl matrix algebras, i.e. Clifford algebras, and discussed well known applications to product operator formalism in NMR, Jordan-Wigner construction in fermionic quantum computations. It is introduced universal set of quantum gates for higher dimensional system ("qudit"), as some generalization of these models. Finally it is briefly mentioned possible application of such algebraic methods to design of quantum processors (programmable gates arrays) and dsicussed generalization to quantum computation wiht continuous variables.
We address the problem of universality in simulation of evolution of quantum system and in theory of quantum computations related with the possibility of expression or approximation of arbitrary unitary transformation by composition of specific unitary transformations (quantum gates) from given set. In an earlier paper application of Clifford algebras to constructions of universal sets of binary quantum gates Uk∈U(2n) was shown. For application of a similar approach to nonbinary quantum gates Uk∈U(ln), in present work we used rational noncommutative torus T1/l2n. A set of universal nonbinary two-gates is presented here as one example.
Problem of universality in simulation of evolution of quantum system and in theory of quantum computations related with possibility of expression or approximation of arbitrary unitary transformation by composition of specific unitary transformations (quantum gates) from given set. In earlier paper (quant-ph/0010071) was shown application of Clifford algebras to constructions of universal sets of binary quantum gates UkinU(2n)U_k \\in U(2^n)Uk​inU(2n). For application of similar approach to non-binary quantum gates UkinU(ln)U_k \\in U(l^n)Uk​inU(ln) in present work is used rational noncommutative torus BbbT1/l2n{\\Bbb T}^{2n}_{1/l}BbbT1/l2n​. Set of universal non-binary two-gates is presented here as one of examples.
Recently author suggested [quant-ph/0010071] an application of Clifford algebras for construction of a "compiler" for universal binary quantum computer together with later development [quant-ph/0012009] of the similar idea for a non-binary base. The non-binary case is related with application of some extension of idea of Clifford algebras. It is noncommutative torus defined by polynomial algebraic relations of order l. For l=2 it coincides with definition of Clifford algebra. Here is presented the joint consideration and comparison of both cases together with some discussion on possible physical consequences.
This paper presents a unified algebraic framework for nnn-qubit quantum computation rooted in the complex Clifford algebra Cl(2n,C)Cl(2n, \mathbb{C})Cl(2n,C). We leverage the fundamental isomorphism Cl(2n,C)≅M(2n,C)Cl(2n, \mathbb{C}) \cong M(2^n, \mathbb{C})Cl(2n,C)≅M(2n,C) to directly identify the algebra of all nnn-qubit quantum operators (including states, gates, and observables) with elements of Cl(2n,C)Cl(2n, \mathbb{C})Cl(2n,C). This operator-centric perspective treats quantum states, whether pure or mixed, as density multivectors ρ∈Cl(2n,C)\rho \in Cl(2n, \mathbb{C})ρ∈Cl(2n,C) satisfying standard physical constraints (ρ†=ρ\rho^\dagger = \rhoρ†=ρ, 2n⟨ρ⟩0=12^n \langle \rho \rangle_0 = 12n⟨ρ⟩0​=1, positivity), and unitary gates UUU as multivectors obeying U†U=IU^\dagger U = IU†U=I. Quantum evolution ρ′=UρU†\rho' = U\rho U^\daggerρ′=UρU† and measurements p(m)=2n⟨Pmρ⟩0p(m) = 2^n \langle P_m \rho \rangle_0p(m)=2n⟨Pm​ρ⟩0​ are thus described by intrinsic Clifford algebraic operations. This contrasts with, yet encompasses, specific realizations like spinor representations based on Witt ideals (S=Cl(2n,C)∏jfjfj†S = Cl(2n, \mathbb{C})\prod_j f_j f_j^\daggerS=Cl(2n,C)∏j​fj​fj†​), which are shown to be particular constructions within this universal algebra. By analyzing Deutsch's algorithm through these different lenses, we demonstrate the generality and unifying power of the operator-centric multivector approach. This formulation not only provides a comprehensive algebraic language that naturally handles mixed states and general quantum processes but also opens avenues for applying the rich geometric and structural tools of Clifford algebras—such as grade decomposition and invariant theory—to gain deeper insights into quantum information, entanglement, and dynamics.
Clifford algebras are used for definition of spinors. Because of using spin-1/2 systems as an adequate model of quantum bit, a relation of the algebras with quantum information science has physical reasons. But there are simple mathematical properties of the algebras those also justifies such applications. First, any complex Clifford algebra with 2n generators, Cl(2n,C), has representation as algebra of all 2^n x 2^n complex matrices and so includes unitary matrix of any quantum n-gate. An arbitrary element of whole algebra corresponds to general form of linear complex transformation. The last property is also useful because linear operators are not necessary should be unitary if they used for description of restriction of some unitary operator to subspace. The second advantage is simple algebraic structure of Cl(2n) that can be expressed via tenzor product of standard "building units" and similar with behavior of composite quantum systems. The compact notation with 2n generators also can be used in software for modeling of simple quantum circuits by modern conventional computers.