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:1310.6813 · Logical Methods in Computer Science

Generators and relations for n-qubit Clifford operators

Peter Selinger

Published Jun 19, 2015• 46 citations
arXivHTMLPDF

Abstract

We define a normal form for Clifford circuits, and we prove that every Clifford operator has a unique normal form. Moreover, we present a rewrite system by which any Clifford circuit can be reduced to normal form. This yields a presentation of Clifford operators in terms of generators and relations.
DOI
10.2168/lmcs-11(2:10)2015

Related papers

Generators and Relations for Real Stabilizers

Justin J. Makary

Real stabilizer operators, which are also known as real Clifford operators, are generated, through composition and tensor product, by the Hadamard gate, the Pauli Z gate, and the controlled-Z gate. We introduce a normal form for real stabilizer circuits and show that every real stabilizer operator admits a unique normal form. Moreover, we give a finite set of relations that suffice to rewrite any Clifford circuit to its normal form. This yields a presentation by generators and relations of the strict spatial monoidal category of real stabilizer operators.

•Aug 20, 2020•0 citations

Generators and Relations for Real Stabilizer Operators

Justin Makary, Neil J. Ross, Peter Selinger

Real stabilizer operators, which are also known as real Clifford operators, are generated, through composition and tensor product, by the Hadamard gate, the Pauli Z gate, and the controlled-Z gate. We introduce a normal form for real stabilizer circuits and show that every real stabilizer operator admits a unique normal form. Moreover, we give a finite set of relations that suffice to rewrite any real stabilizer circuit to its normal form.

arXiv:2109.05655•Electronic Proceedings in Theoretical Computer Science•Sep 9, 2021•5 citations

A Complete and Natural Rule Set for Multi-Qutrit Clifford Circuits

Sarah Meng Li, Michele Mosca, Neil J. Ross +2 more

We present a complete set of rewrite rules for n-qutrit Clifford circuits where n is any non-negative integer.This is the first completeness result for any fragment of quantum circuits in odd prime dimensions.We first generalize Selinger's normal form for n-qubit Clifford circuits to the qutrit setting.Then, we present a rewrite system by which any Clifford circuit can be reduced to this normal form.We then simplify the rewrite rules in this procedure to a small natural set of rules, giving a clean presentation of the group of qutrit Clifford unitaries in terms of generators and relations.

arXiv:2508.14670•Electronic Proceedings in Theoretical Computer Science•Aug 19, 2025•2 citations

Generators And Relations for Some Classes of Quantum Circuits

Xiaoning Bian

We give three finite presentations in terms of generators and relations for three groups of operators. The operators are frequently used in quantum computation. The result can potentially be used to optimize quantum circuits. Two of the three proofs use the Reidemeister-Schreier theorem. Both the Reidemeister-Schreier theorem and the two proofs using it have been formally verified in the proof assistant Agda. First, we give a finite presentation of the group of 2-qubit Clifford+T operators. The proof applies the Reidemeister-Schreier theorem to a finite presentation of a supergroup of the 2-qubit Clifford+T group that was given by Greylyn. The process generates hundreds of relations. We then simplify them to 20 relations using a Pauli rotation representation as an almost-normal form. Second, we give a finite presentation of U_n (Z[1/2, i]), the group of unitary n × n- matrices with entries in Z[1/2, i]. Amy, Glaudell, and Ross showed that this group is generated by a certain set of two-level matrices, and they also gave an exact synthesis algorithm that converts any element of U_n (Z[1/2, i]) to a word in these generators. We say that a word is in normal form if it is an output of the exact synthesis algorithm. Using what we call semantically guided rewriting, we show that each word in the two-level generators is equivalent to a normal form under the congruence generated by finitely many relations. Third, we give a finite presentation of the group of 3-qubit Clifford+CS operators. Amy, Glaudell, and Ross proved that up to a condition on the determinant, the n-qubit Clifford+CS group is exactly U_(2^n) (Z[1/2, i]). In particular, the 3-qubit Clifford+CS group is a subgroup of U_8 (Z[1/2, i]) of index 2. Using a similar technique as in our first result, we repeatedly apply the Reidemeister-Schreier theorem to the presentation of U_8 (Z[1/2, i]) (from our second result), and then simplify thousands of relations into 17 relations. To do the simplification, we devise an almost-normal form for Clifford+CS operators. We also show that the 3-qubit Clifford+CS group, which is of course infinite, is the amalgamated product of three finite subgroups.

•Aug 24, 2023•0 citations

A Complete and Natural Rule Set for Multi-Qudit Clifford Circuits in All Odd Prime Dimensions

Xiaoning Bian, Sarah Meng Li, Neil J. Ross +2 more

We present a complete set of $16$ rewrite rules for multi-qudit Clifford circuits in all odd prime dimensions. Completeness means that any two Clifford circuits representing the same linear map can be rewritten into each other using these rules. Each rule involves at most three qudits and admits an intuitive interpretation. To establish completeness, we first work at the symplectic level, using the isomorphism between the symplectic group $\mathrm{Sp}(2n,\mathbb{Z}_p)$ and the quotient of the Clifford group by the Pauli group. We construct a circuit normal form that captures the stabiliser tableau of a Clifford operator and is unique up to Pauli correction. Using this normal form, we derive a complete set of symplectic relations, which we then lift to Clifford relations by incorporating Pauli corrections. We also formally verify completeness in the Agda proof assistant.

