A Graphical Rule Book for Clifford Manipulations of Stabilizer States

Stabilizer states, along with Clifford manipulations (unitary transformations and measurements) thereof&#x2014;despite being efficiently simulable on a classical computer&#x2014;are an important tool in quantum information processing, with applications to quantum computing, error correction, and networking. Graph states, defined on a graph, are a special class of stabilizer states that are central to measurement-based quantum computing, all-photonic quantum repeaters, distributed quantum computing, and entanglement distribution in a network. All stabilizer states are local-Clifford equivalent to graph states. In this article, we review the stabilizer framework and extend it by incorporating general stabilizer measurements such as multiqubit joint projections. We provide an explicit procedure&#x2014;using Karnaugh maps from Boolean algebra&#x2014;for converting arbitrary stabilizer gates into tableau operations of the <sc>cnot</sc>&#x2013;Hadamard&#x2013;Phase formalism for efficient stabilizer manipulations. We derive graphical rules for arbitrary stabilizer manipulations of graph states, including multiqubit stabilizer projections and unitaries. We implement the graphical rulebook resulting from above into a MATLAB simulator with a graphical user interface. A user of this tool, e.g., for research in quantum networks, will not require any background in quantum information or the stabilizer framework.