Quantum Computation and Quantum Information

Processing by NMR:
Introduction and Recent Developments.
Anil Kumar
Centre for Quantum Information and Quantum Computing (CQIQC)
Department of Physics and NMR Research Centre
Indian Institute of Science, Bangalore
IIT-Madras 7-Nov-2012
Introduction to QC/QIP
What is Special about Quantum Systems?
Classical
bit
0 1
Qubit
c
1
|0 ) + c
2
,1 )
Coherent Superposition
New Possibilities
EPR States:2
(-1/2)
(|00)+ |11)) NOT
resolvable into tensor product of
individual particles =(|0)
1
+ |1)
1
)
(|0)
2
+ |1)
2
)
Entanglement
Teleportation
Quantum
Computation
,0 )
,1 )
All present day computers (classical computers) use binary (0,1)
logic, and all computations follow this Yes/No answer.
Feynman (1982) suggested that it might be possible to simulate the
evolution of quantum systems efficiently, using a quantum simulator
Quantum Algorithms
1. PRIME FACTORIZATION
10
10
years (Age of the Universe)
Classically :
exp [2(ln c)
1/3
(ln ln c)
2/3
]
400 digit

Shors algorithm : (1994)
(ln c)
3

3 years
2. SEARCHING UNSORTED DATA-BASE
Classically : N/2 operations
Grovers Search Algorithm : (1997) N

operations
3. DISTINGUISH CONSTANT AND BALANCED FUNCTIONS:
Classically : ( 2
N-1
+ 1) steps
Deutsch-Jozsa(DJ) Algorithm : (1992) . 1 step
4. Quantum Algorithm for Linear System of Equation:
Harrow, Hassidim and Seth Lloyd; Phys. Rev. Letters, 103, 150502 (2009).
Exponential speed-up
5. Simulating a Molecule: Using Aspuru-Guzik Adiabatic
Algorithm

(i) J.Du, et. al, Phys. Rev. letters 104, 030502 (2010).

Used a 2-qubit NMR System (
13
CHCl
3
) to calculated the
ground state energy of Hydrogen Molecule up to 45 bit accuracy.


(ii) Lanyon et. al, Nature Chemistry 2, 106 (2010).

Used Photonic system to calculate the energies of the ground
and a few excited states up to 20 bit precision.
Recent Developments
Experimental Techniques for Quantum Computation:
1. Trapped Ions
4. Quantum Dots
3. Cavity Quantum
Electrodynamics (QED)

6. NMR
Ion Trap: Ion Trap:
Linear Paul-Trap
~
16 MHz
1kV
1kV
http://heart-c704.uibk.ac.at/linear_paul_trap.html
Laser
Cooled
Ions
T ~ mK
7. Josephson junction qubits
8. Fullerence based ESR quantum computer
5. Cold Atoms
2. Polarized Photons
Ion Trap: Ion Trap:
Linear Paul-Trap
~
16 MHz
1kV
1kV
http://heart-c704.uibk.ac.at/linear_paul_trap.html
Laser
Cooled
Ions
T ~ mK
Nobel Prize in Physics 2012
Trapped Ions
Cavity Quantum
Electrodynamics (QED)
Haroche has been one of the pioneers
in the field of cavity quantum
electrodynamics, He observed a
single atom interacting with a few
photons inside a reflective cavity and
can keep a photon bouncing back and
forth in a centimeter-sized cavity
billions of times before it escapes
Wineland performed quantum-probing
experiments with trapped ions. The tight
confinement of ions in these electric field
traps causes ion motion to be restricted to
distinct quantum states, each of which
represents a different frequency of
bouncing back-and-forth between the
electric field walls.
Michael Schirber
David Wineland Serge Haroche
0
1. Nuclear spins have small magnetic
moments (I) and behave as tiny
quantum magnets.
2. When placed in a large magnetic
field B
0
, they oriented either along
the field (|0) state) or opposite to the
field (|1) state) .
4. Spins are coupled to other spins by indirect spin-spin (J) coupling, and
controlled (C-NOT) operations can be performed using J-coupling.
Multi-qubit gates
Nuclear Magnetic Resonance (NMR)
3. A transverse radiofrequency field (B
1
) tuned at the Larmor frequency of
spins can cause transition from |0) to |1) (NOT Gate by a 180
0
pulse).
Or put them in coherent superposition (Hadamard Gate by a 90
0
pulse).
Single qubit gates.
SPINS ARE QUBITS
B
1
DSX
300
AMX
400
AV
500
AV
700
DRX
500
NMR Research Centre, IISc
1 PPB
Field/
Frequency
stability
= 1:10
9
Why NMR?
> A major requirement of a quantum computer is that the
coherence should last long.
> Nuclear spins in liquids retain coherence

~ 100s millisec
and their longitudinal state for several seconds.
> A system of N coupled spins (each spin 1/2) form an N
qubit Quantum Computer.
> Unitary Transform can be applied using R.F. Pulses and
J-evolution and various logical operations and quantum
algorithms can be implemented.
1. Preparation of
Pseudo-Pure States
2. Quantum Logic Gates
3. Deutsch-Jozsa Algorithm
4. Grovers Algorithm
5. Hoggs algorithm
6. Berstein-Vazirani parity algorithm
7. Quantum Games
8. Creation of EPR and GHZ states
9. Entanglement transfer
Achievements of NMR - QIP
\
\
\
10. Quantum State Tomography
11. Geometric Phase in QC
12. Adiabatic Algorithms
13. Bell-State discrimination
14. Error correction
15. Teleportation
16. Quantum Simulation
17. Quantum Cloning
18. Shors Algorithm
19. No-Hiding Theorem

\
\
\
\
\
\
\
\
\
\
Maximum number of qubits achieved in our lab: 8
\ Also performed in our Lab.
\
In other labs.: 12 qubits;
Negrevergne, Mahesh, Cory, Laflamme et al., Phys. Rev. Letters, 96, 170501 (2006).
NMR sample has ~ 10
18
spins.
Do we have 10
18
qubits?

No - because, all the spins cant be
individually addressed.
Spins having different Larmor frequencies can be
individually addressed in Frequency space as many qubits
Progress so far
One needs resolved couplings between the spins
in order to encode information as qubits.
NMR Hamiltonian
H = H
Zeeman
+ H
J-coupling

= e
i
I
zi
+ J
ij
I
i
-

I
j

