How to cook

a quantum computer

A. Cabello, L. Danielsen, A. López Tarrida, P. Moreno,

J. R. Portillo

University of Seville, Spain

University of Bergen, Norway

ACCOTA
Playa del Carmen, Mexico. November 2010
08/12/21 03:41 AM
 How to cook
a quantum graph state

A. Cabello, L. Danielsen, A. López Tarrida, P. Moreno,

J. R. Portillo

University of Seville, Spain

University of Bergen, Norway

ACCOTA
Playa del Carmen, Mexico. November 2010
08/12/21 03:41 AM
 Optimal preparation
of quantum graph states

A. Cabello, L. Danielsen, A. López Tarrida, P. Moreno,

J. R. Portillo

University of Seville, Spain

University of Bergen, Norway

ACCOTA
Playa del Carmen, Mexico. November 2010
03:41 AM
 Some previous ideas

Bit vs. qubit

 Some ideas

Bit vs. qubit

Quantum states: superposition and entaglement

Stabilizer states
graph states
 Some ideas

Bit vs. qubit

Quantum states: superposition and entaglement

Stabilizer states
graph states ← Oh! Graph Theory
 Some ideas

Bit vs. qubit

Quantum states: superposition and entaglement

Stabilizer states
graph states ← Oh! Graph Theory

Entaglement measures
Representative graph state
Quantum computers are made with graph states, but are unstable
Bit

0 and 1 (on/off, true/false, yes/no).

 Qubit

Schumacher, 1995

2-dimensional quantum physic system,

Hilbert space isomorphic to C2.

E.g.,
½ spin particle.

Photon polarization.

Two relevant states physic system.

BASIC STATE VECTORS ∣0〉 ∣1〉

Qubit

PHYSICS MATHEMATICS
2
Η isomorphic to C
1

0
=:∣0 〉∈C 2

0

1
=:∣1 〉∈C 2

1

0
=:∣0 〉∈C 2

0

1
=:∣1 〉∈C 2
 Quantum Mechanics: superpositions

then

If it is posible and 

IRL
Atoms:

Photons:

laser

Qubit

qubit INFINITE PURE STATES:

Lineal superposition (coherent) of basic states:

2
∣ψ 〉=α ∣0〉β∣1〉∈C
2 2
∣α∣ ∣β∣ =1
Or:

θ iφ θ
∣ψ 〉=cos ∣0 〉e sen ∣1 〉
2 2 BLOCH's sphere
Complex SYSTEMS

PHYSCIS MATHEMATICS

H1 ⊗ H2
PRODUCT STATES:
1 1
 
0
⊗ =:∣00 〉∈C 2 ⊗ C 2
0
0 0
 
1
⊗ =:∣11 〉∈C 2 ⊗ C 2
1

ENTAGLEMENT STATES:
1 1 0 0
  
0
⊗  ⊗ =:∣00 〉∣11 〉∈C 2 ⊗ C 2
0 1 1
 Classification of states by entaglement

Pure state of a multipartite quantum system is ENTAGLED

if it is NOT a product of states .

Entagled states CANNOT be preparated with local dispositives.

much stronger correlated than all possible classic systems.

Quantum Mechanics => ENTAGLEMENTS

Theory / Applications
 Classification of states by entaglement

CRITERIA (pure states, multipartites)

Equivalent entaglement:

∣ψ 〉 ≡LOCC ∣φ 〉 ∣ψ 〉 ≡LOCC ∣φ 〉⇔∣ψ 〉≡LU ∣φ 〉

Infinite classes, (bipartites too).

Equivalent entaglement:

∣ψ 〉 ≡SLOCC ∣φ 〉 ∣ψ 〉≡LU ∣φ 〉⇒∣ψ 〉 ≡SLOCC ∣φ 〉

Infinite classes, (three parts or more).

W. Dür, G. Vidal and J. I. Cirac, Phys. Rev. A 62, 062314 (2000).

F. Verstraete et al., Phys. Rev. A 65, 052112 (2002).
 Classification of states by entaglement

n>3 qubits: INFINITE amount

of different, INEQUIVALENT
classes of ENTAGLED STATES

Subsets of states:

Graph states
 Stabilizer states

Stabilizer state by an operator A if :

A∣φ 〉=∣φ 〉
n-qubits stabilizer state:
Simultaneous by n independent operators of Pauli group of order n

