It has recently been shown that it is possible to represent the complete quantum state of any system as a phase-space quasi-probability distribution (Wigner function) [Phys Rev Lett 117, 180401]. Such functions take the form of expectation values of an observable that has a direct analogy to displaced parity operators. In this work we give a procedure for the measurement of the Wigner function that should be applicable to any quantum system. We have applied our procedure to IBM's Quantum Experience five-qubit quantum processor to demonstrate that we can measure and generate the Wigner functions of two different Bell states as well as the five-qubit Greenberger-Horne-Zeilinger (GHZ) state. As Wigner functions for spin systems are not unique, we define, compare, and contrast two distinct examples. We show how using these Wigner functions leads to an optimal method for quantum state analysis especially in the situation where specific characteristic features are of particular interest (such as for spin Schrödinger cat states). Furthermore we show that this analysis leads to straightforward, and potentially very efficient, entanglement test and state characterisation methods.

No abstract

Three new graph invariants are introduced which may be measured from a quantum graph state and form examples of a framework under which other graph invariants can be constructed. Each invariant is based on distinguishing a different number of qubits. This is done by applying alternate measurements to the qubits to be distinguished. The performance of these invariants is evaluated and compared to classical invariants. We verify that the invariants can distinguish all non-isomorphic graphs with 9 or fewer nodes. The invariants have also been applied to 'classically hard' strongly regular graphs, successfully distinguishing all strongly regular graphs of up to 29 nodes, and preliminarily to weighted graphs. We have found that although it is possible to prepare states with a polynomial number of operations, the average number of preparations required to distinguish non-isomorphic graph states scales exponentially with the number of nodes. We have so far been unable to find operators which reliably compare graphs and reduce the required number of preparations to feasible levels. arXiv:1711.09842v3 [quant-ph]