Graph-state Quantum Circuit

Construct and work with a graph-state circuit based on a graph

Graph states (also known as cluster states) are a specific class of multi-qubit entangled states that are defined based on graphs. Graph states are foundational to the one-way quantum computing model (measurement-based quantum computing), where quantum computation is achieved through a sequence of adaptive measurements on an initial graph state.

Generate a random graph with 4 vertexes and 5 edges. Each vertex of the graph corresponds to a qubit, and the edges represent entanglement between the qubits:

In[1]:=

g=RandomGraph[{4,5},VertexLabelsAutomatic]

Out[1]=

Install and load the QuantumFramework paclet:

In[2]:=

PacletInstall["Wolfram/QuantumFramework"]Needs["Wolfram`QuantumFramework`"]

Out[2]=

PacletObject

Name: Wolfram/QuantumFramework

Version: 1.0.35



Create a circuit that generates the corresponding quantum graph state:

In[3]:=

qc=QuantumCircuitOperator[{"Graph",g}]

Out[3]=

Show the circuit diagram:

In[4]:=

qc["Diagram"]

Out[4]=

Show that the circuit acting on a register state creates the expected quantum cluster/graph state:

In[5]:=

ψf=qc[]

Out[5]=

QuantumState

Pure state	Qudits: 4
Type: Vector	Dimension: 16
Picture: Schrödinger



In[6]:=

ψfQuantumState[{"Graph",g}]

Out[6]=

True

Show that qubits connected via an edge are entangled:

In[7]:=

QuantumEntangledQ[ψf,{#1,#}]&@@@EdgeList[g]

Out[7]=

{True,True,True,True,True}

Given a vertex of the graph, find the list of vertices adjacent to it:

In[8]:=

verAdj=Transpose[Through[{VertexList,AdjacencyList}[g]]]

Out[8]=

{{1,{2,3}},{2,{1,3,4}},{3,{1,2,4}},{4,{2,3}}}

Now let's find stabilizers, which are simply a set of operators that represent the symmetries of a quantum state. Given the above list of vertices and their adjacencies find the stabilizers, which can be obtained by Pauli-X on vertex and Pauli-Z on adjacencies:

In[9]:=

stabilizers=QuantumOperator[{"X"#1,"Z"#2}]&@@@verAdj

Out[9]=

QuantumOperator

Picture: Schrödinger	Arity: 3
Dimension: 8→8	Qudits: 3→3

,QuantumOperator

Picture: Schrödinger	Arity: 4
Dimension: 16→16	Qudits: 4→4

,QuantumOperator

Picture: Schrödinger	Arity: 4
Dimension: 16→16	Qudits: 4→4

,QuantumOperator

Picture: Schrödinger	Arity: 3
Dimension: 8→8	Qudits: 3→3



Apply the above list of stabilizers and show that the result is still the same as the original state (that is why it is called stabilizer):

In[10]:=

Thread[Through[stabilizers[ψf]]ψf]

Out[10]=

{True,True,True,True}

Publisher Information

Contributed by: Wolfram Research, Quantum Computation Framework Team

Wolfram Language Example Repository

Graph-state Quantum Circuit

See Also

Publisher Information