i i < j
Weak coupling Approximation
|e
i
e
j
|>> J
ij
Two Spin System (AM)
A2 A1 M2 M1
e
A
e
M
M
1
= ,0
A
)
M
2
= ,1
A
)
A
1
= ,0
M
)
A
2
= ,1
M
)
,oo) = ,00)
,||) = ,11)
,o|) = ,01) ,|o) = ,10)
H = e
i
I
zi
+ J
ij
I
zi
I
zj
Under this approximation all spins
having same Larmor Frequency
can be treated as one Qubit
i i < j
Spin States are eigenstates
13
CHFBr
2
An example of a three qubit system.

A molecule having three different nuclear spins (each spin
) having different Larmor frequencies, coupled to each
other, forms a nice 3-qubit (F-C-H) system
13
C
Br (spin 3/2) is a quadrupolar nucleus, is decoupled from the
rest of the spin system and can be ignored in isotropic solution
1 Qubit
00
01 10
11
0
1
CHCl
3

000
001 010
011
100
101 110
111
2 Qubits
3 Qubits
Homo-nuclear spins having different Chemical shifts (Larmor
frequencies) and J-Coupled also form multi-qubit systems
Two methods of Addressing
Qubit selective pulses
And Coupling (J) Evolution
Transition-selective
Pulses and no evolution
I
1

I
2

y x
1/4J 1/4J
00
01
10
11
t
XOR/C-NOT
I
1

I
2

NOT1
00
01
10
11
t
t
I
1z
+I
2z

I
1z
+I
2x

I
1z
+2I
1z
I
2y
I
1z
+2I
1z
I
2z
y
(1/2J)
x
I
1

I
2

y x -y
y x -y
00
01
10
11
t
1
SWAP
I
1

I
2

y y -x -x
I
3

Toffoli
C
2
-NOT
000
001
010
011
100
101 110
111
I
1

I
2

y y -x x
I
3

OR/NOR
000
001
010
011
100
101 110
111
non-selective t pulse
+ a t on 000 001
t
2
t
3
t
t
Pseudo-Pure States
Pure States:
Tr( ) = Tr (
2
) = 1
For a diagonal density matrix, this condition requires
that all energy levels except one have zero populations.
Such a state is difficult to create in NMR
We create a state in which all levels except one have
EQUAL populations. Such a state mimics a pure state.
= 1/N ( 1 + )
Under High Temperature Approximation
Here = 10
5
and U 1 U
-1
= 1

Pseudo-Pure State
In a two-qubit Homo-nuclear system:
(Under High Field Approximation)

(i) Equilibrium:
= 10
5
+ = {2, 1, 1, 0}

~ I
z1
+I
z2
= { 1, 0, 0, -1}

(ii) Pseudo-Pure

= {4, 0, 0, 0}


0
, 11)
1
, 10)
2
, 00)
1
, 01)
0
, 11)
0
, 10)
4
, 00)
0
, 01)
~ I
z1
+I
z2
+ 2 I
z1
I
z2
= { 3/2, -1/2, -1/2, -1/2}



Spatial Averaging

Logical Labeling


Temporal Averaging


Pairs of Pure States (POPS)


Spatially Averaged Logical Labeling Technique (SALLT)
Cory, Price, Havel, PNAS, 94, 1634 (1997)
E. Knill et al., Phy. Rev. A57, 3348 (1998)
N. Gershenfeld et al, Science, 275, 350 (1997)
Kavita, Arvind, Anil Kumar, Phy. Rev. A 61, 042306 (2000)
B.M. Fung, Phys. Rev. A 63, 022304 (2001)
T. S. Mahesh and Anil Kumar, Phys. Rev. A 64, 012307 (2001)
Preparation of Pseudo-Pure States
Using long lived Singlet States
S.S. Roy and T.S. Mahesh, Phys. Rev. A 82, 052302 (2010).

1 Spatial Averaging: Cory, Price, Havel, PNAS, 94, 1634 (1997)



(t/3)
X
(2)
(t/4)
X
(1)

t
1/2J
2 4 5
6
1 3
G
x

(t/4)
Y
(1)

I
1z
+ I
2z
+ 2I
1z
I
2z
= 1/2

3 0 0 0
0 -1 0 0
0 0 -1 0
0 0 0 -1
Pseudo-pure
state
I
1z
= 1/2

1 0 0 0
0 1 0 0
0 0 -1 0
0 0 0 -1
I
2z
= 1/2

1 0 0 0
0 -1 0 0
0 0 1 0
0 0 0 -1
2I
1z
I
2z
= 1/2
1 0 0 0
0 -1 0 0
0 0 -1 0
0 0 0 1
Eq.= I
1z
+I
2z
I
1z
+ I
2z
+ 2I
1z
I
2z
2. Logical Labeling
N. Gershenfeld et al,
Science,
1997, 275, 350

Kavita, Arvind,
and Anil Kumar
Phys. Rev. A
61, 042306 (2000).
DRX-500
SIF
3. Temporal Averaging
1
, 11)
1
, 10)
2
, 00)
0
, 01)
0
, 11)
1
, 10)
2
, 00)
1
, 01)
1
, 11)
0
, 10)
2
, 00)
1
, 01)
2
, 11)
2
, 10)
6
, 00)
2
, 01)
+
+
=
Pseudo-pure
state
t
t
E. Knill et al., Phys. Rev. A 57, 3348 (1998)
Subsystem
Pseudo-pure
states of
2 qubits
T. S. Mahesh
and Anil Kumar,
Phys. Rev. A 64,
012307 (2001)
4. Pseudo Pure State by SALLT:
(Spatially Averaged Logical Labeling Technique)
This method does not scale with number of qubits
Logic Gates
By 1D NMR
Using Transition Selective
Pulses

Logic Gates
Using 1D NMR
NOT(I
1
)
C-NOT-2
XOR2
C-NOT-1
XOR1
Kavita Dorai, PhD Thesis, IISc, 2000.



Logical SWAP
Kavita, Arvind, and Anil Kumar
Phys. Rev. A 61, 042306 (2000).
|0 0)
|0 1)
|1 0)
|1 1)
|0 0)
|1 0)
|0 1)
|1 1)
INPUT OUTPUT
t
XOR+SWAP
0
, 11)
1
, 10)
2
, 00)
1
, 01)
t
2

t
1

t
3

t
|c
1
, c
2
) |c
2
, c
1
)
c
1

c
2

Kavita Dorai, PhD Thesis, IISc, 2000.
Toffoli Gate = C
2
-NOT
|c
1
, c
2
, c
3
)


|c
1
, c
2
,

c
3
(c
1


c
2
))
Input Output

