1,363 research outputs found
Towards a Minimal Stabilizer ZX-calculus
No full text13+15 pagesInternational audienceThe 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
Completeness of the ZX-calculus
No full textThe ZX-calculus is an intuitive but also mathematically strict graphical
language for quantum computing, which is especially powerful for the framework
of quantum circuits. Completeness of the ZX-calculus means any equality of
matrices with size powers of can be derived purely diagrammatically. In
this thesis, we give the first complete axiomatisation the ZX-calculus for the
overall pure qubit quantum mechanics, via a translation from the completeness
result of another graphical language for quantum computing -- the ZW-calculus.
This paves the way for automated pictorial quantum computing, with the aid of
some software like Quantomatic. Based on this universal completeness, we
directly obtain a complete axiomatisation of the ZX-calculus for the Clifford+T
quantum mechanics, which is approximatively universal for quantum computing, by
restricting the ring of complex numbers to its subring corresponding to the
Clifford+T fragment resting on the completeness theorem of the ZW-calculus for
arbitrary commutative ring. Furthermore, we prove the completeness of the
ZX-calculus (with just 9 rules) for 2-qubit Clifford+T circuits by verifying
the complete set of 17 circuit relations in diagrammatic rewriting. In addition
to completeness results within the qubit related formalism, we extend the
completeness of the ZX-calculus for qubit stabilizer quantum mechanics to the
qutrit stabilizer system. Finally, we show with some examples the application
of the ZX-calculus to the proof of generalised supplementarity, the
representation of entanglement classification and Toffoli gate, as well as
equivalence-checking for the UMA gate.Comment: 178 pages, PhD thesi
Completeness of the ZX-calculus
No full textThe ZX-calculus is an intuitive but also mathematically strict graphical language for quantum computing, which is especially powerful for the framework of quantum circuits. Completeness of the ZX-calculus means any equality of matrices with size powers of n can be derived purely diagrammatically. In this thesis, we give the first complete axiomatisation the ZX-calculus for the overall pure qubit quantum mechanics, via a translation from the completeness result of another graphical language for quantum computing– the ZW-calculus. This paves the way for automated pictorial quantum computing, with the aid of some software like Quantomatic. Based on this universal completeness, we directly obtain a complete axiomatisation of the ZX-calculus for the Cliord+T quantum mechanics, which is approximatively universal for quantum computing, by restricting the ring of complex numbers to its subring corresponding to the Cliord+T fragment resting on the completeness theorem of the ZW-calculus for arbitrary commutative ring. Furthermore, we prove the completeness of the ZX-calculus (with just 9 rules) for 2-qubit Cliord+T circuits by verifying the complete set of 17 circuit relations in diagrammatic rewriting. This is an important step towards efficient simplification of general n-qubit Cliord+T circuits, considering that we now have all the necessary rules for diagrammatical quantum reasoning and a very simple construction of Tooli gate within our axiomatisation framework, which is approximately universal for quantum computation together with the Hadamard gate. In addition to completeness results within the qubit related formalism, we extend the completeness of the ZX-calculus for qubit stabilizer quantum mechanics to the qutrit stabilizer system. Finally, we show with some examples the application of the ZX-calculus to the proof of generalised supplementarity, the representation of entanglement classification and Tooli gate, as well as equivalence-checking for the UMA gate
An update on the research of human thelaziosis
No full textThelaziosis is one of the parasitic zoonoses which affects the eyes of humans and domestic animals. This review covers its distribution, morphology and life cycle of the parasite, pathogenesis, clinical diagnosis, treatment, and prevention of the disease
A Simplified Stabilizer ZX-calculus
No full text27 pagesInternational audienceThe stabilizer ZX-calculus is a rigorous graphical language for reasoning about stabilizer quantum mechanics. This language has been proved to be complete in two steps: first in a setting where scalars (diagrams with no inputs or outputs) are ignored and then in a more general setting where a new symbol and three additional rules have been added to keep track of scalars. Here, we introduce a simplified version of the stabilizer ZX-calculus: we give a smaller set of axioms and prove that meta-rules like `only the topology matters', `colour symmetry' and `upside-down symmetry', which were considered as axioms in previous versions of the stabilizer ZX-calculus, can in fact be derived. In particular, we show that the additional symbol and one of the rules introduced for proving the completeness of the scalar stabilizer ZX-calculus are not necessary. We furthermore show that the remaining two rules dedicated to scalars cannot be derived from the other rules, i.e. they are necessary
The ZX Calculus is incomplete for Clifford+T quantum mechanics
No full textInternational audienceThe ZX calculus is a diagrammatic language for quantum mechanics and quantum information processing. We prove that the ZX-calculus is not complete for Clifford+T quantum mechanics. The completeness for this fragment has been stated as one of the main current open problems in categorical quantum mechanics. The ZX calculus was known to be incomplete for quantum mechanics, on the other hand, it has been proved complete for Clifford quantum mechanics (a.k.a. stabilizer quantum mechanics), and for single-qubit Clifford+T quantum mechanics. The question of the completeness of the ZX calculus for Clifford+T quantum mechanics is a crucial step in the development of the ZX calculus because of its (approximate) universality for quantum mechanics (i.e. any unitary evolution can be approximated using Clifford and T gates only). We exhibit a property which is know to be true in Clifford+T quantum mechanics and prove that this equation cannot be derived in the ZX calculus by introducing a new sound interpretation of the ZX calculus in which this particular property does not hold. Finally, we propose to extend the language with a new axiom
The ZX Calculus is incomplete for Clifford+T quantum mechanics
No full textInternational audienceThe ZX calculus is a diagrammatic language for quantum mechanics and quantum information processing. We prove that the ZX-calculus is not complete for Clifford+T quantum mechanics. The completeness for this fragment has been stated as one of the main current open problems in categorical quantum mechanics. The ZX calculus was known to be incomplete for quantum mechanics, on the other hand, it has been proved complete for Clifford quantum mechanics (a.k.a. stabilizer quantum mechanics), and for single-qubit Clifford+T quantum mechanics. The question of the completeness of the ZX calculus for Clifford+T quantum mechanics is a crucial step in the development of the ZX calculus because of its (approximate) universality for quantum mechanics (i.e. any unitary evolution can be approximated using Clifford and T gates only). We exhibit a property which is know to be true in Clifford+T quantum mechanics and prove that this equation cannot be derived in the ZX calculus by introducing a new sound interpretation of the ZX calculus in which this particular property does not hold. Finally, we propose to extend the language with a new axiom
The ZX Calculus is incomplete for Clifford+T quantum mechanics
No full textInternational audienceThe ZX calculus is a diagrammatic language for quantum mechanics and quantum information processing. We prove that the ZX-calculus is not complete for Clifford+T quantum mechanics. The completeness for this fragment has been stated as one of the main current open problems in categorical quantum mechanics. The ZX calculus was known to be incomplete for quantum mechanics, on the other hand, it has been proved complete for Clifford quantum mechanics (a.k.a. stabilizer quantum mechanics), and for single-qubit Clifford+T quantum mechanics. The question of the completeness of the ZX calculus for Clifford+T quantum mechanics is a crucial step in the development of the ZX calculus because of its (approximate) universality for quantum mechanics (i.e. any unitary evolution can be approximated using Clifford and T gates only). We exhibit a property which is know to be true in Clifford+T quantum mechanics and prove that this equation cannot be derived in the ZX calculus by introducing a new sound interpretation of the ZX calculus in which this particular property does not hold. Finally, we propose to extend the language with a new axiom
The ZX Calculus is incomplete for Clifford+T quantum mechanics
No full textInternational audienceThe ZX calculus is a diagrammatic language for quantum mechanics and quantum information processing. We prove that the ZX-calculus is not complete for Clifford+T quantum mechanics. The completeness for this fragment has been stated as one of the main current open problems in categorical quantum mechanics. The ZX calculus was known to be incomplete for quantum mechanics, on the other hand, it has been proved complete for Clifford quantum mechanics (a.k.a. stabilizer quantum mechanics), and for single-qubit Clifford+T quantum mechanics. The question of the completeness of the ZX calculus for Clifford+T quantum mechanics is a crucial step in the development of the ZX calculus because of its (approximate) universality for quantum mechanics (i.e. any unitary evolution can be approximated using Clifford and T gates only). We exhibit a property which is know to be true in Clifford+T quantum mechanics and prove that this equation cannot be derived in the ZX calculus by introducing a new sound interpretation of the ZX calculus in which this particular property does not hold. Finally, we propose to extend the language with a new axiom
A Simplified Stabilizer ZX-calculus
No full text27 pagesInternational audienceThe stabilizer ZX-calculus is a rigorous graphical language for reasoning about stabilizer quantum mechanics. This language has been proved to be complete in two steps: first in a setting where scalars (diagrams with no inputs or outputs) are ignored and then in a more general setting where a new symbol and three additional rules have been added to keep track of scalars. Here, we introduce a simplified version of the stabilizer ZX-calculus: we give a smaller set of axioms and prove that meta-rules like `only the topology matters', `colour symmetry' and `upside-down symmetry', which were considered as axioms in previous versions of the stabilizer ZX-calculus, can in fact be derived. In particular, we show that the additional symbol and one of the rules introduced for proving the completeness of the scalar stabilizer ZX-calculus are not necessary. We furthermore show that the remaining two rules dedicated to scalars cannot be derived from the other rules, i.e. they are necessary
- …
