Mathematical theory and computational practice. 5th conference on computability in Europe, CiE 2009, Heidelberg, Germany, July 19--24, 2009. Proceedings

DOI10.1007/978-3-642-03073-4zbMATH Open1192.68004arXiv0902.0500OpenAlexW4296295483WikidataQ62472271 ScholiaQ62472271MaRDI QIDQ983102FDOQ983102

Authors:

Publication date: 28 July 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Abstract: Coecke and Duncan recently introduced a categorical formalisation of the interaction of complementary quantum observables. In this paper we use their diagrammatic language to study graph states, a computationally interesting class of quantum states. We give a graphical proof of the fixpoint property of graph states. We then introduce a new equation, for the Euler decomposition of the Hadamard gate, and demonstrate that Van den Nest's theorem--locally equivalent graphs represent the same entanglement--is equivalent to this new axiom. Finally we prove that the Euler decomposition equation is not derivable from the existing axioms.

Full work available at URL: https://arxiv.org/abs/0902.0500

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70) Theory of computing (68Qxx)

Cited In (3)

This page was built for publication: Mathematical theory and computational practice. 5th conference on computability in Europe, CiE 2009, Heidelberg, Germany, July 19--24, 2009. Proceedings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q983102)