000 000
001 001
010 010
011 111
100 100
101 101
110 110
111 011
AND
NAND
t
^
c
1

c
3

c
2

Eqlbm.
Toffoli
c
2

c
3

c
1

Logic Gates
By 1D NMR
Using J-Evolution Method
CNOT GATE
1
2
y
|
.
|

\
|
2
t
x
|
.
|

\
|
2
t
t
t
z
x
y
2
2
1
1 z z eq
I I +
2
2
1
1 2 x z
I I + =
| |
2 1
2
1
1 3
2
y z z
I I I + =
| |
2 1
2
1
1 4
2
z z z
I I I + =
IN OUT
|00> |00>
|01> |01>
|10> |11>
|11> |10>
( )
2 1
2
1
+
( )
2 1
2
1

( )
2 1
2
1

( )
2 1
2
1
+
( )
2 1
2
1
+
( )
2 1
2
1

( )
2 1
2
1

( )
2 1
2
1
+
eq

1
2
y
|
.
|

\
|
2
t
x
|
.
|

\
|
2
t
t
t
x
|
.
|

\
|
2
t
t
t
y
|
.
|

\
|
2
t
y
|
.
|

\
|
2
t
y
|
.
|

\
|
2
t
1 2 3 4 5
11
01
00
10
( )
2 1
2
1
+
( )
2 1
2
1
( )
2 1
2
1

( )
2 1
2
1
+
2
2
1
1 z z eq
I I +
1
SWAP GATE
2
2
2
1
1 1 x x
I I + =
| | | |
2 1
2
2 1
1 2
2 2
z y z y
I I I I + =
| | | |
2 1
2
2 1
1 3
2 2
y z y z
I I I I + =
| | | |
1
2
2
1 4 x x
I I + =
1
2
2
1 5 z z
I I + =
3
4
2 , 1
2
x
|
.
|

\
| t
J
2 , 1
2
x
|
.
|

\
| t
|00>
|01>
|10>
|11>
( )
2 1
2
1
+
( )
2 1
2
1

( )
2 1
2
1

( )
2 1
2
1
+
( )
2 1
2
1
+
( )
2 1
2
1

( )
2 1
2
1

( )
2 1
2
1
+
5
Logic Gates
By 2D NMR
T. S. Mahesh,
Kavita Dorai,
Arvind and
Anil Kumar,
J. Magn Res.,
148, 95 (2001)
A complete
set of 24
Reversible,
One-to-one,
2-qubit
Gates
Two-Dimensional Gates
T. S. Mahesh,et al,
J. Magn.Reson,148,
95, 2001
Three-qubit 2D-Gates:
000
001
010
011
100
101
110
111
0
0
0

0
0
1

0
1
0

0
1
1

1
0
0

1
0
1

1
1
0

1
1
1

NOT1
TOFFOLI
OR/NOR
I
N
P
U
T

e
1

OUTPUT
e
2

NOP
0
0
0

0
0
1

0
1
0

0
1
1

1
0
0

1
0
1

1
1
0

1
1
1

000
001
010
011
100
101
110
111
I
0

I
1

I
2

I
3

Quantum Algorithms

(a) DJ

(b) Grovers Search
DJ algorithm on ONE qubit with one work bit:
Constant Balanced
x
f
1
(x) f
2
(x) f
3
(x) f
4
(x)
0 0 1 0 1
1 0 1 1 0
U
f
|x ) |y ) |x ) |y f(x) )
|x ) is input qubit and |y ) is work qubit
O/P I/P
Constant Balanced
x y f
1
(x)
y

f
1
(x)
f
2
(x)
y

f
2
(x)
f
3
(x)
y

f
3
(x)
f
4
(x)
y

f
4
(x)
0 0 0 0 1 1 0 0 1 1
0 1 0 1 1 0 0 1 1 0
1 0 0 0 1 1 1 1 0 0
1 1 0 1 1 0 1 0 0 1
O
p
e
r
a
t
o
r

U
f
1 0 0 0
0 1 0 0
0 0 1 0
0 0 0 1
0 1 0 0
1 0 0 0
0 0 0 1
0 0 1 0
1 0 0 0
0 1 0 0
0 0 0 1
0 0 1 0
0 1 0 0
1 0 0 0
0 0 1 0
0 0 0 1

Cleve Version
U
f
1
NOT-2
C-NOT-1,2 C-NOT-2,1
Kavita, Arvind, Anil Kumar,
Phys. Rev. A 61, 042306 (2000)
Deutsch-Jozsa Algorithm
Experiment
One qubit DJ Two qubit DJ
Eq
Grovers Search Algorithm
Steps:
Pure State
Superposition
Avg
Inversion about
Average
Measure
Selective
Phase Inversion
|00..0)
Grover
iteration
\N times
Grover search algorithm using 2D NMR
Ranabir Das and Anil Kumar, J. Chem. Phys. 121, 7603(2004)
Other works


(i) Non-Adiabatic Geometric Phase in NMR QC

(ii) Adiabatic Quantum Algorithms by NMR

