156 3 Entanglement
A simple example for a CV graph state is the tripartite GHZ-type state defined
in the preceding section corresponding to a linear three-mode graph up to local
Fourier transforms. The graph stabilizer in this case is
S DhX(s) ˝ Z(s) ˝ 1 , Z(s) ˝ X(s) ˝ Z(s), 1 ˝ Z(s) ˝ X(s)i , (3.71)
differing from that in Eq. (3.56) only by local Fourier rotations on qumodes 1 and 3.
More generally, GHZ-type graph states correspond to star graphs, as illustrated in
Figure 3.1b, differing from standard GHZ-type states only by local Fourier rotations
acting upon all nodes except the central one.
The CV graph states discussed so far are only defined in the unphysical limit of
infinite squeezing as expressed by Eq. (3.70), which we may rewrite as
O
p A
O
x ! 0 . (3.72)
Here,
O
p ( Op
1
, Op
2
,..., Op
N
)
T
and
O
x ( Ox
1
, Ox
2
,..., Ox
N
)
T
are the vectors of position
and momentum operators, and A is the corresponding adjacency matrix of the
graph. Thus, Eq. (3.72) represents the entire set of N stabilizer/nullifier conditions
from Eq. (3.70). Any multi-mode Gaussian state satisfying this set of nullifier rela-
tions in the limit of infinite squeezing belongs to the same class of CV graph states
with matrix A. This matrix is symmetric (so the graph is “undirected”), has all di-
agonal entries zero (so the graph has no “self-loops”), and whenever the graph has
an edge, the corresponding element of A is one, otherwise it is zero.
There is now one straightforward and conceptually distinct generalization of the
notion of CV graph states as defined above. First, we may consider arbitrary real
elements in A instead of only zeros and ones. This gives rise to the notion of weight-
ed CV graph states. In this case, one can think of a network of “weighted” CV C
Z
gates, e
2ig
kl
Ox
k
˝Ox
l
, again, pairwise acting upon the input qumodes in state jp D 0i
with real-valued “gains” A
kl
g
kl
2 R for each quadratic interaction. This leads to
a set of more general nullifiers which still satisfy Eq. (3.72) in the unphysical limit
of infinite squeezing. Thus, these weighted graph states remain stabilizer states
which are defined through idealized stabilizer conditions. We note that for qubits,
weighted graph states are no longer stabilizer states. While the additional coeffi-
cients in the CV nullifier conditions still give quadrature linear combinations, an
extra weight in the qubit C
Z
gates would result in non-stabilizer states.
The most general manifestation of a CV graph state, however, allows for complex-
weighted edges of the graph and correspondingly complex nullifier conditions [168].
In this case, the complex adjacency matrix shall be denoted by Z, this time with
nonzero diagonal entries including self-loops in the graph. We define the complex
nullifier conditions
O
p Z
O
x D 0 , (3.73)
now representing a set of exact eigenvalue equations satisfied by the corresponding
complex-weighted graph state jGi,(
O
p Z
O
x)jGiD0. What are these generalized
graph states? One can show that every N-mode Gaussian pure state can be uniquely