Presentation is loading. Please wait.

Presentation is loading. Please wait.

Quantum Information Stephen M. Barnett University of Strathclyde The Wolfson Foundation.

Similar presentations

Presentation on theme: "Quantum Information Stephen M. Barnett University of Strathclyde The Wolfson Foundation."— Presentation transcript:


2 Quantum Information Stephen M. Barnett University of Strathclyde The Wolfson Foundation

3 0 Motivation 1 Digital electronics 2 Quantum gates 3 Principles of quantum computation 4 Quantum algorthims 5 Errors and decoherence 6 Realizations? 1.Probability and Information 2. Elements of Quantum Theory 3. Quantum Cryptography 4. Generalized Measurements 5.Entanglement 6.Quantum Information Processing 7. Quantum Computation 8. Quantum Information Theory

4 CMOS Device Performance Device performance doubles roughly every 5 years!

5 P - solvable problems (computing time is polynomial in input size) Classical Deterministic Algorithm Classical Probabilistic Algorithm Quantum Computing Factoring Discrete logarithm Quantum simulations...

6 Quantum algorithms: scaling of computing time with N~2 n 1. F.T. to determine periodicities f(x+r) mod N = f(x) mod N find r Classical: O(N) = O(2 n ) Quantum: O(log 2 N) = O(n 2 ) 2. Shors factoring algorithm N = pq find p and q given N Naïve classical (trial): O(N 1/2 ) = O(2 n/2 ) Best known classical: O(2^[n 1/3 log 2/3 n]) Shors algorithm: O(polynomial[logN]) = O(polynomial n) Exponential speed up! What happens to RSA? What happens to money??

7 …101101001… …000111010… Input Output Black Box or Computer What is a computation? Generation of an output number (string of bits) based on an input number. How does the computer achieve this?

8 6.1 Digital electronics Physical bit - electrical voltage+5V = 1 0V = 0 Single bit operation NOT gate 0101 1010

9 Two bit operations AND gate 00110011 01010101 00010001 OR gate 00110011 01010101 01110111

10 Two bit operations NAND gate 00110011 01010101 11101110 Not all the gates are needed A small set of gates (e.g. NAND, NOT) is universal in that any logical operation can be made from them.

11 6.2 Quantum gates Single qubit operations H Hadamard S Phase T / 8 and many more

12 Two qubit operations - CNOT gate control bit target bit CNOT gate can make entangled states

13 We can break up any multi-qubit unitray transformation into a sequence of two- state transformations:

14 It follows that we can realise any multi-qubit transformation as a sequence of single-qubit and two-qubit unitary transformations. This is the analogue of the universality of NAND and NOT gates in digital electronics.

15 The CNOT gate, together with one qubit gates are universal control bit 1 target bit control bit 2 Exercise: Construct the Toffoli gate using just CNOT gates and single qubit gates. Try to use as few gates as possible.


17 6.3 Principles of quantum computation Encode input onto qubit string Quantum evolution = unitary transformation Measurement gives output = computed function (hopefully!) A quantum computation is a (generalised) measurement

18 Quantum computation? Constraints of unitarity? Consider the two bit map State overlap Problem. Our computation requires

19 Unitary evaluation of the function f a = input string …101101001... b = input string, usually set to zero …000000000... Exercise: Show that the states transformation is an allowed unitary transformation.

20 We can show this by an explicit construction:

21 Parallel quantum computation Can input a superposition of many possible bit strings a. Output is an entangled stated with values of f (a) computed for each a.

22 Deutschs algorithm A black box that computes one of four possible one-bit functions: We wish to know if the function is constant or balanced. We can do this by performing two computations To give f (0) and f (1). Can we do it in one step? A f (A) Black Box Constant functions: Balanced functions:

23 A quantum computer allows solution in a single run: + for constant for balanced are orthogonal states and so can be identified without error.

24 Exponential speed up Suppose our box computes a one bit function of n bits and that this function is either constant or balanced. Constant: 0 or 1 independent of input Balanced: 0 or 1 for exactly half of the possible inputs Orthogonal states for constant or balanced functions so solution in ONE computation. Guaranteed classical solution in computations Quantum? Exponential speed up.

