Professional Documents
Culture Documents
a quantum computer
ACCOTA
Playa del Carmen, Mexico. November 2010
08/12/21 03:41 AM
How to cook
a quantum graph state
ACCOTA
Playa del Carmen, Mexico. November 2010
08/12/21 03:41 AM
Optimal preparation
of quantum graph states
ACCOTA
Playa del Carmen, Mexico. November 2010
03:41 AM
Some previous ideas
Entaglement measures
Representative graph state
Quantum computers are made with graph states, but are unstable
Bit
Schumacher, 1995
E.g.,
½ spin particle.
Photon polarization.
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
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
Theory / Applications
Classification of states by entaglement
Equivalent entaglement:
Subsets of states:
Graph states
Stabilizer states
A∣φ 〉=∣φ 〉
n-qubits stabilizer state:
Simultaneous by n independent operators of Pauli group of order n
∣ψ 〉 ∣S 〉
Pauli group. Stabilizer state
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
M j∣S 〉=∣S 〉
j j
M j =α j M 1 ⊗⋯⊗ M n , α j =±1, j=1, , n .
graph state
∣ψ 〉 ∣S 〉 ∣G〉
graph state
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
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
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
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)
Theorem (M. Van den Nest et al., Phys. Rev. A 69 022316 (2004)):
≡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)):
j λ j
LC equivalence and local complementation. Orbit.
REPRESENTANTIVE?
LC equivalence and local complementation. Orbit.
ORBIT
n<8:
Entaglements in Graph states. Classification.
n<8
:
LC INVARIANT
Sort criteria n<9 (our previous work)
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
A B
∣ψ 〉∈H ⊗ H
R ξ i ∈C , i=1, , R
A B
∣ψ 〉=∑ ξ i∣ψ i 〉 ⊗∣ψ i 〉 j j
∣ψ i 〉∈H , j= A , B
i=1
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
n<7:
ATTENTION:
PROBLEM!!!!
NO DISTINCTION
NO EQUIVALENT CLASS!
n=8:
Entrelazamiento en Graph states. Clasificación
ATTENTION:
PROBLEM!!!!
NO DISTINCTION
NO EQUIVALENT CLASS!
Solved (n<9) in
Phys. Rev. 80 012102 (2009).
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:
∣G〉 G
findOPTIMAL.c
We calculate invariants and identify LC class:
'
∣G 〉 ∣G〉
LC LC LC LC
G
'
G
Cooking graph states
Research of non-locality.
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!