(iii) Quantum Games by NMR
Geometric Phase ?
When a vector is parallel transported on a curved surface, it acquires a
phase. A part of the acquired phase depends on the geometry of the path.
A state in a two-level quantum system is a vector which can be
transported on a Bloch sphere. The geometrical part of the acquired
phase depends on the solid angle subtended by the path at the centre of
the Bloch sphere and not on the details of the path.
Adiabatic Geometric Phase
M. V. Berry, Quantum phase factors accompanying adiabatic changes,
Proc. R. Soc. Lond. A, 392, 45 (1984)
When a quantum system, prepared in one of the eigenstates of
the Hamiltonian, is subjected to a change adiabatically, the
system remains in the eigenstate of the instantaneous
Hamiltonian and acquires a phase at the end of the cycle.
The phase has two parts. The dynamical and the geometric part.
) / exp( iEt
D
= |
(Dynamical Phase)
) exp( | i
g
=
(Geometric Phase)
g D
| | | + =
(Total Phase)
Pancharatnam, S.
Proc. I nd. Acad. Sci. A 44 , pp. 247-262 (1956).
Y. Aharonov and J. Anandan, Phase change during Cyclic Quantum Evolution,
Phys. Rev. Lett. 58(16), 1593 (1987)
Aharovov and Anandan later showed that adiabaticity is not a
necessary condition. When the density matrix corresponding to
a quantum system completes a cyclic path, in the density
operator space through different intermediate stages, the system
acquires the same geometric phase depending upon the
geometry of the path.
Non-Adiabatic Geometric Phase
Geometric Quantum Computing

Geometrical phase is robust, since it depends only on the
solid-angle enclosed by the path and is independent of
the details.

This fact can be used to perform fault-tolerant
Quantum Information Processing

Non-adiabatic Geometric phases in
NMR QIP using transition selective pulses
1. Geometric phases using slice & triangular circuits.
- Use of above in DJ & Grover algorithms.
Ranabir Das et al, J. Magn. Reson., 177, 318 (2005).

2. Experimental measurement of mixed state geometric phase by
quantum interferometry using NMR.
Ghosh et al, Physics Letters A 349, 27 (2005).

3. Geometric phases in strongly dipolar coupled spins.
- Fictitious spin- subspaces.
- Geometric phase gates in dipolar coupled
13
CH
3
CN.
- Collins version of 2-qubit DJ algorithm.
- Qubit-Qutrit parity algorithm.
Gopinath et al, Phys. Rev A 73, 022326 (2006).
Geometric phase acquired by a slice circuit
The state vector of the two level sub space cuts a slice on the Bloch
sphere.
The slice circuit can be achieved
by two transition selective pulses


The resulting path encloses a solid
angle O = 2| .

A spin echo sequence ttt is applied
to refocus the evolution under internal
Hamiltonian (the dynamic phase).

Second (t) pulse is applied to restore the
state of the first qubit altered by the (t) pulse.
(t)
x
(t)
-x

(t)
u

10 11
(t)
u+t+|

10 11
.
A.B =
z
Unitary operator associated with the slice circuit:
A.B =
( ) ( ) 0 1 0 0 1 0
. | i B A
e + +
Solid angle O = 2|.
13
C Spectra of
13
CHCl3
Ranabir Das et al, J. Magn. Reson., 177, 318 (2005).
Deutsch-Jozsa algorithm using geometric phases (by slice circuit):
U
f(00)
is identity matrix
U
f(11)
is achieved by applying
t pulse on the second qubit
=
Constant
Constant
Balanced
Balanced
Ranabir Das et al, J. Magn. Reson.,
177, 318 (2005).

1
H
13
C of
13
CHCl
3

Grover search algorithm using geometric phases (by slice circuit):
Using Geometric phase gates
H
H
H
H
H
C
ij
C
00

|0)
|0)
| i)
| j)
Superpo
sition
Pseudo
pure
state
Selective
Inversion
Inversion about
Average
Measure
H
Inversion about Average C
00
= H U
00
H

U
00
= C
00
(t)
Selective Inversion:
| = t
Ranabir Das et al, J. Magn. Reson., 177, 318 (2005).
00 = x
01 = x
10 = x
11 = x
Creation of |00 PPS
Experimental Measurement of Mixed State Geometric Phase by NMR

Preparation of Mixed state by the o
degree pulse and a gradient.
Implementation of Slice circuit to
introduce Geometric Phase.
Measurement
The shift of the interference pattern as a function of O and r.
|
|
.
|

\
|
|
.
|

\
|
O
=

2
tan tan
1
r
The shift directly gives the geometric phase acquired by the spin qubit.
Results:
Geometric Phase (Shift)
Ghosh et al, Physics Letters A 349, 27 (2005).
Adiabatic Quantum
Algorithms
Adiabatic Quantum Computing
Based on Adiabatic Theorem of Quantum Mechanics: A quantum system in
its ground state will remain in its ground state provided that the Hamiltonian
H under which it is evolved is varied slowly enough.
U
i
+
f
+
s

(
s
)

A
E