25 6.4 Quantum algorithms 1. F.T. to determine periodicities f(x+r) mod N = f(x) mod N find r Classical: O(N) = O(2 n ) Quantum: O(log 2 N) = O(n 2 ) 2. Shors factoring algorithm N = pq find p and q given N Naïve classical (trial): O(N 1/2 ) = O(2 n/2 ) Best known classical: O(2^[n 1/3 log 2/3 n]) Shors algorithm: O(polynomial[logN]) = O(polynomial n) 3. Grovers search algorithm - searching a database Classical: O(N) Quantum: O(N 1/2 )

26 Factorisation algorithm N: Given big integer to be factorised m: Small integer chosen at random n = 0,1,2, … 1. Make the series F N (n) = m n mod N 2. Find the period r : F N (n+r) = F N (n) 3. The greatest common divisor of N and m r/2 ±1 divides N Example: N = 15, m = 2 => F N (0) = 1 F N (1) = 2 F N (2) = 4 F N (3) = 8 F N (4) = 1 F N (5) = 2 … => r = 4 => m r/2 – 1 = 3 m r/2 + 1 = 5 Both OK Example: N = 15, m = 11 => F N (0) = 1 F N (1) = 11 F N (2) = 1 F N (3) = 11 … => r = 2 => m r/2 – 1 = 10 => GCD 5 m r/2 + 1 = 12 => GCD 3 Both OK

27 Shors algorithm to factorise N 1. Find integers q and M such that: q = 2 M > N 2 and prepare two registers each containing M qubits. 2. Set the qubits in the first register in the state (|0 + |1 )/2 1/2 and those in the second in the state |0.

28 3. Choose an integer m at random and entangle the two registers so that This can be achieved by a unitary transformation (on a suitably programmed quantum computer) within polynomial time. 4. Fourier transform for register 1: 5. Measurement on register 1: => k = multiple of q/r is obtained with high probability => r = q/k

29 6.5 Errors and decoherence Interaction with the environment introduces noise and causes errors Phase error Bit flip error

30 Deutschs algorithm Phase error In this case Bit flip error In this case

31 Scaling Probability that a given qubit has no error in time t Probability that none of n qubits has an error in time t Let t be the time taken to perform a gate operation. For an efficient algorithm we might need n 2 operations. The number of required gate operations tends to grow at least logarithmically in the n requires about 300 qubits. This gives Decoherence is a real problem. We need efficient error correction!

32 Quantum error-correction An error can make any change to a state so it is not obvious that error-correction is possible. The key idea, of course, is redundancy! This is a simultaneous eigenstate of with eigenvalue +1 in both cases.

33 If a single spin-flip error occurs

34 We can, in fact correct any single-qubit error using the 7-qubit Steane code: All the states differ in least four qubits – they are also common eigenstates of 6 operators with eigenvalue +1. Any single-qubit error is detectable from a unique pattern of changes to these. OK, Im convinced. Where can I buy one?

35 Ion-trap implementation - Cirac & Zoller, Wineland et al, Blatt et al. Single ion qubits coupled by their centre of mass motion

36 Centre of mass motion acts as a bus We can entangle the ionic qubits using the centre of mass motion.

37 Blatt et al Innsbruck

38 ( Vandersypen, Steffen, Breyta, Yannoni, Cleve, Chuang, July 2000 Physical Rev. Lett. ) Nuclear spins 5-spin molecule synthesized Pathway to 7-9 qubits First demonstration of a fast 5-qubit algorithm

39 Quantum-dot array proposal

40 Well defined extendible qubit array - stable memory Preparable in the 000… state Long decoherence time (>10 4 operation time) Universal set of gate operations Single-quantum measurements D. P. DiVincenzo, in Mesoscopic Electron Transport, eds. Sohn, Kowenhoven, Schoen (Kluwer 1997), p. 657, cond-mat/9612126; The Physical Implementation of Quantum Computation, quant-ph/0002077. DiVincenzos criteria for implementing a quantum computer

41 Summary Quantum information is radically different to its classical counterpart. This is because the superposition principle allows for many possible states. Our inability to measure every property we might like leads to information security, but generalised measurements allow more possibilities than the more familiar von Neumann measurements. Entanglement is the quintessential quantum property. It allows us to teleport quantum information AND it underlies the speed-up of quantum algorithms. Quantum information technology will radically change all information processing and much else besides!

Download ppt "Quantum Information Stephen M. Barnett University of Strathclyde The Wolfson Foundation."

Similar presentations

Ads by Google