Towards a Minimal Stabilizer ZX-calculus - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Logical Methods in Computer Science Année : 2020

Towards a Minimal Stabilizer ZX-calculus

Résumé

The stabilizer ZX-calculus is a rigorous graphical language for reasoning about quantum mechanics. The language is sound and complete: one can transform a stabilizer ZX-diagram into another one using the graphical rewrite rules if and only if these two diagrams represent the same quantum evolution or quantum state. We previously showed that the stabilizer ZX-calculus can be simplified by reducing the number of rewrite rules, without losing the property of completeness [Backens, Perdrix & Wang, EPTCS 236:1--20, 2017]. Here, we show that most of the remaining rules of the language are indeed necessary. We do however leave as an open question the necessity of two rules. These include, surprisingly, the bialgebra rule, which is an axiomatisation of complementarity, the cornerstone of the ZX-calculus. Furthermore, we show that a weaker ambient category -- a braided autonomous category instead of the usual compact closed category -- is sufficient to recover the meta rule 'only connectivity matters', even without assuming any symmetries of the generators.

Dates et versions

hal-01597114 , version 1 (28-09-2017)

Identifiants

Citer

Miriam Backens, Simon Perdrix, Quanlong Wang. Towards a Minimal Stabilizer ZX-calculus. Logical Methods in Computer Science, 2020, 16 (4), pp.19:1-19:30. ⟨10.23638/LMCS-16(4:19)2020⟩. ⟨hal-01597114⟩
240 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More