c s
s s
2
1 s 0
g
s 0
dt
s dH
s 1
min
;
) (
; max
The system evolves
from H
i
to H
f
with a
probability (1-c
2
)
provided the evolution
rate satisfies the
condition
Where c << 1
Farhi et al, PRA, 65,012322 (2002), Science, 292,
472 (2001), quant-ph/0001106; 0007071; 0208135
Adiabatic Algorithms
by NMR

(i) NMR Implementation of Locally Adiabatic
Algorithms

(a) Grovers search Algorithm
(b) D-J Algorithm

(ii) Adiabatic Satisfibility problem using Strongly
Modulated Pulses

Avik Mitra
Three variable 1-SAT problem
B = {x
1
,x
2
,x
3
} , set of three variable.

Each clause (C
i
) has one variable.

e.g. F
1
= x
1
x
2
x
3
. True for 111,
Zero otherwise
Adiabatic Version suggested by Farhi et al, quant-ph/0001106
Classically polynomial time
Hoggs Quantum Algorithm Single step.

NMR implementation by Peng et al., PRA, 65, 042373 (2002)
NMR Implementation, using a 3-qubit system.
The Sample.
C C
I
F
F
F
a
b
c
Hz 8 128 J
Hz 9 48 J
Hz 1 68 J
bc
ac
ab
.
.
.
=
=
=
Equilibrium Specrum.
Iodotrifluoroethylene(C
2
F
3
I)
Step 3. Implementation of Adiabatic Evolution
x
I = + + =
3
x
2
x
1
x B
I I I H
z
I = + + =
3
z
2
z
1
z F
I I I H
t t t 2
180
M
m
1 i
180
M
m
i
2
180
M
m
1 i
m
x z x
e e e U
|
.
|

\
|
|
.
|

\
|
|
.
|

\
|

~
I I I
( )
F B
H
M
m
H
M
m
1 m H +
|
.
|

\
|
=
pulse
3 , 2 , 1
x
m
2
(

o | | pulse
3 , 2 , 1
z m
|
pulse
3 , 2 , 1
x
m
2
(

o
m
th
step of the interpolating
Hamiltonian .
m
th
step of
evolution operator
using Trotters
formula

Pulse sequence for adiabatic evolution
Total number of iteration is 31
time needed = 62 ms
(400s x 5 pulses x 31 repetitions)



In a Homonuclear spin systems
spins are close
(~ kHz) in frequency
space
Pulses are of
longer duration
Decoherence
effects cannot be
ignored
Strongly Modulated Pulses circumvents the above problems
Strongly Modulated Pulses.
( ) ( )
( )
l l l
rf
l
eff
iH
l
1
z
l
l l SMP
e U U
t | e e
t o

A =
[
e
r
f

A t
|
| |
2
SMP T
N
U U Tr
F

=
Nedler-Mead
Simplex Algorithm
(fminsearch)
Using Concatenated SMPs
Avik Mitra et al, JCP, 128, 124110 (2008)

Duration: Max 5.8 ms, Min. 4.7 ms
Avik Mitra et al,
JCP, 128, 124110 (2008)

Results for all Boolean Formulae
Quantum Games
Von Neumann and Morgenstern
Theory of games and Economic behaviour
(Princeton University Press, 1947)
John F. Nash (Princeton University)
Nobel Prize in Economics (1994)
Robert Aumann (Hebrew University)
Nobel Prize in Economics (2005)
Game Theory
Evolutionary Games Nash Equilibrium
Quantum Games by NMR


Avik Mitra

(i) Ulams Quantum Game Guessing a number

(i) Three player Dilamma Game- Optimum strategy for
going to a Bar with two stools

(i) Battle of Sexes Game Should Bob and Alice together
watch TV or go to a football game
Classical Algorithm
UlamsGame
1010 001
Bob
Alice
Total number of queries = log
2
2
n
= n

Bob performs a unitary transform and stores the result in register B.
Alice makes a superposition of all the qubits.

Total number of queries = 1
Alice again interferes the qubits and then performs a measurement.

The quantum system consists of two registers.

Register A
consists of n qubits
Register B
consists of 1 qubit
--S. Mancini and L. Maccone, quant-ph/0508156
Quantum Version of UlamsGame
Protocol
Creation
of
PPS
Application
of
Hadamard
gate
Unitary
Transform
of
BOB
Application
of
Hadamard
gate
M
E
A
S
U
R
E
Preparation of Pseudo-pure state(PPS).
000
110
101
100
011
001 010
111
Experimental implementation
C C
I
F
F
F
a
b
c
Equilibrium Spectrum
001 PPS Spectrum
Results
000
110
101
100
011
001 010
111
population
coherence
Avik Thesis I.I.Sc. 2007


Recent Developments in our Laboratory
1. Experimental Test of Quantum of No-Hiding theorem.
Jharana Rani Samal, Arun K. Pati and Anil Kumar,
Phys. Rev. Letters, 106, 080401 (25 Feb., 2011)

2. Use of Nearest Neighbour Heisenberg XY interaction for
creation of entanglement on end qubits in a linear chain of 3-
qubit system.
K. Rama Koteswara Rao and Anil Kumar (IJQI, 10, 1250039 (2012).

Use of Genetic Algorithm for QIP.

V.S. Manu and Anil Kumar, Phys. Rev. A 86, 022324 (2012)
No-Hiding Theorem

S.L. Braunstein & A.K. Pati, Phys.Rev.Lett. 98, 080502 (2007).
Any physical process that bleaches out the original information
is called Hiding. If we start with a pure state, this bleaching
process will yield a mixed state and hence the bleaching
process is Non-Unitary. However, in an enlarged Hilbert
space, this process can be represented as a unitary.

The No-Hiding Theorem demonstrates that the initial pure
state, after the bleaching process, resides in the ancilla qubits
from which, under local unitary operations, is completely
transformed to one of the ancilla qubits.
Quantum Circuit for Test of No-Hiding Theorem using State
Randomization (operator U).
H represents Hadamard Gate and dot and circle represent
CNOT gates.
After randomization the state |> is transferred to the second
Ancilla qubit proving the No-Hiding Theorem.
(S.L. Braunstein, A.K. Pati, PRL 98, 080502 (2007).
|0>)
1

(

)
1
= Cos (/2) |0>)
1
+ e
[i( - /2)]
Sin (/2) |1>)
1

|00>
2,3

(/2)
2,3
|A
2,3
> = [|(0 + 1)>]
2
O [(0 + 1)>]
3
X
Creation of and Hadamard Gates after preparation of |000> PPS
The randomization operator is given by,

Are Pauli Matrices
With this randomization operator it can be shown that any
pure state is reduced to completely mixed state if the ancilla
qubits are traced out.

Using Eqs (1) and (2), the U is given by,

Eq. (1)
Eq. (2)
where
|000> |001> |010> |011> |100> |101> |110> 111>
|000> 1
|001> 1
|010> 1
|011> 1
|100> 1
|101> 1
|110> -1
|111> -1
U =
The Randomization Operator is obtained as
Blanks = 0
Local unitary for transforming information to one of the ancilla qubits
This shows that the first two qubits
are in Bell State and the > has
been transferred to the 3
rd
qubit.
Conversion of the U-matrix into an NMR Pulse sequence has
been achieved here by a Novel Algorithmic Technique,
developed in our laboratory by Ajoy et. al (PRA 85, 030303
(2012)). This method uses Graphs of a complete set of Basis
operators and develops an algorithmic technique for efficient
decomposition of a given Unitary into Basis Operators and their
equivalent Pulse sequences.
The equivalent pulse sequence for the U-Matrix is obtained as
NMR Pulse sequence for the Proof of No-Hiding Theorem
The initial State is
prepared for different
values of and
Jharana et al
Three qubit
Energy Level
Diagram
Equilibrium
Spectra of
three qubits
Spectra
corresponding
to |000> PPS
Experimental Result for the No-Hiding Theorem.
The state is completely transferred from first qubit to the third qubit
325 experiments have been performed by varying and in steps of 15
o
All Experiments were carried out by Jharana (Dedicated to her memory)
Input State
Output State
s
s
S = Integral of real part of the signal for each spin
Tomography of first two qubits showing
that they are in Bell-States.
Jharana Rani Samal, Arun K. Pati and Anil Kumar,
Phys. Rev. Letters, 106, 080401 (25 Feb., 2011)


Bell States are Maximally Entangled 2-qubit states.

Bell states play an important role in teleportation protocols

Use of nearest neighbour
Heisenberg-XY interaction.
Solution
Use Nearest Neighbour Interactions
Until recently we had been looking for qubit systems, in which
all qubits are coupled to each other with unequal couplings, so
that all transitions are resolved and we have a complete access
to the full Hilbert space.
However it is clear that such systems are not scalable,
since remote spins will not be coupled.
Creation of Bell states between end qubits and a W-state
using nearest neighbour Heisenberg-XY interactions
in a 3-spin NMR quantum computer
Rama K. Koteswara Rao et al, IJQI, 10 (4) 1250039 (2012)
Heisenberg XY interaction is normally not present in
liquid state NMR: We have only ZZ interaction available.
We create the XY interaction by transforming the ZZ
interaction into XY interaction by the use of 90
0
RF pulses.
Heisenberg-interaction

=
+ + +

=
+
+ + = =
1
1
1 1 1
1
1
1
) ( ) (
N
i
z
i
z
i
y
i
y
i
x
i
x
i i
N
i
i i i
J J H o o o o o o o o

=
+ +
+ =
1
1
1 1 2
1
) (
N
i
y
i
y
i
x
i
x
i i XY
J H o o o o

<
=
j i
j i
ij J H ) ( o o
Where are Pauli spin matrices
Linear Chain: Nearest Neighbour Interaction
( )

=
+
+

+
+
+ =
1
1
1 1
N
i
i i i i i
J o o o o
Nearest neighbour Heisenberg XY Interaction
Jingfu Zhang et al., Physical Review A, 72, 012331(2005)
( )
3 2 3 2 2 1 2 1
2
1
y y x x y y x x XY
J H o o o o o o o o + + + =
t iH
XY
e t U

= ) (
( )
3 2 2 1
2
) (
y y x x
i
Jt
A
e t U
o o o o +
=
( )
3 2 2 1
2
) (
x x y y
i
Jt
B
e t U
o o o o +
=
( ) ( )
3 2 2 1
2
3 2 2 1
2
) ( ) ( ) (
x x y y
i
y y x x
i
Jt Jt
B A
e e t U t U t U
o o o o o o o o + +
= =
| | 0 ,
3 2 2 1 3 2 2 1
= + +
x x y y y y x x
o o o o o o o o

j
x/y
are the Pauli spin matrices and J is the coupling constant between two spins.
2 1 3
J J
Divide the H
XY
into two commuting parts
Consider a linear Chain of 3 spins with equal couplings
Jingfu Zhang et al., Physical Review A, 72, 012331(2005)
) ( ) sin( ) cos(
3 2 2 1
2 2 2
y y x x
Jt i Jt
I o o o o + =
( )
2 2
3 2 2 1
y y x x
Jt
i
e
o o o o +

=
( )
3 2 2 1
2
) (
y y x x
i
Jt
A
e t U
o o o o +
=
) ( ) sin( ) cos(
3 2 2 1
2 2 2
x x y y
Jt i Jt
I o o o o + =
( )
2 2
3 2 2 1
x x y y
Jt
i
e
o o o o +

=
( )
3 2 2 1
2
) (
x x y y
i
Jt
B
e t U
o o o o +
=
( )( ) ) ( sin cos ) ( sin cos
3 2 2 1
2
3 2 2 1
2
x x y y
i
y y x x
i
I I o o o o o o o o + + =
) ( ) ( ) ( t U t U t U
B A
=
{ } 2 / Jt =
I
y y x x
=
|
|
.
|

\
| +
2
3 2 2 1
2
o o o o
(
(

=
=

A i I e
then I A that such matrix a is A
iA
) sin( ) cos(
,
2
u u
u
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(

=
1 0 0 0 0 0 0 0
0 cos ) 2 sin( 0 sin 0 0 0
0 ) 2 sin( ) 2 cos( 0 ) 2 sin( 0 0 0
0 0 0 cos 0 ) 2 sin( sin 0
0 sin ) 2 sin( 0 cos 0 0 0
0 0 0 ) 2 sin( 0 ) 2 cos( ) 2 sin( 0
0 0 0 sin 0 ) 2 sin( cos 0
0 0 0 0 0 0 0 1
) (
2
2
2
2 2
2
2
2
2
2
2
2 2
2
2
2






i
i i
i
i
i i
i
t U
= Jt/2
The operator U in Matrix form for the 3-spin system
where
Jingfu Zhang et al., Physical Review A, 72, 012331(2005)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
.
|

\
|

= |
.
|

\
|
1 0 0 0 0 0 0 0
0 0 0 0 1 0 0 0
0 0 1 0 0 0 0 0
0 0 0 0 0 0 1 0
0 1 0 0 0 0 0 0
0 0 0 0 0 1 0 0
0 0 0 1 0 0 0 0
0 0 0 0 0 0 0 1
2J
U
t
100 001 = U
110 011 = U
001 100 = U
011 110 = U
000 000 = U
010 010 = U
101 101 = U
111 111 = U
/2 , 2 / When t t = = J t
Quantum State Transfer
Interchanging the states of 1
st
and 3
rd
qubit
[Ignore the phase (minus sign)]
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
.
|

\
|

= |
.
|

\
|
1 0 0 0 0 0 0 0
0
2
1
2
0
2
1
0 0 0
0
2
0 0
2
0 0 0
0 0 0
2
1
0
2 2
1
0
0
2
1
2
0
2
1
0 0 0
0 0 0
2
0 0
2
0
0 0 0
2
1
0
2 2
1
0
0 0 0 0 0 0 0 1
2 2
i
i i
i
i
i i
i
J
U
t
( )
2 13 2
1 10 01 101 + =
i
U
( )
2 13 2
0 01 10 010 + =
i
U
,
2 2

J
t When
t
= 4 / t =
Two qubit Entangling Operator
Bell States
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(
(

=
1 0 0 0 0 0 0 0
0 79 . 0
3
0 21 . 0 0 0 0
0
3 3
1
0
3
0 0 0
0 0 0 79 . 0 0
3
21 . 0 0
0 21 . 0
3
0 79 . 0 0 0 0
0 0 0
3
0
3
1
3
0
0 0 0 21 . 0 0
3
79 . 0 0
0 0 0 0 0 0 0 1
) (
i
i i
i
i
i i
i
t U
,
2
) 2 ( tan

1
J
t When

=
2
) 2 ( tan
1
=
110 011 101 101 ) (
3 3 3
1 i i
t U =
110 011 101
3
1
3
1
3
1
+ +
Phase Gate on 2
nd
spin
1 1 0 0 i +
Three qubit Entangling Operator
W - State
Experiments using nearest neighbour interactions
in a 3-spin system
1. Pseudo-Pure States.

2. Bell states on end qubits.

3. W-state.
13
CHFBr2
J
HC
= 224.5 Hz, J
CF
= -310.9 Hz and J
HF
= 49.7 Hz.
Energy Level Diagram
Equilibrium spectra
1
H
13
C
19
F
[45]
x
[45]
-y

[45]
x

[45]
x

[45]
-y

[45]
-y

[90]
-y

[90]
-y

[90]
x

[90]
x

[90]
y

[90]
y

[57.9]
1
H
13
C
19
F
G
z

1/2J
HC
1/J
CF

1/2J
CF
1/2J
HC

3 2 1 3 1 3 2 2 1 3 2 1
000
4 2 2 2
z z z z z z z z z z z z
I I I I I I I I I I I I + + + + + + =
C
z C
F
z F
H
z H eq
I I I + + = ) 25 . 0 94 . 0 (
C
z
F
z
H
z H
I I I + + =
Pseudo-Pure States using only nearest neighbour interactions
Rama K. Koteswara Rao et al, IJQI, 10 (4) 1250039 (2012)
000
001
010
011
1
H
13
C
19
F
Pseudo-Pure States:
Rama K. Koteswara Rao et al, IJQI, 10 (4) 1250039 (2012)
,
2 2

J
t When
t
= 4 / 2 2 t = = Jt
Bell state on end qubits:
Starting from 010 pps the U yields Bell
states in which the Middle qubit in state 0

Starting from 101 pps the U yields Bell
states in which the Middle qubit in state 1
( )
2 13 2
1 10 01 101 + =
i
U
( )
2 13 2
0 01 10 010 + =
i
U
[90]
-y

[90]
y

[90]
x

[90]
-x
[90]
y

[90]
x
[90]
y
[90]
-y
[90]
x

[90]
y
[90]
y
[90]
-x

[90]
-x

[90]
y

1/2J
HC
1/4J
CF
1/2J
HC
1/2J
HC
1/2J
HC
1/4J
CF
1/2J
HC

1
H
13
C
19
F
[90]
x

[90]
y

[90]
-y

[90]
-x
[90]
y

[90]
x
[90]
-y
[90]
y
[90]
x

[90]
y
[90]
y
[90]
-x

[90]
y

[90]
-x

1/2J
HC
1/4J
CF
1/2J
HC
1/2J
CF
1/2J
HC
1/4J
CF
1/2J
HC

1
H
13
C
19
F
Pulse sequence for implementing the unitary operator U(t)
Bell state on end qubits:
Experiment
Simulated
Real Part
Imaginary Part
Bell state on end qubits:
( )
2 13 2
0 01 10 010 + =
i
U
Experiment Simulated
Real Part
Imaginary Part
Bell state on end qubits:
( )
2 13 2
1 10 01 101 + =
i
U
,
2
) 2 ( tan

1
J
t When

=
2
) 2 ( tan
1
=
110 011 101 101 ) (
3 3 3
1 i i
t U =
110 011 101
3
1
3
1
3
1
+ +
2 2 2 2
2 2 2 2
y x y z
(

t t t t
W-State
Experiment Simulated
Real Part
Imaginary Part
110 011 101
3
1
3
1
3
1
+ +
W-State:
Rama K. Koteswara Rao et al, IJQI, 10 (4) 1250039 (2012)
The Genetic Algorithm
Directed search algorithms based on the
mechanics of biological evolution
Developed by John Holland, University of
Michigan (1970s)
John Holland
Charles Darwin 1866
1809-1882

Genetic Algorithms are good at taking large,
potentially huge, search spaces and navigating them,
looking for optimal combinations of things, solutions
you might not otherwise find in a lifetime
Genetic Algorithm
Here we apply Genetic Algorithm to Quantum Information Processing
We have used GA for

Quantum Logic Gates ( Operator optimization)
and
Quantum State preparation (state-to-state optimization)
V.S. Manu et al. Phys. Rev. A 86, 022324 (2012)
Representation Scheme

Representation scheme is the method used for encoding the
solution of the problem to individual genetic evolution. Designing a
good genetic representation is a hard problem in evolutionary
computation. Defining proper representation scheme is the first
step in GA Optimization.

In our representation scheme we have selected the gene as a
combination of

(i) an array of pulses, which are applied to each channel with
amplitude () and phase (),

(ii) An arbitrary delay (d).

It can be shown that the repeated application of above gene forms
the most general pulse sequence in NMR
The Individual, which represents a valid solution can be
represented as a matrix of size (n+1)x2m. Here m is the
number of genes in each individual and n is the number
of channels (or spins/qubits).







So the problem is to find an optimized matrix, in which the
optimality condition is imposed by a Fitness Function
Fitness function
In operator optimization

GA tries to reach a preferred target Unitary Operator (U
tar
) from an
initial random guess pulse sequence operator (U
pul
).

Maximizing the Fitness function

F
pul
= Trace (U
pul
U
tar
)
In State-to-State optimization


F
pul
= Trace { U
pul
(
in
) U
pul

(-1)

tar

}
Two-qubit Homonuclear case
H = 2 (I
1z
1
2z
) + 2 J
12
(I
1z
I
2z
)

Single qubit rotation
= 500 Hz, J= 3.56 Hz

1
=2,
2
=,
=/2, =/2

1
=,
2
=0
=/2, =/2
/2 /2
Simulated using J = 0
Hamiltonian used

Non-Selective (Hard) Pulses
applied in the centre
Fidelity for finite J/
Controlled- NOT:
Equilibrium
00
01 10
11
1
-1
0 0
00
01 10
11
1
-1
0
0
00
01 10
11
1
-1 0
0
00
01 10
11
1
-1
0
0
00
01 10
11
1
-1
0
0
Pseudo Pure State (PPS) creation
All unfilled rectangles represent 90
0
pulse
The filled rectangle is 180
0
pulse.
Phases are given on the top of each pulse.
Fidelity w.r.t. to J/
00
01 10
11

0
0
0
0
Bell state creation: From Equilibrium (No need of PPS)
Bell states are maximally entangled two qubit states.
The Singlet Bell State
Experimental Fidelity > 99.5 %
Shortest Pulse Sequence for creation
of Bell States directly from Equilibrium
All blank pulses are 90
0
pulses. Filled pulse is a 180
0
pulse.
Phases and delays Optimized for best fidelity.
T
1
=8.7 s
T
s
=11.2 s
V.S. Manu et al. Phys. Rev. A 86, 022324 (2012)
Future Directions:
(i) Use Collective Modes of linear chains.

(ii) Backbone of a C-13, N-15 labeled protein forming a linear
chain:

(iii) Use of Genetic Algorithm for designing pulse
sequences for NMR QI P.

Other IISc Collaborators
Prof. Apoorva Patel
Prof. K.V. Ramanathan
Prof. N. Suryaprakash
Prof. Malcolm H. Levitt - UK



Prof. P.Panigrahi IISER Kolkata
Dr. Arun K. Pati HRI-Allahabad
Mr. Ashok Ajoy BITS-Goa-MIT
Dr. Arvind
Dr. Kavita Dorai
Dr. T.S. Mahesh
Dr. Neeraj Sinha
Dr. K.V.R.M.Murali
Dr. Ranabir Das
Dr. Rangeet Bhattacharyya
- IISER Mohali
- IISER Mohali
- IISER Pune
- CBMR Lucknow
- IBM, Bangalore
- NCIF/NIH USA
- IISER Kolkata

Dr.Arindam Ghosh - NISER Bhubaneswar
Dr. Avik Mitra - Varian Pune
Dr. T. Gopinath - Univ. Minnesota
Dr. Pranaw Rungta - IISER Mohali
Dr. Tathagat Tulsi IIT Bombay

Acknowledgements
Other Collaborators
Funding: DST/DAE/DBT
Former QC- IISc-Associates/Students
This lecture is dedicated
to the memory of
Ms. Jharana Rani Samal*
(*Deceased, Nov., 12, 2009)

Current QC IISc - Students

Mr. Rama K. Koteswara Rao
Mr. V.S. Manu
Thanks: NMR Research Centre IISc, for spectrometer time
Photograph of a chip constructed by D-Wave Systems Inc., designed to operate as a 128-
qubit superconducting adiabatic quantum optimization processor, mounted in a sample holder.
2011
Thank You
Book
Quantum Computation and Quantum Information Processing
by
Michael A. Nielsen and Isaac L. Chuang,
Cambridge University Press (2000)

Indian Edition available for Rs. 317/-
Review Article on
Quantum Computing by NMR
By
Jonathan A Jones
University of Oxford, UK

arXiv:1011.1382v1 [quant-ph] 5 Nov 2010
2D NMR Quantum Computing Scheme
Preparation Evolution Mixing Detection

y

-y y
t
1
t
2
I
1
, I
2
etc.
G
z
Creation of
Initial States
Labeling
of the
initial
states
Computation
Reading
output
states
Computation
I
0
Ernst & co-workers, J. Chem. Phys., 109, 10603 (1998).
Transitions of I
0
are
labeled by the
states of I
1
and I
2

00 01 10 11
I
0

I
1
I
2

H H

Br C C COOH

H Br
I
1
I
0

I
2

I
0

Three-spin system:
2 qubits
3 qubits
4 qubits
5 qubits
Marx et al,
Phys. Rev. A
62, 012310 (2000)
Knill et al, Nature,
404, 368 (2000)
Typical systems used for NMR-QIP using J-Couplings
7 qubits
7 qubits
Chuang et al,
quant-ph/0007017
6
7
How to increase the
number of qubits?

Use Molecules Partially Oriented (~ 10
-3
)
in Liquid Crystal Matrices

(i) Quadrupolar Nuclei (spin >1/2). Reduced
Quadrupolar Couplings
(ii) Spin =1/2 Nuclei. Reduced Intramolecular
Dipolar Couplings
Quadrupolar
Systems
Neeraj Sinha,T. S. Mahesh, K. V. Ramanathan, and
Anil Kumar, J . Chem. Phys., 114, 4415 (2001).
Using spin-3/2 (
7
Li) oriented
system as 2-qubit system
Pseudo-pure states
2-qubit Gates
using
7
Li
oriented system
Neeraj Sinha,
T. S. Mahesh,
K. V. Ramanathan,
and Anil Kumar,
JCP, 114, 4415 (2001).
133
Cs system spin 7/2 system
Optimal Labeling
[Cs pentadeca-fluoro-
octonate + D
2
O]
Half-Adder
t(5,6,5,7,6)
5-pulses

Subtractor
t(3,2,3,5,4,3,2,5,7)
9-pulses
7
6
5
4
3
2
1
111
110
101
100
011
010
001
000
-7/2
-5/2
-3/2
-1/2
1/2
3/2
5/2
7/2
7
6
5
4
3
2
1
000
010
011
001
101
110
111
100
-7/2
-5/2
-3/2
-1/2
1/2
3/2
5/2
7/2
Half-Adder
t(1,3,2)
3-pulses

Subtractor
t(6,4,2)
3-pulses
Half-Adder Subtractor Equilibrium
Conventional Labeling
Murali et.al.
Phys. Rev. A66.
022313 (2002)

R. Das et al, Phys. Rev.
A 70, 012314 (2004)
Collins version of 3-qubit DJ implemented on the 7/2 spin of Cs-133.
There are 2 constant
and 70 Balanced
functions. Half differ
in phase of the
Unitary transform.

12 are shown here.

1-Constant and 11-
Balanced
C
B B
B
B B
B
B
B
B B B
Gopinath and Anil Kumar, J.
Magn. Reson., 193, 163 (2008)
Dipolar
Systems
Advantages of Oriented Molecules
Large Dipolar coupling - ease of selectivity - smaller Gate time
Long-range coupling - more qubits
Disadvantage
For Homo-nuclear spin system




Spins become Strongly coupled
A spin can not be identified as a qubit


2
N
energy levels are collectively treated as an N-qubit system
Solution
Weak coupling Approximation
|e
i
e
j
|>> D
ij
3-Qubit Strongly Dipolar Coupled Spin System
Z-COSY (90-t
1
-10-
m
-10-t
2
) was
used to label the various transitions
GHZ state (|000)+ |111))
C
2
-NOT gate
POPS
(|000) (000| -
|001) (001| )
populations
coherences
(|110) |111))
T.S. Mahesh et.al., Current Science 85, 932 (2003).
Bromo-di-chloro-benzene
5-qubit system
(in liquid crystal)
Eqlbm
HET-Z-COSY spectrum for labeling
E-level diagram
Proton transitions
Fluorine transitions
Starting from 4-qubit PPS
prepared by SAALT:
Entanglement transfer
|0)
|0)
|0)
|0)
H

T
r
a
n
s
f
e
r

|0000)+ |0110) |0000)+ |1001)
Entanglement between 2nd and 3rd qubit
Entanglement between 1st and 4th qubit
e
2
+

e
2
7

e
2
+

e
4
0

(t)
27
(t)
40
(t)
27

Ranabir Das , Rangeet Bhattacharya and Anil Kumar, J. Magn. Reson.. 170, 310 (2004).
Equilibrium spectrum 1
H spectrum
19
F spectrum
F

Molecule: 1-floro naphthalene
(in liquid crystal ZLI1132)
8-qubit system
(1-512)
(513-630)
H

H

H

H

H

H

H

HET-Z-COSY spectrum
R. Das, R
Bhattacharyya
and Anil
Kumar,
Quantum
Computing
Back Action,
AIP Proc.,
864, 313 (2006)
Proton transitions
in B domain
C
7
-NOT [t
1
]
POPS(1) [Eq- t
1
]
POPS(40) [Eq- t
40
]
POPS(1)+C
6
SWAPPOPS(40)
R. Das, R Bhattacharyya and Anil Kumar, Quantum Computing Back
Action, AIP Proceedings 864, 313 (2006)