Generators and relations for n-qubit Clifford operators
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.
Main Author: | Peter Selinger |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2015-06-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/1570/pdf |
Similar Items
-
Linear Dependent Type Theory for Quantum Programming Languages
by: Peng Fu, et al.
Published: (2022-09-01) -
Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of Quantum Computing
by: Renaud Vilmart
Published: (2024-03-01) -
Completeness of the ZX-Calculus
by: Emmanuel Jeandel, et al.
Published: (2020-06-01) -
New Directions in Categorical Logic, for Classical, Probabilistic and Quantum Logic
by: Bart Jacobs
Published: (2015-10-01) -
Proof-Relevant Logical Relations for Name Generation
by: Nick Benton, et al.
Published: (2018-03-01)