Shor Algorithm Anuj Dawar. Finding the eigenvalue is the same as finding its phase 

Slides:



Advertisements
Similar presentations
Ismétlés. General model of quantum algorithms InitializationParallelization Amplitude ampl. Measu- rement Classical input Classical output Quantum output.
Advertisements

Chi-Square Test Chi-square is a statistical test commonly used to compare observed data with data we would expect to obtain according to a specific hypothesis.
Registers and Ranges. Register – Compared to a Calculator If there are only 9 digits available on display how long can the number displayed be? ANS: 9.
Warm Up After 153 games played, the Oakland A’s have won 17 games more than they've lost. How many games have the A’s won? #3 #2 #1 Find the smallest positive.
Quantum Phase Estimation using Multivalued Logic.
Quantum Phase Estimation using Multivalued Logic Vamsi Parasa Marek Perkowski Department of Electrical and Computer Engineering, Portland State University.
FFT1 The Fast Fourier Transform. FFT2 Outline and Reading Polynomial Multiplication Problem Primitive Roots of Unity (§10.4.1) The Discrete Fourier Transform.
Department of Computer Science & Engineering University of Washington
Phase in Quantum Computing. Main concepts of computing illustrated with simple examples.
Quantum Algorithms Towards quantum codebreaking Artur Ekert.
Shor Algorithm (continued) Anuj Dawar Use of number theory and reductions.
1 Quantum Computing: What’s It Good For? Scott Aaronson Computer Science Department, UC Berkeley January 10,  John.
Grover. Part 2 Anuj Dawar. Components of Grover Loop The Oracle -- O The Hadamard Transforms -- H The Zero State Phase Shift -- Z.
Quantum Computing Joseph Stelmach.
Anuj Dawar.
Shor’s Algorithm Osama Awwad Department of Computer Science Western Michigan University July 12, 2015.
Tallinn University of Technology Quantum computer impact on public key cryptography Roman Stepanenko.
They are the same as registers since they store binary numbers. Called shifting registers since they shift (left or right) the binary number stored in.
Working with Fractions
CIRCUMFERENCE OF A CIRCLE LEARNING TARGET 4: I CAN SOLVE PROBLEMS USING AREA AND CIRCUMFERENCE OF A CIRCLE.
1.3B MULTIPLYING AND DIVIDING INTEGERS I can multiply and divide integers to solve problems involving integers.
Solving Equations Medina1 With Decimal & Fractions.
A little bit of exercise.. ;). Exercise Given to you are some binary to decimal examples : Given to you are some binary to decimal examples : Tens Units.
October 1 & 3, Introduction to Quantum Computing Lecture 2 of 2 Richard Cleve David R. Cheriton School of Computer Science Institute for Quantum.
Cove: A Practical Quantum Computer Programming Framework Matt Purkeypile Doctorate of Computer Science Dissertation Defense June 26, 2009.
FFT1 The Fast Fourier Transform. FFT2 Outline and Reading Polynomial Multiplication Problem Primitive Roots of Unity (§10.4.1) The Discrete Fourier Transform.
Lecture note 8: Quantum Algorithms
Percent This slide needs the title “Percent”, your name, and two pictures that represent percent. Choose a nice background and apply it to all of your.
Short course on quantum computing Andris Ambainis University of Latvia.
Quantum Factoring Michele Mosca The Fifth Canadian Summer School on Quantum Information August 3, 2005.
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,
SOLVING EQUATIONSThe single most important skill in algebraGoal: Find the one value of the variable that makes the sentence true.
Fourier series: Eigenfunction Approach
Cove: A Practical Quantum Computer Programming Framework Matt Purkeypile (DCS3) Winter 2009.
Program Design. The design process How do you go about writing a program? –It’s like many other things in life Understand the problem to be solved Develop.
Shor’s Factoring Algorithm
Multiplying Fractions. When we multiply a fraction by an integer we: multiply by the numerator and divide by the denominator For example, × = 54.
Quantum Computing Michael Larson. The Quantum Computer Quantum computers, like all computers, are machines that perform calculations upon data. Quantum.
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.
Cluster #1 PowerPoint Review. Simplify and express as an exponent.
Trigonometric Identities
Multiplication and Division of Powers
MA/CSSE 473 Day 06 Euclid's Algorithm.
Rational Exponents Section 6.1
Solving Rational Equations and Radical Equations
Trigonometric Identities
Four approaches to Shor
Radicals and Rational Exponents
Comparing and Ordering Rational Numbers
EMPIRICAL FORMULA The empirical formula represents the smallest ratio of atoms present in a compound. The molecular formula gives the total number of atoms.
Chap 5 Q Fourier Transform: p
Adding and Subtracting Fractions
In this tutorial you will be able to follow along step by step on how to solve basic operations involving fractions.
Programmable ions set the stage for quantum computers
Comparing and Ordering Rational Numbers Guided Notes
Warmup Solve 256
Grover. Part 2 Anuj Dawar.
Solving Rational Equations and Radical Equations
Index Laws Learning Objectives:
Quantum Computing Joseph Stelmach.
Section 11.8 Day 1 Rational Equations
Tuesday’s Warm Up.
Write an equation for this diagram
BY:DAMONDRE WILSON AND JAMAL TATE
Adding and Subtracting Fractions
Presentation transcript:

Shor Algorithm Anuj Dawar

Finding the eigenvalue is the same as finding its phase 

Target register Index register to store the eigenvalue Unitary operator for which we calculate phase of eigenvalue using phase kickback we measure the phase We initialize to all states

Formulas for the phase estimation algorithm This is the input to QFT ()

Because e j  is an eigenvallue of U

We found phase Assume k an integer Number of bits

Concluding, we can calculate phase

Easy to multiply but difficult to factor big integers.

Assume: We want to find the smallest r such that the above is true

Greatest common denominator

So now what remains is to be able to find period, but this is something well done with spectral transforms.

Phase is 1/r

Reductions Solve RSA Factor big integers Find period Estimate Phase Fourier Transform