CV Cluster Graph Designer
Design and visualize continuous-variable cluster state graphs with customizable topologies and adjacency matrices
Graph State Definition
A CV cluster state is defined by its adjacency matrix A, where Ajk specifies the CZ gate weight between modes j and k. The nullifier operators are:
δj = pj - Σk Ajk xk
Ideal cluster: ⟨δj²⟩ → 0 for infinite squeezing
Common Topologies:
- Linear: 1D chain for single-rail encoding
- Square: 2D lattice for surface codes
- Hexagonal: Optimal for certain MBQC tasks
- GHZ-Rail: Dual-rail for fault tolerance
Graph Topology
Input Squeezing
Squeezing Parameter r
0.691
Squeezed Variance
0.250
Anti-Squeezed Variance
4.000
Graph Properties
Nodes (modes)
4
Edges (CZ gates)
4
Max Degree
2
Nullifiers
4
Mesh Depth
~3
Graph Visualization
Adjacency Matrix A
Click cells to toggle edges (symmetric matrix). Diagonal is always 0.