∣ψ 〉 ∣S 〉
 Pauli group. Stabilizer state

PAULI MATRICES PAULI GROUP

1 0 0 i M=α M M 1 ⊗⋯⊗ M n
σ 0 =Ι=
 
0 1  
σ Y =Y =
−i 0
M i ∈{ σ 0 , σ x , σ y , σ z }
0 1 1 0
σ X= X =
 
1 0
σ Z =Z =
  0 −1
α M =±1,±i

N-QUBITS STABILIZER STATE

M j∣S 〉=∣S 〉
 j j
M j =α j M 1 ⊗⋯⊗ M n , α j =±1, j=1, , n .
 graph state

An n-qubits graph state is a special kind of stabilizer state.

∣ψ 〉 ∣S 〉 ∣G〉
 graph state

An n-qubits graph state is

a pure quantum state asociated to a simple connected graph G(V,E).

Each vertex represents a qubit and each edge a qubits entaglement

 graph state? Definition

G V ,E  ∣G〉 Only state satisfying:

V = { 1,. . ., n }
E⊂V ×V gi∣G 〉=∣G 〉 , i=1,...,n
 i  j
gi := X ⊗ i , j ∈E Z Generator operator

n
2
S=〈 g1 , .. . , g n 〉= {s j } j=1 stabilizer
 graph state

An n-qubits graph state is

a pure quantum state asociated to a simple connected graph G(V,E).

Each vertex represents a qubit and each edge a qubits entaglement

 graph state

An n-qubits graph state is

a pure quantum state asociated to a simple connected graph G(V,E).

Each vertex represents a qubit and each edge a qubits entaglement

Applications:
Quantum computation based on measures (cluster states)
Quantum correction of errors
Secret sharing protocols
Proof of Bell's Theorem (e.g.; all-versus-nothing)
Reduction of communication complexity
Teletransportation...

Theory of entaglement.
 graph states in REAL LIFE (lab)?

Now, we can:
n-qubits n-photons graph states up to n = 6.
6-qubits 4-photons graph states
8-qubits 4-photons graph states
10-qubits 5-photons graph states
graph states in REAL LIFE (lab)?

Futur:

30 qbits

10 teraflops

1000 clasical computers

 graph state? Constructive definition

G V ,E  ∣G〉

STEP 1
Asociate each vertex with a qubit in the state:

1
∣ 〉= ∣ 0 〉∣1 〉 
2
 What is a graph state? CONSTRUCTIVE .

G V ,E  ∣G〉

STEP 2
Apply, for each edge, controlled-Z to the qbits:

1 0 0 0


C Z =∣00 〉 〈 00∣∣01 〉 〈 01∣∣10 〉 〈 10∣−∣11 〉 〈 11∣=
0
0
0
1
1
1
0
1
0
0
0
−1
≡
 What is a graph state? CONSTRUCTIVE .

G V ,E  ∣G〉

∣〉1
1 2
∣〉2

∣〉3
∣G〉
3 4 ∣〉4
 Graph states equivalence

LU (local unitary) equivalence:

∣Φ 〉≡LU ∣Ψ 〉⇔∃U =U 1 ⊗⋯⊗ U n ∣Φ 〉=U∣Ψ 〉
Graph states “are entaglement-equivalent” iff are LU-
equivalent.

LC (local Clifford) equivalence:

∣Φ 〉≡LC∣Ψ 〉⇔∃C=C 1 ⊗⋯⊗ C n ,Ci ∈〈H,S〉∣Φ 〉=C∣Ψ 〉
1 1 1 1 0
conjecture LU LC:
∣Φ 〉≡LU ∣Ψ 〉⇔∣Φ 〉≡LC∣Ψ 〉
H=
   
 2 1 −1
,S=
0 i
 Graph states equivalence

Conjecture LU LC:
∣Φ 〉≡LU ∣Ψ 〉⇔∣Φ 〉≡LC∣Ψ 〉 FALSE
Z. Ji, J. Chen, Z. Wei y M. Ying; arXiv: 0709.1266
But…
True for some classes of graph states.
M. Van den Nest et al., Phys. Rev. A 71, 062323 (2005)
B. Zeng et al., Phys. Rev. A 75, 032325 (2007)

True for small n. Small known counterexamples: 27

qubits. Probably inferior limit.
Z. Ji, J. Chen, Z. Wei y M. Ying; arXiv: 0709.1266
LC equivalence and local complementation

