Graph States and the Necessity of Euler Decomposition
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.
Keywordsquantum computation monoidal categories graphical calculi
Unable to display preview. Download preview PDF.
- 3.Hein, M., Dür, W., Eisert, J., Raussendorf, R., Van den Nest, M., Briegel, H.J.: Entanglement in graph states and its applications. In: Proceedings of the International School of Physics “Enrico Fermi” on Quantum Computers, Algorithms and Chaos (July 2005)Google Scholar
- 8.Selinger, P.: Dagger compact closed categories and completely positive maps. In: Proceedings of the 3rd International Workshop on Quantum Programming Languages (2005)Google Scholar
- 9.Duncan, R.: Types for Quantum Computation. PhD thesis. Oxford University (2006)Google Scholar
- 10.Coecke, B., Pavlovic, D., Vicary, J.: A new description of orthogonal bases. Math. Structures in Comp. Sci., 13 (2008), http://arxiv.org/abs/0810.0812 (to appear)