prime factorization algorithm found by Peter Shor 1994

Slides:



Advertisements
Similar presentations
Chapter 19 Fast Fourier Transform (FFT) (Theory and Implementation)
Advertisements

Slide 1 Insert your own content. Slide 2 Insert your own content.
0 - 0.
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
Year 6 mental test 10 second questions Numbers and number system Numbers and the number system, fractions, decimals, proportion & probability.
Modular Arithmetic Several important cryptosystems make use of modular arithmetic. This is when the answer to a calculation is always in the range 0 –
£1 Million £500,000 £250,000 £125,000 £64,000 £32,000 £16,000 £8,000 £4,000 £2,000 £1,000 £500 £300 £200 £100 Welcome.
Vorlesung Quantum Computing SS 08 1 A scalable system with well characterized qubits Long relevant decoherence times, much longer than the gate operation.
Vorlesung Quantum Computing SS 08 1 Quantum Computing.
Vorlesung Quantum Computing SS 08 1 quantum parallelism a 1 F |00> + a 2 F |01> + a 3 F |10> + a 4 F |11> a 1 |00> + a 2 |01> + a 3 |10> + a 4 |11> input.
University of Strathclyde
Q U RE: T HE Q UANTUM R ESOURCE E STIMATOR T OOLBOX Martin Suchara (IBM Research) October 9, 2013 In collaboration with: Arvin Faruque, Ching-Yi Lai, Gerardo.
©2004 Brooks/Cole FIGURES FOR CHAPTER 16 SEQUENTIAL CIRCUIT DESIGN Click the mouse to move to the next page. Use the ESC key to exit this chapter. This.
Truth Tables and Logic Gates. What are Logic Gates? Logic gates are components used in making logic circuits. Each gate has one or more inputs and produces.
Digital Logical Structures
The Toffoli gate & Error Correction
Chapter 3 Digital Logic Structures
Introduction to Quantum Computers Goren Gordon The Gordon Residence July 2006.
topics Logic gates Gates types Universal gates
Quantum Computing and Qbit Cryptography
The Fast Fourier Transform (and DCT too…)
Ismétlés. General model of quantum algorithms InitializationParallelization Amplitude ampl. Measu- rement Classical input Classical output Quantum output.
Lab 13 : Binary Counter Systems:
Created by Susan Neal $100 Fractions Addition Fractions Subtraction Fractions Multiplication Fractions Division General $200 $300 $400 $500 $100 $200.
The brief history of quantum computation G.J. Milburn Centre for Laser Science Department of Physics, The University of Queensland.
$1 Million $500,000 $250,000 $125,000 $64,000 $32,000 $16,000 $8,000 $4,000 $2,000 $1,000 $500 $300 $200 $100 Welcome.
Test B, 100 Subtraction Facts
QuIDE was used during the Quantum Computation classes at DCS AGH The students assessed the usability with the System Usability Scale QuIDE was compared.
Fourier Transform Fourier transform decomposes a signal into its frequency components Used in telecommunications, data compression, digital signal processing,
( ( ) quantum bits conventional bit
Efficient Discrete-Time Simulations of Continuous- Time Quantum Query Algorithms QIP 2009 January 14, 2009 Santa Fe, NM Rolando D. Somma Joint work with.
Umesh V. Vazirani U. C. Berkeley Quantum Algorithms: a survey.
The Hidden Subgroup Problem. Problem of great importance in Quantum Computation Most Q.A. that run exponentially faster than their classical counterparts.
March 11, 2015CS21 Lecture 271 CS21 Decidability and Tractability Lecture 27 March 11, 2015.
Quantum Speedups DoRon Motter August 14, Introduction Two main approaches are known which produce fast Quantum Algorithms The first, and main approach.
Department of Computer Science & Engineering University of Washington
Quantum Algorithms Towards quantum codebreaking Artur Ekert.
1 Quantum Computing: What’s It Good For? Scott Aaronson Computer Science Department, UC Berkeley January 10,  John.
Shor Algorithm Anuj Dawar. Finding the eigenvalue is the same as finding its phase 
Quantum Computing Joseph Stelmach.
Anuj Dawar.
Experimental Realization of Shor’s Factoring Algorithm ‡ ‡ Vandersypen L.M.K, et al, Nature, v.414, pp. 883 – 887 (2001) M. Steffen 1,2, L.M.K. Vandersypen.
Shor’s Algorithm Osama Awwad Department of Computer Science Western Michigan University July 12, 2015.
Experimental Realization of Shor’s Quantum Factoring Algorithm ‡ ‡ Vandersypen L.M.K, et al, Nature, v.414, pp. 883 – 887 (2001) M. Steffen 1,2,3, L.M.K.
Tallinn University of Technology Quantum computer impact on public key cryptography Roman Stepanenko.
1 Introduction to Quantum Information Processing QIC 710 / CS 678 / PH 767 / CO 681 / AM 871 Richard Cleve DC 2117 / QNC 3129 Lectures.
October 1 & 3, Introduction to Quantum Computing Lecture 2 of 2 Richard Cleve David R. Cheriton School of Computer Science Institute for Quantum.
Lecture note 8: Quantum Algorithms
Algorithms Artur Ekert. Our golden sequence H H Circuit complexity n QUBITS B A A B B B B A # of gates (n) = size of the circuit (n) # of parallel units.
Quantum Computing MAS 725 Hartmut Klauck NTU
Short course on quantum computing Andris Ambainis University of Latvia.
Shor’s Algorithm -basic introduction –. The main goal for Shor’s Alg. Find the factors of a certain integer – Why?... Long story short: prime factors,
1 hardware of quantum computer 1. quantum registers 2. quantum gates.
Shor’s Factoring Algorithm
1/22 Quantum Algorithms Deutsch-Josza Algorithm: quantum computers are more powerful than classical ones. b f(b) b f(b) b f(b) 0 1 b f(b) 0.
Multipartite Entanglement and its Role in Quantum Algorithms Special Seminar: Ph.D. Lecture by Yishai Shimoni.
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 2117 Lecture.
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 3524 Course.
1 An Introduction to Quantum Computing Sabeen Faridi Ph 70 October 23, 2007.
Beginner’s Guide to Quantum Computing Graduate Seminar Presentation Oct. 5, 2007.
Shor's Factorization Algorithm Keith Kelley, CS 6800.
Quantum Bits (qubit) 1 qubit probabilistically represents 2 states
Four approaches to Shor
Qubit Recycling in Quantum Computation
OSU Quantum Information Seminar
Quantum Computation and Information Chap 1 Intro and Overview: p 28-58
 = N  N matrix multiplication N = 3 matrix N = 3 matrix N = 3 matrix
Quantum Computing Joseph Stelmach.
Presentation transcript:

prime factorization algorithm found by Peter Shor 1994 generalized to an algorithm for order finding key step is the quantum Fourier transform (QFT)

discrete Fourier transform (DFT) Lieven Vandersypen, PhD thesis: http://arxiv.org/abs/quant-ph/0205193 DFT unitary transform that converts a string of N complex numbers xj to a string of N complex numbers yj yk = xj ei2pjk/N 1 √N ∑ j=0 N-1 inverts periodicity (input string period r, output string N/r) 1 0 0 0 1 0 0 0 1 0 1 0 1 0 1 0 converts off-sets into phase factors 0 1 0 0 0 1 0 0 1 0 -i 0 -1 0 i 0

quantum Fourier transform Lieven Vandersypen, PhD thesis: http://arxiv.org/abs/quant-ph/0205193 number of qubits n = log2 N (for N=8, three qubits) amplitude of |000 represents first complex number, |001 the 2nd states |000, |001, ... , |111 are labelled |0, |1 , ... , |7 |j → ei2pjk/N |k 1 √N ∑ k=0 N-1 0 1 0 0 0 1 0 0 1 0 -i 0 -1 0 i 0 (|1 + |5)√2 (|0 - i|2 - |4 + i|6)/2

quantum Fourier transform |j → ei2pjk/N |k 1 √N ∑ k=0 N-1 (short: j = j1j2j3) j = j122 + j221 + j320 0.j1j2j3 = j1/2 + j2/4 + j3/8 reverse order of output qubits: j1in = j3out, j3in = j1out e |j1 j2 j3 → 1 2n/2 |0 + 2pi 0. |1 j3 j1 j2j1 j2j3 j3j2j1 j1j2j3 1 -1 √2 j3in 1 -1 √2 j2in 1 eip/2 j2in j3in =1 H R23 90° H

QFT quantum circuit |j3 |j2 |j1 |j1 |j2 |j3 H R R H R H e H = p Weinstein et al.: quant-ph/99060059v1 (1999) |j3 |j2 |j1 |j1 |j2 |j3 H R 90° R 45° H R 90° H -i f 2 e i H = i ħ Ix p e Iy 2 i ħ - Iz f e R1 = = i ħ - Iyj,k p 2 e Iyj,k Ixj,k f i ħ - Iy p 2 e Iy Ix f = Rjk= i ħ J t Izj Izk e Iq j p

QFT implementation Weinstein et al.: Phys. Rev. Lett. 86,1889 (2001) 13C labeled spins of Alanine as qubits (T1>1.5s, T2>400ms) Preparation of pseudo-pure state |000 Preparation of input state |000+|010+ |100+|110 Apply QFT => |000+|001 and SWAP => |000+|100 |111 000| |000 000| |111 111| |000 111|

Order finding M rooms with one entrance and one exit Lieven Vandersypen, PhD thesis: http://arxiv.org/abs/quant-ph/0205193 M rooms with one entrance and one exit Connected by subcycles How often to change room until back at start? p1(5)=4, p2(5)=2, … 6 y={2,4,5} 7 r=3 y={0,1,3,7} 4 r=4 y=6 r=1 5 2 3 1

Order finding: quantum circuit Lieven Vandersypen, PhD thesis: http://arxiv.org/abs/quant-ph/0205193 |x= |x2x1x0, x=4x2+2x1+x0 M=4, |y1y0= |y, y  M-1 |x|y → |x|px(y) = |x|p4x (y)|p2x (y)|px (y) 2 1 y=3 p1(3)=1, p2(3)=3, … |0 H QFT p4(y) p2(y) p (y) |y1 |y0 |1 |y2=(|0+|2+|4+|6)|1+(|1+|3+|5+|7)|3 |y1=(|0+|1+|2+|3+|4+|5+|6+|7)|11 |y3=(|0+|4)|1+(|0-|4)|3 |y0=|000|11 measurement yields multiple of 2n/r => r=2

Order finding for n qubits Lieven Vandersypen, PhD thesis: http://arxiv.org/abs/quant-ph/0205193 register 1 register 2 number of transitions between “rooms” number of starting room 1) |0|0 2) Hn → √2n 1 S |j|0 j=0 2 -1 n 3) f(j)=pj(0) → √2n 1 S |j|f(j) j=0 2 -1 n 4) QFT r1 → ei2pjk/N |k|f(j) → ei2pjk/N |k|f(j) √2n 1 S j=0 2 -1 n k=0 5) Measure the amplitude of |k → S ei2pjk/N j=0 2 -1 n 2 (large for k=c*N/r)

Shor’s algorithm number to factorize: N (e.g. N=15) L. Vandersypen et al.: Nature 414, 883 (2001) number to factorize: N (e.g. N=15) one factor is gcd(ar/21,N) (probability >0.5) “easy” integer a does NOT divide N (a=2,4,7,8,11,13,14) “easy?” f(x,y)=px(y)=axy mod N a2 mod 15 = 1, a  {4,11,14} f(x) needs x0 only a4 mod 15 = 1, a  {2,7,8,13} => a mod 15 =1, k ≥ 2 2k f(x) needs x0 and x1 register 1 needs 2 qubits (take 3) n=2m register 2 needs 4 qubits m=(log2N)

Implementation of Shor’s algorithm 1 2 3 4 5 6 7 C

Measurement thermal spectra a=11 effective pure state calculated measured simulated x0=0 x1=0 x2=|0+|1 x=|000+|100 =|0+|4 =>r=2n/4=2 gcd(112/21,15)=3,5

Pulse sequence total ~300 pulses 90°pulse 180°refocusing pulses y -x x 90°pulse 180°refocusing pulses x -x z rotation