QUANTUM COMPUTING. Part II. Jean V. Bellissard. Georgia Institute of Technology & Institut Universitaire de France

Transcription

1 QUANTUM COMPUTING Part II Jean V. Bellissard Georgia Institute of Technology & Institut Universitaire de France

2

3 QUANTUM GATES: a reminder

4 Quantum gates: 1-qubit gates x> U U x> U is unitary in M 2 ( C ) I = X = Y = 0 -i i 0 Z = Pauli basis in M 2 ( C )

5 Quantum gates: 1-qubit gates x> U U x> U is unitary in M 2 ( C ) 1 1 H =2-1/2 1-1 S = i T = e ip/4 Hadamard, phase and p/8 gates

6 Quantum gates: controlled gates x> x> y> U U x y> U is unitary in M 2 ( C )

7 Quantum gates: the CNOT gate x> x> y> x y>

8 Quantum gates: the swap gate x> x y> = y> x x>

9 FOURIER TRANSFORM: quantum computers are fast!

10 Fourier Transform: Digital basis given by qubits x 1 x 2 x n > = x 1 > x 2 > x n > = y> If y = 2 (n-1) x (n-2) x x n := x 1 x 2 x n

11 Fourier Transform : Fourier transform: F j> = 1 k=0 e 2ip jk/n k> N 1/2 N=2 n,

12 Fourier Transform : Binary decomposition: jk/2 n = (0.j n )k 1 + (0.j n-1 j n )k (0.j 1 j 2 j n )k n (modulo 1) where 0.j 1 j 2 j r = j 1 /2 + j 2 /2 2 + j r /2 r

13 Fourier Transform : Binary decomposition: F j> = 1 k=0 e 2ip jk/ k> 2 n/2 F j> = ( 0> + e 2ip(0.j n ) 1>)... ( 0> + e 2ip(0.j 1 j n ) 1>) 2 n/2

14 Fourier Transform : Digital phase gate (1 qubit): 1 0 R k = 0 e 2ip 2ip x R k x> = e 2 k x> 2 k

15 j n > Fourier Transform : H ( 0> + e 2ip(0.j n ) 1>) j n-1 > H R 2 ( 0>+e 2ip(0.j n-1 j n ) 1>) j 2 > H R n-2 R n-1 ( 0>+e 2ip(0.j 2... j n) 1>) j 1 > H R 2 R n ( 0>+e 2ip(0.j 1... j n ) 1>) Circuit producing the quantum Fourier transform

16 Fourier Transform : ( 0> + e 2ip(0.j n ) 1>) x ( 0>+e 2ip(0.j 1... j n ) 1>) ( 0>+e 2ip(0.j n-1 j n ) 1>) x ( 0>+e 2ip(0.j 2... j n) 1>) ( 0>+e 2ip(0.j 2... j n) 1>) x ( 0>+e 2ip(0.j n-1 j n ) 1>) ( 0>+e 2ip(0.j 1... j n ) 1>) x ( 0> + e 2ip(0.j n ) 1>) Swap gates arrange final qubits in right order

17 Fourier Transform : Fourier transform F j f(j) j> = k f(k) k> ~ f(k) = 2 -n/2 j f(j) e 2ipjk/ the Fourier transform of f is given by the coordinates of the outcome. ~ It can then be measured 2 n

18 Fourier Transform : The usual FFT requires a time O(N LnN) The number of gates needed is n 2 /2 + 2n Since the N=2 n, the algorithm gives the result in a time (1 time unit/gate) O((LnN) 2 )!!

19 PHASE ESTIMATION a key subroutine

20 Phase estimation U is a unitary with an eigenvalue Goal: compute f. U u> = e if u> Set-up: two registers, one with t- qubits, the other one for representing U.

21 Phase estimation a controlled U n -gate G U n gives G U n x> u> = e inxf x> u> It transfers the phase of u> on the component 1> of the first register. On the first register one uses a rotated state H 0> = ( 0>+ 1>)/ 2 instead of x>.

22 Phase estimation 0> H 0> + e i2 (t-1) f 1> 0> 0> 0> H H H 0> + e i2 2 f 1> 0> + e i2 1 f 1> 0> + e i2 0 f 1> u> U 20 U 21 U 22 U 2(t-1) u>

23 Phase estimation If f= 2p.j 1 j 2 j t, the outcome is ( 0> + e 2ip(0.j t ) 1>)... ( 0> + e 2ip(0.j 1 j t ) 1>) 2 n/2 Then use a Fourier transform back to get j> = j 1 j 2 j t >, giving the value of the phase modulo O(2p/2 t ).

24 Phase estimation To get n digit of f accurate, with probability of success (1-e), it can be shown that t must be chosen as t=n+log(2+1/2e)

25 SHOR S ALGORITHM: factorizing integer into primes

26 Shor s algorithm Input: a composite integer N Output: a non trivial factor of N Runtime: O((log N) 3 ) operations, succeeds with probability O(1).

27 Shor s algorithm First step: order finding. If x<n are integers with no common factors, the order of x modulo N is the least 0<r such that x r 1(mod N). Use the unitary U y> = xy(mod N)>. If y Π{0,1} L, N<2 L, and N y<2 L, set U y> = y>.

