Wolfram Language
Paclet Repository
Community-contributed installable additions to the Wolfram Language
Primary Navigation
Categories
Cloud & Deployment
Core Language & Structure
Data Manipulation & Analysis
Engineering Data & Computation
External Interfaces & Connections
Financial Data & Computation
Geographic Data & Computation
Geometry
Graphs & Networks
Higher Mathematical Computation
Images
Knowledge Representation & Natural Language
Machine Learning
Notebook Documents & Presentation
Scientific and Medical Data & Computation
Social, Cultural & Linguistic Data
Strings & Text
Symbolic & Numeric Computation
System Operation & Setup
Time-Related Computation
User Interface Construction
Visualization & Graphics
Random Paclet
Alphabetical List
Using Paclets
Create a Paclet
Get Started
Download Definition Notebook
Learn More about
Wolfram Language
QuantumFramework
Tutorials
Getting Started
Quantum Object Composition
Guides
Wolfram Quantum Computation Framework
Tech Notes
Bell's Theorem: CHSH inequality
Circuit Diagram
Exploring Fundamentals of Quantum Theory
QPU Service Connection
Quantum object abstraction
Quantum Optimization
Second Quantization Functions
Tensor Network
Quantum Computation
Symbols
CliffordChannel
EinsteinSummation
GraphState
LocalComplement
PauliStabilizer
QiskitTarget
QuantumBasis
QuantumChannel
QuantumCircuitMultiwayGraph [EXPERIMENTAL]
QuantumCircuitOperator
QuantumDistance
QuantumEntangledQ
QuantumEntanglementMonotone
QuantumEvolve
QuantumMeasurement
QuantumMeasurementOperator
QuantumMeasurementSimulation
QuantumMPS [EXPERIMENTAL]
QuantumOperator
QuantumPartialTrace
QuantumPhaseSpaceTransform
QuantumQASM
QuantumShortcut [EXPERIMENTAL]
QuantumSimilarity
QuantumStateEstimate [EXPERIMENTAL]
QuantumState
QuantumTensorProduct
QuantumWignerMICTransform [EXPERIMENTAL]
QuantumWignerTransform [EXPERIMENTAL]
QuditBasis
QuditName
StabilizerFrame
StabilizerStateQ
Wolfram`QuantumFramework`
G
r
a
p
h
S
t
a
t
e
G
r
a
p
h
S
t
a
t
e
[
g
]
r
e
p
r
e
s
e
n
t
s
t
h
e
g
r
a
p
h
s
t
a
t
e
o
f
t
h
e
u
n
d
i
r
e
c
t
e
d
g
r
a
p
h
g
w
i
t
h
i
d
e
n
t
i
t
y
v
e
r
t
e
x
-
o
p
e
r
a
t
o
r
-
P
a
u
l
i
s
(
V
O
P
s
)
o
n
e
v
e
r
y
v
e
r
t
e
x
.
G
r
a
p
h
S
t
a
t
e
[
p
s
]
c
o
n
v
e
r
t
s
a
g
r
a
p
h
-
f
o
r
m
P
a
u
l
i
S
t
a
b
i
l
i
z
e
r
p
s
i
n
t
o
t
h
e
c
o
r
r
e
s
p
o
n
d
i
n
g
G
r
a
p
h
S
t
a
t
e
;
t
h
e
i
n
p
u
t
m
u
s
t
h
a
v
e
X
i
a
t
t
h
e
d
i
a
g
o
n
a
l
o
f
e
v
e
r
y
s
t
a
b
i
l
i
z
e
r
r
o
w
a
n
d
Z
j
o
r
I
j
e
l
s
e
w
h
e
r
e
.
D
e
t
a
i
l
s
a
n
d
O
p
t
i
o
n
s
▪
A
G
r
a
p
h
S
t
a
t
e
s
t
o
r
e
s
a
s
t
a
b
i
l
i
z
e
r
s
t
a
t
e
i
n
t
h
e
g
r
a
p
h
-
s
t
a
t
e
r
e
p
r
e
s
e
n
t
a
t
i
o
n
i
n
t
r
o
d
u
c
e
d
b
y
A
n
d
e
r
s
&
B
r
i
e
g
e
l
(
a
r
X
i
v
:
q
u
a
n
t
-
p
h
/
0
5
0
4
1
1
7
)
.
F
o
r
a
g
r
a
p
h
G
=
(
V
,
E
)
t
h
e
a
s
s
o
c
i
a
t
e
d
s
t
a
t
e
i
s
|
G
〉
=
∏
e
∈
E
C
Z
e
|
⊗
n
+
〉
,
i
.
e
.
t
h
e
a
p
p
l
i
c
a
t
i
o
n
o
f
a
c
o
n
t
r
o
l
l
e
d
-
Z
o
n
e
v
e
r
y
e
d
g
e
t
o
t
h
e
a
l
l
-
p
l
u
s
s
t
a
t
e
.
▪
The internal representation is the Association
"
G
r
a
p
h
"
g
,
"
V
O
P
s
"
{
0
,
…
}
. The
"
V
O
P
s
"
field stores a list of integer indices into the 24-element single-qubit Clifford group; currently only the identity (index
0
) is exercised.
▪
T
h
e
s
t
a
b
i
l
i
z
e
r
g
e
n
e
r
a
t
o
r
s
o
f
t
h
e
g
r
a
p
h
s
t
a
t
e
a
r
e
r
e
a
d
o
f
f
t
h
e
g
r
a
p
h
:
f
o
r
e
a
c
h
v
e
r
t
e
x
i
,
K
i
=
X
i
⊗
∏
j
∈
N
(
i
)
Z
j
,
w
h
e
r
e
N
(
i
)
i
s
t
h
e
n
e
i
g
h
b
o
u
r
s
e
t
o
f
i
.
▪
The graph-state representation has memory cost
O
(
n
·
d
)
where
d
is the average vertex degree, which is asymptotically smaller than the
O
(
2
n
)
tableau for sparsely-connected codes.
▪
The
G
r
a
p
h
S
t
a
t
e
[
p
s
]
conversion succeeds only on graph-form stabilizers (one
X
on the diagonal,
Z
/
I
elsewhere); other inputs emit
G
r
a
p
h
S
t
a
t
e
:
:
n
o
n
g
r
a
p
h
and return
$
F
a
i
l
e
d
. Use a local-Clifford transformation (AndBri05 Lemma 1) to bring an arbitrary stabilizer state into graph form before calling.
▪
Two graph states (with identity VOPs) are local-Clifford-equivalent if and only if their graphs are related by a sequence of local complementations (
L
o
c
a
l
C
o
m
p
l
e
m
e
n
t
); this is the basis of the graph-state classification of stabilizer states (AndBri05 Theorem 1, Hein-Eisert-Briegel arXiv:quant-ph/0602096).
▪
Property access uses the dispatch syntax
g
s
[
"
p
r
o
p
e
r
t
y
"
]
; the full list of recognised properties is given by
g
s
[
"
P
r
o
p
e
r
t
i
e
s
"
]
. Conversion to a
P
a
u
l
i
S
t
a
b
i
l
i
z
e
r
is done via
g
s
[
"
P
a
u
l
i
S
t
a
b
i
l
i
z
e
r
"
]
.
Examples
(
2
4
)
Basic Examples
(
1
)
The graph state of a 4-cycle:
I
n
[
1
]
:
=
G
r
a
p
h
S
t
a
t
e
[
C
y
c
l
e
G
r
a
p
h
[
4
]
]
O
u
t
[
2
]
=
G
r
a
p
h
S
t
a
t
e
V
e
r
t
i
c
e
s
:
4
E
d
g
e
s
:
4
The graph state of a 3-path:
I
n
[
1
]
:
=
G
r
a
p
h
S
t
a
t
e
[
P
a
t
h
G
r
a
p
h
[
{
1
,
2
,
3
}
]
]
O
u
t
[
2
]
=
G
r
a
p
h
S
t
a
t
e
V
e
r
t
i
c
e
s
:
3
E
d
g
e
s
:
2
The graph state of a 4-vertex star (GHZ-equivalent under local Cliffords):
I
n
[
1
]
:
=
G
r
a
p
h
S
t
a
t
e
[
S
t
a
r
G
r
a
p
h
[
4
]
]
O
u
t
[
2
]
=
G
r
a
p
h
S
t
a
t
e
V
e
r
t
i
c
e
s
:
4
E
d
g
e
s
:
3
A graph-form PauliStabilizer is converted directly:
I
n
[
1
]
:
=
G
r
a
p
h
S
t
a
t
e
P
a
u
l
i
S
t
a
b
i
l
i
z
e
r
[
{
"
X
Z
I
"
,
"
Z
X
Z
"
,
"
I
Z
X
"
}
]
O
u
t
[
2
]
=
G
r
a
p
h
S
t
a
t
e
V
e
r
t
i
c
e
s
:
3
E
d
g
e
s
:
2
Inspecting stabilizers and the underlying graph:
I
n
[
1
]
:
=
M
o
d
u
l
e
{
g
s
}
,
g
s
=
G
r
a
p
h
S
t
a
t
e
[
C
y
c
l
e
G
r
a
p
h
[
4
]
]
;
{
g
s
[
"
V
e
r
t
e
x
C
o
u
n
t
"
]
,
g
s
[
"
E
d
g
e
C
o
u
n
t
"
]
,
g
s
[
"
S
t
a
b
i
l
i
z
e
r
s
"
]
}
O
u
t
[
2
]
=
{
4
,
4
,
{
X
Z
I
Z
,
Z
X
Z
I
,
I
Z
X
Z
,
Z
I
Z
X
}
}
S
c
o
p
e
(
4
)
G
e
n
e
r
a
l
i
z
a
t
i
o
n
s
&
E
x
t
e
n
s
i
o
n
s
(
1
)
O
p
t
i
o
n
s
(
8
)
A
p
p
l
i
c
a
t
i
o
n
s
(
2
)
P
r
o
p
e
r
t
i
e
s
&
R
e
l
a
t
i
o
n
s
(
4
)
P
o
s
s
i
b
l
e
I
s
s
u
e
s
(
3
)
N
e
a
t
E
x
a
m
p
l
e
s
(
1
)
S
e
e
A
l
s
o
L
o
c
a
l
C
o
m
p
l
e
m
e
n
t
▪
P
a
u
l
i
S
t
a
b
i
l
i
z
e
r
▪
S
t
a
b
i
l
i
z
e
r
S
t
a
t
e
Q
▪
S
t
a
b
i
l
i
z
e
r
F
r
a
m
e
▪
C
l
i
f
f
o
r
d
C
h
a
n
n
e
l
▪
Q
u
a
n
t
u
m
S
t
a
t
e
▪
Q
u
a
n
t
u
m
C
i
r
c
u
i
t
O
p
e
r
a
t
o
r
▪
G
r
a
p
h
▪
A
d
j
a
c
e
n
c
y
M
a
t
r
i
x
▪
P
a
u
l
i
M
a
t
r
i
x
R
e
l
a
t
e
d
G
u
i
d
e
s
▪
W
o
l
f
r
a
m
Q
u
a
n
t
u
m
C
o
m
p
u
t
a
t
i
o
n
F
r
a
m
e
w
o
r
k
"
"