Graph states in phase space

Abstract

The phase space for a system of $n$ qubits is a discrete grid of $2^n\times 2^n$ points, whose axes are labeled in terms of the elements of the finite field $\Gal{2^n}$ to endow it with proper geometrical properties. We analyze the representation of graph states in that phase space, showing that these states can be identified with a class of non-singular curves. We provide an algebraic representation of the most relevant quantum operations acting on these states and discuss the advantages of this approach.

14 pages. 2 figures. Published in Journal of Physics A

References in corpus (12)

• Measurement-based quantum computation
• Multi-party entanglement in graph states
• Experimental entanglement of six photons in graph states
• Universal resources for measurement-based quantum computation
• Classicality in discrete Wigner functions
• Quantum Error Correcting Codes Using Qudit Graph States
• Active one-way quantum computation with 2-photon 4-qubit cluster states
• Experimental Realization of a Controlled-NOT Gate with Four-Photon Six-Qubit Cluster States
• Non-negative Wigner functions in prime dimensions
• Geometrical approach to mutually unbiased bases
• Discrete phase-space structure of $n$-qubit mutually unbiased bases
• Generalized Ardehali-Bell inequalities for graph states

Cited by in corpus (3)

• Optimal quantum tomography of permutationally invariant qubits
• Discrete phase-space mappings, tomographic condition and permutation invariance
• Discrete phase-space approach to mutually orthogonal Latin squares