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`
C
l
i
f
f
o
r
d
C
h
a
n
n
e
l
C
l
i
f
f
o
r
d
C
h
a
n
n
e
l
[
…
]
r
e
p
r
e
s
e
n
t
s
a
C
l
i
f
f
o
r
d
c
h
a
n
n
e
l
e
n
c
o
d
e
d
a
s
a
C
h
o
i
-
t
a
b
l
e
a
u
A
s
s
o
c
i
a
t
i
o
n
w
i
t
h
k
e
y
s
"
U
A
"
,
"
U
B
"
,
"
c
"
,
"
I
n
p
u
t
Q
u
b
i
t
s
"
,
a
n
d
"
O
u
t
p
u
t
Q
u
b
i
t
s
"
.
C
l
i
f
f
o
r
d
C
h
a
n
n
e
l
[
"
I
d
e
n
t
i
t
y
"
,
n
]
r
e
t
u
r
n
s
t
h
e
i
d
e
n
t
i
t
y
c
h
a
n
n
e
l
o
n
n
q
u
b
i
t
s
.
C
l
i
f
f
o
r
d
C
h
a
n
n
e
l
[
p
s
]
c
o
n
s
t
r
u
c
t
s
a
s
t
a
t
e
-
p
r
e
p
a
r
a
t
i
o
n
c
h
a
n
n
e
l
f
r
o
m
a
P
a
u
l
i
S
t
a
b
i
l
i
z
e
r
(
i
n
p
u
t
s
y
s
t
e
m
e
m
p
t
y
,
o
u
t
p
u
t
e
q
u
a
l
s
t
h
e
s
t
a
b
i
l
i
z
e
r
s
t
a
t
e
)
.
C
l
i
f
f
o
r
d
C
h
a
n
n
e
l
[
q
c
]
c
o
n
s
t
r
u
c
t
s
a
C
l
i
f
f
o
r
d
c
h
a
n
n
e
l
f
r
o
m
a
Q
u
a
n
t
u
m
C
h
a
n
n
e
l
w
h
e
n
t
h
e
c
h
a
n
n
e
l
i
s
a
d
e
t
e
r
m
i
n
i
s
t
i
c
s
i
n
g
l
e
-
P
a
u
l
i
.
c
c
[
a
r
g
]
a
p
p
l
i
e
d
t
o
a
n
o
t
h
e
r
C
l
i
f
f
o
r
d
C
h
a
n
n
e
l
c
o
m
p
o
s
e
s
c
h
a
n
n
e
l
s
(
a
p
p
l
y
a
r
g
f
i
r
s
t
,
t
h
e
n
c
c
)
;
a
p
p
l
i
e
d
t
o
a
P
a
u
l
i
S
t
a
b
i
l
i
z
e
r
e
v
o
l
v
e
s
t
h
e
s
t
a
t
e
;
a
p
p
l
i
e
d
t
o
a
p
r
o
p
e
r
t
y
s
t
r
i
n
g
r
e
t
u
r
n
s
t
h
a
t
p
r
o
p
e
r
t
y
.
D
e
t
a
i
l
s
a
n
d
O
p
t
i
o
n
s
▪
A
C
l
i
f
f
o
r
d
C
h
a
n
n
e
l
encodes a Clifford channel
Φ
: T(
ℋ
A
)
T(
ℋ
B
) by a Choi tableau, following Yashin25 (arXiv:2504.14101) Section 2.3.
▪
The internal representation is an Association
"
U
A
"
u
A
,
"
U
B
"
u
B
,
"
c
"
c
,
"
I
n
p
u
t
Q
u
b
i
t
s
"
n
A
,
"
O
u
t
p
u
t
Q
u
b
i
t
s
"
n
B
where
u
A
is a
k
×
2
n
A
bit matrix on the input system (or
{
}
if
n
A
=
0
),
u
B
is a
k
×
2
n
B
bit matrix on the output system, and
c
is a length-
k
sign bit vector.
▪
E
a
c
h
t
a
b
l
e
a
u
r
o
w
[
u
A
u
B
c
]
e
n
c
o
d
e
s
a
P
a
u
l
i
s
u
p
e
r
o
p
e
r
a
t
o
r
Π
(
u
A
u
B
c
)
[
ρ
]
=
c
(
-
1
)
·
A
2
·
T
r
[
ρ
P
(
u
A
)
]
·
P
(
u
B
)
,
a
n
d
t
h
e
c
h
a
n
n
e
l
a
c
t
s
a
s
t
h
e
a
v
e
r
a
g
e
Φ
[
ρ
]
=
-
(
A
+
B
)
2
·
∑
r
o
w
Π
(
r
o
w
)
[
ρ
]
.
▪
Special cases of the tableau:
▪
- A pure stabilizer state has
n
A
=
0
,
k
=
n
B
rows;
u
B
is the state's stabilizer tableau.
- A Clifford unitary
U
A
B
with
n
A
=
n
B
=
n
has
2
n
rows enumerating Pauli generators and their conjugates;
c
encodes phase signs.
▪
Composition
c
c
1
[
c
c
2
]
applies
c
c
2
first, then
c
c
1
, and is implemented by Boolean null-space intersection on the
B
-side bits, with Aaronson-Gottesman phase tracking and the
|
+
Φ
〉
B
′
B
contraction-sign correction for Y-bearing combined
u
B
Paulis (Yashin25 §3.2/§3.3).
▪
State evolution
c
c
[
p
s
]
has three recognized dispatch cases: (i) identity channel returns
p
s
unchanged; (ii) state-preparation channel (
n
A
=
0
) returns the state encoded by
c
c
; (iii) dim-matched channel builds
C
l
i
f
f
o
r
d
C
h
a
n
n
e
l
[
p
s
]
, composes, and converts back to a
P
a
u
l
i
S
t
a
b
i
l
i
z
e
r
.
▪
C
l
i
f
f
o
r
d
C
h
a
n
n
e
l
[
q
c
]
for a
Q
u
a
n
t
u
m
C
h
a
n
n
e
l
detects deterministic single-Pauli channels by Label (
"
X
"
,
"
-
X
X
"
,
…
); stochastic Pauli channels (
"
B
i
t
F
l
i
p
"
,
"
P
h
a
s
e
F
l
i
p
"
,
…
) emit
C
l
i
f
f
o
r
d
C
h
a
n
n
e
l
:
:
s
t
o
c
h
a
s
t
i
c
and return $Failed (see Possible Issues for the resolution).
▪
The introspection key
c
c
[
"
P
r
o
p
e
r
t
i
e
s
"
]
returns the full list of accepted accessor strings:
"
U
A
"
,
"
U
B
"
,
"
c
"
,
"
I
n
p
u
t
Q
u
b
i
t
s
"
,
"
O
u
t
p
u
t
Q
u
b
i
t
s
"
,
"
R
a
n
k
"
,
"
T
a
b
l
e
a
u
"
, and
"
S
o
u
r
c
e
"
.
Examples
(
4
5
)
Basic Examples
(
5
)
Construct the identity channel on a single qubit:
I
n
[
1
]
:
=
C
l
i
f
f
o
r
d
C
h
a
n
n
e
l
[
"
I
d
e
n
t
i
t
y
"
,
1
]
O
u
t
[
1
]
=
C
l
i
f
f
o
r
d
C
h
a
n
n
e
l
Q
u
b
i
t
s
:
1
→
1
T
a
b
l
e
a
u
r
o
w
s
:
2
S
o
u
r
c
e
:
I
d
e
n
t
i
t
y
Identity on more qubits:
I
n
[
1
]
:
=
C
l
i
f
f
o
r
d
C
h
a
n
n
e
l
[
"
I
d
e
n
t
i
t
y
"
,
2
]
O
u
t
[
1
]
=
C
l
i
f
f
o
r
d
C
h
a
n
n
e
l
Q
u
b
i
t
s
:
2
→
2
T
a
b
l
e
a
u
r
o
w
s
:
4
S
o
u
r
c
e
:
I
d
e
n
t
i
t
y
Build a state-preparation channel from a stabilizer state:
I
n
[
1
]
:
=
C
l
i
f
f
o
r
d
C
h
a
n
n
e
l
P
a
u
l
i
S
t
a
b
i
l
i
z
e
r
[
{
"
X
X
"
,
"
Z
Z
"
}
]
O
u
t
[
1
]
=
C
l
i
f
f
o
r
d
C
h
a
n
n
e
l
Q
u
b
i
t
s
:
0
→
2
T
a
b
l
e
a
u
r
o
w
s
:
2
S
o
u
r
c
e
:
P
a
u
l
i
S
t
a
b
i
l
i
z
e
r
Construct directly from a Choi-tableau Association (raw form):
I
n
[
1
]
:
=
C
l
i
f
f
o
r
d
C
h
a
n
n
e
l
[
A
s
s
o
c
i
a
t
i
o
n
[
"
U
A
"
{
{
1
,
0
}
,
{
0
,
1
}
}
,
"
U
B
"
{
{
1
,
1
}
,
{
0
,
1
}
}
,
"
c
"
{
0
,
0
}
,
"
I
n
p
u
t
Q
u
b
i
t
s
"
1
,
"
O
u
t
p
u
t
Q
u
b
i
t
s
"
1
,
"
S
o
u
r
c
e
"
"
S
"
]
]
O
u
t
[
1
]
=
C
l
i
f
f
o
r
d
C
h
a
n
n
e
l
Q
u
b
i
t
s
:
1
→
1
T
a
b
l
e
a
u
r
o
w
s
:
2
S
o
u
r
c
e
:
S
Interrogate via the property accessor:
I
n
[
1
]
:
=
C
l
i
f
f
o
r
d
C
h
a
n
n
e
l
[
"
I
d
e
n
t
i
t
y
"
,
1
]
[
"
P
r
o
p
e
r
t
i
e
s
"
]
O
u
t
[
1
]
=
{
U
A
,
U
B
,
c
,
I
n
p
u
t
Q
u
b
i
t
s
,
O
u
t
p
u
t
Q
u
b
i
t
s
,
R
a
n
k
,
T
a
b
l
e
a
u
,
S
o
u
r
c
e
}
S
c
o
p
e
(
1
8
)
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
(
1
1
)
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
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
F
r
a
m
e
▪
S
t
a
b
i
l
i
z
e
r
S
t
a
t
e
Q
▪
G
r
a
p
h
S
t
a
t
e
▪
L
o
c
a
l
C
o
m
p
l
e
m
e
n
t
▪
Q
u
a
n
t
u
m
C
h
a
n
n
e
l
▪
Q
u
a
n
t
u
m
M
e
a
s
u
r
e
m
e
n
t
O
p
e
r
a
t
o
r
▪
Q
u
a
n
t
u
m
O
p
e
r
a
t
o
r
▪
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
▪
P
a
u
l
i
M
a
t
r
i
x
▪
K
r
o
n
e
c
k
e
r
P
r
o
d
u
c
t
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
"
"