Theorem (M. Van den Nest et al., Phys. Rev. A 69 022316 (2004)):

' There exists a sequence of local

∣G 〉 ≡LC ∣G 〉 complementation operator that maps
graph G into graph G’.

≡LC '
∣G 〉 ∣G 〉
'
G LC LC LC LC
G
LC equivalence and local complementation

Theorem (M. Van den Nest et al., Phys. Rev. A 69 022316 (2004)):

' There exists a sequence of local

∣G 〉 ≡LC ∣G 〉 complementation operator that maps graph G
into graph G’.

j λ  j
LC equivalence and local complementation. Orbit.

LC equivalence class. ORBIT:

ÓRBIT (LC class)

REPRESENTANTIVE?
LC equivalence and local complementation. Orbit.

LC equivalence class = orbit:

ORBIT

#Orbit: 802 non isomorph

graphs
 Entaglements in Graph states. Classification

# orbits for n vertices:

1 2 3 4 5 6 7 8 9 10 11 12
1 1 1 2 4 11 26 101 440 3,132 40,457 1,274,068
45 classes for graphs up to 7 vertices
101 classes for 8 vertices graphs.
Classification and propierties:
n<8:
M. Hein, J. Eisert y H. J. Briegel
Phys. Rev. A 69, 062311 (2004).
n=8:
A. Cabello, A. J. López-Tarrida, P. Moreno y J. R. Portillo
Phys. Lett. A 373, 2219 (2009).
n<=12:
A. Cabello, L.E. Danielsen, A. J. López-Tarrida, P. Moreno y J. R. Portillo
Submitted (2010).
Entaglements in Graph states. Classification

n<8:
Entaglements in Graph states. Classification.

n<8
:

CLASS ORDER CRITERIA

Minimum number of controlled-Z gates for its

preparation.

Schmidt measure for the 8-partite split.

Rank index (Schmidt ranks for all bipartite

splits).

LC INVARIANT
 Sort criteria n<9 (our previous work)

Minimum number of controlled-Z gates for preparation.

For each class, a representative with

minimum # edges AND minimum chromatic index

Both minimums ever are in the same representative (n<9)

EXPERIMENTAL corresponds to:
• Minimum # controlled-Z gates .
• Minimum preparation deepth (time units).
 Sort criteria n<9 (our previous work)

Schmidt measure of n-partite split.

1 N 
∣ψ 〉∈H ⊗⋯⊗ H
R ξ i ∈C , i=1, , R
 1 N
∣ψ 〉=∑ ξ i∣ψ i 〉 ⊗ ⋯⊗∣ψ i 〉  j  j
∣ψ i 〉∈H , j=1,, N
i=1

SCHMIDT MEASURE

E S ∣ψ 〉=log 2 r 
r is the minimum # R of term in the SUM,
in all the lineal decompositions in product states.
It shows the entaglement degree of a multipartite quantum system.
 Sort criteria

Rank index (Schmidt rank of all bipartite splits).

A  B
∣ψ 〉∈H ⊗ H
R ξ i ∈C , i=1, , R
 A B
∣ψ 〉=∑ ξ i∣ψ i 〉 ⊗∣ψ i 〉  j  j
∣ψ i 〉∈H , j= A , B
i=1

r =R mín=SR A G  SCHMIDT RANKS

p p p 1
RI p = ν p ,, ν 1  =[ ν ]
j j= p
RANK INDEX

p
ν j ≡#  SR A  G = j  , with ∣A∣= p .
Schmidt measure bounds

SRmáx G ≤E S ∣G 〉 ≤PPG ≤VC G 

MAXIMUM SCHMIDT RANK
PAULI PERSISTENCE

MINIMAL VERTEX COVER

 Graph states entaglement. Classifition

n<7:
ATTENTION:
PROBLEM!!!!

NO DISTINCTION
NO EQUIVALENT CLASS!

3≤E S ≤4 ; RI 3 = 28,7,0 ; RI 2 = 21,0

Graph states entaglements. Clasification

n=8:
Entrelazamiento en Graph states. Clasificación

ATTENTION:
PROBLEM!!!!

NO DISTINCTION
NO EQUIVALENT CLASS!

Solved (n<9) in
Phys. Rev. 80 012102 (2009).

4 invariants are enough!

(1040 in general)
 Sort criteria n<13

