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:0801.3201 · International Journal of Theoretical Physics

Quantum Gates and Quantum Algorithms with Clifford Algebra Technique

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

Published Sep 2, 2008• 6 citations
arXivHTMLPDF
DOI
10.1007/s10773-008-9826-7

Related papers

Clifford algebra and quantum logic gates

Wuming Li

Advances in Applied Clifford Algebras•Oct 1, 2004•3 citations

A Framework for Approximating Qubit Unitaries

Vadym Kliuchnikov, Alex Bocharov, Martin Roetteler +1 more

We present an algorithm for efficiently approximating of qubit unitaries over gate sets derived from totally definite quaternion algebras. It achieves $\varepsilon$-approximations using circuits of length $O(\log(1/\varepsilon))$, which is asymptotically optimal. The algorithm achieves the same quality of approximation as previously-known algorithms for Clifford+T [arXiv:1212.6253], V-basis [arXiv:1303.1411] and Clifford+$π/12$ [arXiv:1409.3552], running on average in time polynomial in $O(\log(1/\varepsilon))$ (conditional on a number-theoretic conjecture). Ours is the first such algorithm that works for a wide range of gate sets and provides insight into what should constitute a "good" gate set for a fault-tolerant quantum computer.

arXiv:1510.03888•Oct 13, 2015•40 citations

Quantum computing based on complex Clifford algebras

Jaroslav Hrdina, Aleš Návrat, Petr Vašík

arXiv:2201.02246•Quantum Information Processing•Sep 17, 2022•19 citations

Geometric Algebra Quantum Gate Decomposition

Youssef Amraoui, Zeno Toffano

Quantum gates are usually described through matrix and tensor-product formalisms that often obscure their geometric structure. In this work, we formulate the Pauli and Clifford groups within the complex Geometric Algebra (GA) framework. We show that the Pauli group is naturally identified with the group of blades up to a global phase, thereby providing a geometric interpretation of Pauli operators and their commutation relations in terms of oriented subspaces. We further prove that Clifford operators are generated by products of π/4-Pauli rotors and introduce a greedy Pauli rotor decomposition algorithm whose empirical behavior suggests unexpectedly compact decompositions for Clifford operators. Finally, we show that Clifford+T universality admits a natural geometric interpretation through π/8-rotors within this framework.

quant-pharXiv:2606.12480•Axioms•Jun 11, 2026•0 citations

Randomized Benchmarking with Stabilizer Verification and Gate Synthesis

Ellen Derbyshire, Rawad Mezher, Theodoros Kapourniotis +1 more

Recently, there has been an emergence of useful applications for noisy intermediate-scale quantum (NISQ) devices notably, though not exclusively, in the fields of quantum machine learning and variational quantum algorithms. In such applications, circuits of various depths and composed of different sets of gates are run on NISQ devices. Therefore, it is crucial to find practical ways to capture the general performance of circuits on these devices. Motivated by this pressing need, we modified the standard Clifford randomized benchmarking (RB) and interleaved RB schemes targeting them to hardware limitations. Firstly we remove the requirement for, and assumptions on, the inverse operator, in Clifford RB by incorporating a tehchnique from quantum verification. This introduces another figure of merit by which to assess the quality of the NISQ hardware, namely the acceptance probability of quantum verification. Many quantum algorithms, that provide an advantage over classical algorithms, demand the use of Clifford as well as non-Clifford gates. Therefore, as our second contribution we develop a technique for characterising a variety of non-Clifford gates, by combining tools from gate synthesis with interleaved RB. Both of our techniques are most relevant when used in conjunction with RB schemes that benchmark generators (or native gates) of the Clifford group, and in low error regimes.

arXiv:2102.13044•Feb 25, 2021•3 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
We present an algorithm for efficiently approximating of qubit unitaries over gate sets derived from totally definite quaternion algebras. It achieves ε\varepsilonε-approximations using circuits of length O(log⁡(1/ε))O(\log(1/\varepsilon))O(log(1/ε)), which is asymptotically optimal. The algorithm achieves the same quality of approximation as previously-known algorithms for Clifford+T [arXiv:1212.6253], V-basis [arXiv:1303.1411] and Clifford+π/12π/12π/12 [arXiv:1409.3552], running on average in time polynomial in O(log⁡(1/ε))O(\log(1/\varepsilon))O(log(1/ε)) (conditional on a number-theoretic conjecture). Ours is the first such algorithm that works for a wide range of gate sets and provides insight into what should constitute a "good" gate set for a fault-tolerant quantum computer.
Quantum gates are usually described through matrix and tensor-product formalisms that often obscure their geometric structure. In this work, we formulate the Pauli and Clifford groups within the complex Geometric Algebra (GA) framework. We show that the Pauli group is naturally identified with the group of blades up to a global phase, thereby providing a geometric interpretation of Pauli operators and their commutation relations in terms of oriented subspaces. We further prove that Clifford operators are generated by products of π/4-Pauli rotors and introduce a greedy Pauli rotor decomposition algorithm whose empirical behavior suggests unexpectedly compact decompositions for Clifford operators. Finally, we show that Clifford+T universality admits a natural geometric interpretation through π/8-rotors within this framework.
Recently, there has been an emergence of useful applications for noisy intermediate-scale quantum (NISQ) devices notably, though not exclusively, in the fields of quantum machine learning and variational quantum algorithms. In such applications, circuits of various depths and composed of different sets of gates are run on NISQ devices. Therefore, it is crucial to find practical ways to capture the general performance of circuits on these devices. Motivated by this pressing need, we modified the standard Clifford randomized benchmarking (RB) and interleaved RB schemes targeting them to hardware limitations. Firstly we remove the requirement for, and assumptions on, the inverse operator, in Clifford RB by incorporating a tehchnique from quantum verification. This introduces another figure of merit by which to assess the quality of the NISQ hardware, namely the acceptance probability of quantum verification. Many quantum algorithms, that provide an advantage over classical algorithms, demand the use of Clifford as well as non-Clifford gates. Therefore, as our second contribution we develop a technique for characterising a variety of non-Clifford gates, by combining tools from gate synthesis with interleaved RB. Both of our techniques are most relevant when used in conjunction with RB schemes that benchmark generators (or native gates) of the Clifford group, and in low error regimes.
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.