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

Geometric Algebra Quantum Gate Decomposition

Youssef Amraoui, Zeno Toffano

Quantum gates are traditionally described using matrix and tensor-product formalisms, representations that provide limited geometric intuition. In this work, we develop a formulation of the Pauli and Clifford groups within the complex Geometric Algebra (GA) framework in order to obtain useful quantum gate decompositions. We show that the Pauli group is naturally identified with the group of blades up to a global phase, providing an intuitive 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 performance reveals remarkably compact decompositions of Clifford operators. Finally, we show that Clifford+T universality also acquires a natural geometric interpretation through π/8-rotors within this framework. This work highlights Geometric Algebra as a potential geometric tool for quantum computation applications.

Axioms•Jul 13, 2026•0 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•10 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•13 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•Jun 11, 2026•0 citations

Quantum Algorithms from a Linear Algebra Perspective

Liam Michael Ogren, Lauren Michelle Baker

•Apr 27, 2017•0 citations
Quantum gates are traditionally described using matrix and tensor-product formalisms, representations that provide limited geometric intuition. In this work, we develop a formulation of the Pauli and Clifford groups within the complex Geometric Algebra (GA) framework in order to obtain useful quantum gate decompositions. We show that the Pauli group is naturally identified with the group of blades up to a global phase, providing an intuitive 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 performance reveals remarkably compact decompositions of Clifford operators. Finally, we show that Clifford+T universality also acquires a natural geometric interpretation through π/8-rotors within this framework. This work highlights Geometric Algebra as a potential geometric tool for quantum computation applications.
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.