quant-pharXiv:2609.40106•Oct 1, 2026•0 citations

A Normal Form for Single-Qudit Clifford+TTT Operators

Akalank Jain, Amolak Ratan Kalra, Shiroman Prakash

We propose a normal form for single-qudit gates composed of Clifford and $T$-gates for qudits of odd prime dimension $p\geq 5$. We prove that any single-qudit Clifford+$T$ operator can be re-expressed in this normal form in polynomial time. We also provide strong numerical evidence that this normal form is unique. Assuming uniqueness, we are able to use this normal form to provide an algorithm for exact synthesis of any single-qudit Clifford+$T$ operator with minimal $T$-count.

arXiv:2011.07970•Nov 16, 2020•0 citations
Real stabilizer operators, which are also known as real Clifford operators, are generated, through composition and tensor product, by the Hadamard gate, the Pauli Z gate, and the controlled-Z gate. We introduce a normal form for real stabilizer circuits and show that every real stabilizer operator admits a unique normal form. Moreover, we give a finite set of relations that suffice to rewrite any Clifford circuit to its normal form. This yields a presentation by generators and relations of the strict spatial monoidal category of real stabilizer operators.
We present a complete set of rewrite rules for n-qutrit Clifford circuits where n is any non-negative integer.This is the first completeness result for any fragment of quantum circuits in odd prime dimensions.We first generalize Selinger's normal form for n-qubit Clifford circuits to the qutrit setting.Then, we present a rewrite system by which any Clifford circuit can be reduced to this normal form.We then simplify the rewrite rules in this procedure to a small natural set of rules, giving a clean presentation of the group of qutrit Clifford unitaries in terms of generators and relations.
We give three finite presentations in terms of generators and relations for three groups of operators. The operators are frequently used in quantum computation. The result can potentially be used to optimize quantum circuits. Two of the three proofs use the Reidemeister-Schreier theorem. Both the Reidemeister-Schreier theorem and the two proofs using it have been formally verified in the proof assistant Agda. First, we give a finite presentation of the group of 2-qubit Clifford+T operators. The proof applies the Reidemeister-Schreier theorem to a finite presentation of a supergroup of the 2-qubit Clifford+T group that was given by Greylyn. The process generates hundreds of relations. We then simplify them to 20 relations using a Pauli rotation representation as an almost-normal form. Second, we give a finite presentation of U_n (Z[1/2, i]), the group of unitary n × n- matrices with entries in Z[1/2, i]. Amy, Glaudell, and Ross showed that this group is generated by a certain set of two-level matrices, and they also gave an exact synthesis algorithm that converts any element of U_n (Z[1/2, i]) to a word in these generators. We say that a word is in normal form if it is an output of the exact synthesis algorithm. Using what we call semantically guided rewriting, we show that each word in the two-level generators is equivalent to a normal form under the congruence generated by finitely many relations. Third, we give a finite presentation of the group of 3-qubit Clifford+CS operators. Amy, Glaudell, and Ross proved that up to a condition on the determinant, the n-qubit Clifford+CS group is exactly U_(2^n) (Z[1/2, i]). In particular, the 3-qubit Clifford+CS group is a subgroup of U_8 (Z[1/2, i]) of index 2. Using a similar technique as in our first result, we repeatedly apply the Reidemeister-Schreier theorem to the presentation of U_8 (Z[1/2, i]) (from our second result), and then simplify thousands of relations into 17 relations. To do the simplification, we devise an almost-normal form for Clifford+CS operators. We also show that the 3-qubit Clifford+CS group, which is of course infinite, is the amalgamated product of three finite subgroups.
We present a complete set of 161616 rewrite rules for multi-qudit Clifford circuits in all odd prime dimensions. Completeness means that any two Clifford circuits representing the same linear map can be rewritten into each other using these rules. Each rule involves at most three qudits and admits an intuitive interpretation. To establish completeness, we first work at the symplectic level, using the isomorphism between the symplectic group Sp(2n,Zp)\mathrm{Sp}(2n,\mathbb{Z}_p)Sp(2n,Zp​) and the quotient of the Clifford group by the Pauli group. We construct a circuit normal form that captures the stabiliser tableau of a Clifford operator and is unique up to Pauli correction. Using this normal form, we derive a complete set of symplectic relations, which we then lift to Clifford relations by incorporating Pauli corrections. We also formally verify completeness in the Agda proof assistant.
We propose a normal form for single-qudit gates composed of Clifford and TTT-gates for qudits of odd prime dimension p≥5p\geq 5p≥5. We prove that any single-qudit Clifford+TTT operator can be re-expressed in this normal form in polynomial time. We also provide strong numerical evidence that this normal form is unique. Assuming uniqueness, we are able to use this normal form to provide an algorithm for exact synthesis of any single-qudit Clifford+TTT operator with minimal TTT-count.