Minimum number of controlled-Z gates for preparation.

n Download Size
8 entanglement8 101 graphs
9 entanglement9 440 graphs
10 entanglement10 3132 graphs (509 KB)
11 entanglement11.bz2 40,457 graphs (1.2 MB compressed)
12 entanglement12.bz2 1,274,068 graphs (45 MB compressed)

For each class, a representative with

minimum # edges OR minimum chromatic index

Both minimums NOT ever are in the same representative (n>9)

EXPERIMENTAL corresponds to:
• Minimum # controlled-Z gates .
• Minimum preparation deepth (time units).
 Graph states entaglements. Clasification

n<13:
* No.: Number of the equivalence class.
* |LC|: Number of nonisomorphic graphs in the class.
* |V|: Number of vertices.
* (|E|, χ', #): |E| is the minimum number of edges in the class. χ' is the
minimum chromatic index of the graphs with |E| edges. # is the number of
nonisomorphic graphs with |E| edges and chromatic index χ'.
* (χ', |E|, #): χ' is the minimum chromatic index in the class. |E| is the
minimum number of edges of the graphs with chromatic index χ'. # is the
number of nonisomorphic graphs with chromatic index χ' and |E| edges.
* ES: Schmidt measure.
* RIi: (for n/2 ≥ i ≥ 2): Rank index for bipartite splits with i,n-i vertices.
* C-M: (for 0 ≤ i ≤ x) Cardinality-multiplicities. Value i is the multiplicity of
the cardinality i. Only the multiplicities of cardinalities 0 to x are listed,
* 2-col: Does the class contain a two-colorable graph?
* A representive graph from the class with minimum number of edges.
* A representive graph from the class with minimum chromatic index.
 Cooking graph states

∣G〉 G
We calculate invariants and identify LC class:

0 163 ,1 54 ,38 ,4 0 LC class #54

4 invariants for n<=8

A few invariants for 9<=n<=12

n #orbits #problems prob. p
9 440 2 0,0012218
10 3132 8 0,0006996
11 40457 78 0,0011929
12 1274068 472 0,0000949
 Cooking graph states

If we need prepare a GRAPH STATE

∣G〉 G

findOPTIMAL.c
We calculate invariants and identify LC class:

0 163 ,1 54 ,38 ,4 0 LC-class 54

We preparate the BEST representative and we do LC transformation*

'
∣G 〉 ∣G〉
LC LC LC LC

G
'
G
 Cooking graph states

If we need prepare a GRAPH STATE

 CONCLUSIONS

Extended up to 12 qubits graph states entaglement classification.

Best (in the sense of

minimum time preparation and/or
minimum work)
representative of each new 1300000+ LC equivalence class.

Help to new proofs (AVN type) of Bell's theorem.

Research of non-locality.

An (almost) complete sort criteria

and new invariants for labeling class.
 CONCLUSIONS

Procedure
Procedure for
forthe
theoptimal
optimalpreparation
preparation
11
of
of 1.65
1.65××10
1011graph
graphstates
stateswith
withup
upto
to12
12qubits
qubits

OPTIMAL:
OPTIMAL:
minimum
minimumnumber
numberof
ofentangling
entanglinggates
gates
minimum
minimumnumber
numberofoftime
timesteps
steps
••Main
Main goal:
goal: toto provide
provide inin aa single
single package
package all
all the
the
tools
toolsneeded
neededtotorapidly
rapidlyidentify
identifythe
theentanglement
entanglementclassclass
the
the target
target state
state belongs
belongs to,
to, and
and then
then easily
easily find
find the
the
corresponding
correspondingoptimal
optimalcircuit(s)
circuit(s)ofofentangling
entanglinggates,
gates,andand
finally
finallythe
theexplicit
explicitadditional
additionalone-qubit
one-qubitgates
gatesneeded
neededtoto
prepare
preparethe thetarget
target
 PUBLISHED

Arxiv:
Arxiv:http://arxiv.org/abs/1011.5464
http://arxiv.org/abs/1011.5464
Nov
Nov24,
24,2010
2010

This
Thiswork
work
has
hasbeen
beensubmitted
submittedto
toPhysical
PhysicalReview
ReviewAA
Nov
Nov25,
25,2010
2010

Slides:
Slides:http://slidesha.re/eEauJg
http://slidesha.re/eEauJg
Thanks for your attention!

¡Gracias por escucharme!