28 Shor s algorithm Then u s > = r -1/2 Â k=0 r exp(-2ipsk/r) x r (mod N)> is an eigenvector of U with phase f=2p s/r A phase-finding computes s/r. A continuous fraction expansion gives r.

29 Shor s algorithm It may not be possible to prepare the initial state of the second register in the state u s >. But any initial state is a linear combination of the u s > s. The outcome will be s/r for some s. A continuous fraction expansion will give r anyway.

30 Shor s algorithm Factoring procedure (i) If N is even, return the factor m=2 (ii) Find if N=a b, for a>1, b 2, integers (special subroutine) (iii) Choose randomly xœ[1,n-1]. If m=gcd(x,n) >1, then return m.

31 Shor s algorithm Factoring procedure (continued): (iv) Find the order r of x mod N. (v) If r is even & x r/ (mod N), compute gcd(x r/2-1,n) & gcd(x r/2 =1,N), check if one is a nontrivial factor m. If so return m.

32 ERROR-CORRECTIONS: can quantum information be protected?

33 Error-correction codes Classical code theory uses redundancy to transmit bits of information 0 1 coding Transmission errors (2nd Law) Reconstruction at reception (correction)

34 Error-correction codes Quantum computer are submitted to the no-cloning theorem! there is no Hilbert space H neither any unitary operator U on H H for which there is a state s> such that U y> s> = y> y> " yœ H

35 Error-correction codes However it is possible to produce quantum circuits for which 0>Æ 000> and 1>Æ 111> for instance: a 0>+b 1> 0> a 000>+b 111> 0>

36 Error-correction codes The previous circuit protects against index flips. How can one protects the signal against phase flips? Hadamard gates transform index into a phase: H x> = ( 0>+(-1) x 1>)/ 2

37 Error-correction codes Phase flip protection a 0>+b 1> 0> 0> H H H y (a+b(-1) y i) y 1 y 2 y 3 > 2-3/2 a 000>+b 111>

38 Error-correction codes a 0>+b 1> H Shor s code 0> H 0> H

39 Error-correction codes Shor s code gives 0>Æ 0 L > and 1>Æ 1 L > with: ( 000>+(-) x 111>)( 000>+(-) x 111>)( 000>+(-) x 111>) x L >= 2 2

40 Error-correction codes Kitaev proposed in 1997 to replace digital degrees of freedom by topological ones. Tunneling effect between topological sectors is unlikely, leading to a better code protection.

41 PHYSICAL REALIZATIONS can quantum computers be built?

42 Realizations Several devices may produce qubits: 1. Any quantum harmonic oscillator 2. Optical photons 3. Optical cavity quantum electrodynamics: coupling with 2- level atoms. 4. Ion traps 5. Nuclear magnetic resonance: computation with up to 7- qubits have permitted to test Shor s algorithm 15=3x5!! 6. Josephson junctions: quantronium 7. Double well with quantum dots

43 Realizations: 1-qubit, the quantronium The quantronium (Esteve & Devoret Saclay): a Josephson tunneling junction

44 Realizations 1-qubit, the quantronium Quantronium :

45 Realizations Quantronium : RABI OSCILLATIONS Coherent manipulation of the Quantronium state: a microwave resonant pulse with duration t and amplitude URF is applied to the gate. The Quantronium undergoes Rabi oscillations. The probability of measuring the Quantronium in its excited state, i.e. the switching probability of the measuring junction, oscillates accordingly as a function of t and URF. Each dot is an average over measurements. The decoherence time is about 5µs.

46 Realizations 1-qubit, quantum dots Double quantum dots : group of Kouwenhoven, (U. Delft Holland) resonant tunneling µ L 5 4 b a µ R - e V - e f 1 (N 1 +1,N 2 ) - e f 2 (N 1, N 2 +1)

47 Realizations 7-qubit, NMR Nuclear Magnetic Resonance : IBM 15=3x5!! (Shor s algorithm)

48 CONCLUSIONS will quantum computers be built?

49 To conclude (from Part I) 1. The elementary unit of quantum information is the qubit, with states represented by the Bloch ball. 2. Several qubits are given by tensor products leading to entanglement. 3. Quantum gates are given by unitary operators and lead to quantum circuits 4. Law of physics must be considered for a quantum computer to work: measurement, dissipation

50 To conclude (Part II) 1. Several algorithms are available: Fourier transform, phase estimation, quantum search, hidden subgroup, order-finding 2. Shor s algorithm for factoring shows enormous efficient and threaten present cryptography 3. Error-correcting codes are now available 4. Few qubits computer have been realized with NRM experiments

51 To conclude (other topics) 1. A theory of quantum information and code theory is also available even though incomplete 2. Quantum cryprography exists (Gisin, Geneva) 3. Need for developments in quantum complexity theory: are notions of P- NP- completeness obsolete? 4. Main problem: putting qubits together in concrete machines. Can one control entanglement and /or decoherence on a large scale? Not clear!!

52