Grover. Part 2 Anuj Dawar.

Slides:



Advertisements
Similar presentations
Quantum Computation and Quantum Information – Lecture 2
Advertisements

Quantum Packet Switching A. Yavuz Oruç Department of Electrical and Computer Engineering University of Maryland, College Park.
Midterm Exam for Quantum Computing Class Marek Perkowski.
Quantum Speedups DoRon Motter August 14, Introduction Two main approaches are known which produce fast Quantum Algorithms The first, and main approach.
Designing Oracles for Grover Algorithm
Calculating Spectral Coefficients for Walsh Transform using Butterflies Marek Perkowski September 21, 2005.
Phase in Quantum Computing. Main concepts of computing illustrated with simple examples.
1 Quantum Computing: What’s It Good For? Scott Aaronson Computer Science Department, UC Berkeley January 10,  John.
Grover. Part 2. Components of Grover Loop The Oracle -- O The Hadamard Transforms -- H The Zero State Phase Shift -- Z O is an Oracle H is Hadamards H.
Grover Algorithm Marek Perkowski
An Algebraic Foundation for Quantum Programming Languages Andrew Petersen & Mark Oskin Department of Computer Science The University of Washington.
University of Queensland
Review from last lecture: A Simple Quantum (3,1) Repetition Code
Grover’s Algorithm: Single Solution By Michael Kontz.
Quantum Description of Scattering
Grover. Part 2 Anuj Dawar. Components of Grover Loop The Oracle -- O The Hadamard Transforms -- H The Zero State Phase Shift -- Z.
Review of basic quantum and Deutsch-Jozsa. Can we generalize Deutsch-Jozsa algorithm? Marek Perkowski, Department of Electrical Engineering, Portland State.
Shor Algorithm Anuj Dawar. Finding the eigenvalue is the same as finding its phase 
Quantum Search Algorithms for Multiple Solution Problems EECS 598 Class Presentation Manoj Rajagopalan.
Balanced and constant functions as seen by Hadamard = Matrix M Vector V Vector S This is number of minterms “0” in the function.
Anuj Dawar.
1 Recap (I) n -qubit quantum state: 2 n -dimensional unit vector Unitary op: 2 n  2 n linear operation U such that U † U = I (where U † denotes the conjugate.
Grover’s Algorithm in Machine Learning and Optimization Applications
Grover Algorithm Anuj Dawar. Another example.
New Approach to Quantum Calculation of Spectral Coefficients Marek Perkowski Department of Electrical Engineering, 2005.
Quantum Computation and Quantum Information – Lecture 2 Part 1 of CS406 – Research Directions in Computing Dr. Rajagopal Nagarajan Assistant: Nick Papanikolaou.
ROM-based computations: quantum versus classical B.C. Travaglione, M.A.Nielsen, H.M. Wiseman, and A. Ambainis.
States, operators and matrices Starting with the most basic form of the Schrödinger equation, and the wave function (  ): The state of a quantum mechanical.
Alice and Bob’s Excellent Adventure
October 1 & 3, Introduction to Quantum Computing Lecture 1 of 2 Introduction to Quantum Computing Lecture 1 of 2
Quantum Computer Simulation Alex Bush Matt Cole James Hancox Richard Inskip Jan Zaucha.
1 hardware of quantum computer 1. quantum registers 2. quantum gates.
2.1 Day 2 Linear Transformations and their Inverses For an animation of this topic visit:
Dirac Notation States can be added to yield a new state  Superposition To describe STATES, we use vectors. VECTORS represent STATES Each vector can have.
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 653 Lecture.
Multipartite Entanglement and its Role in Quantum Algorithms Special Seminar: Ph.D. Lecture by Yishai Shimoni.
Translations Unit 2 Section 1. What is a translation? Moving a shape, without rotating or flipping it. "Sliding". The shape still looks exactly the same,
Quantum Computer Simulation Alex Bush Matt Cole James Hancox Richard Inskip Jan Zaucha.
1 An Introduction to Quantum Computing Sabeen Faridi Ph 70 October 23, 2007.
Quantum Shift Register Circuits Mark M. Wilde arXiv: National Institute of Standards and Technology, Wednesday, June 10, 2009 To appear in Physical.
Richard Cleve DC 3524 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681 Lecture.
2.1/2.2 Solving Inequalities
EGR 2131 Unit 4 Combinational Circuits: Analysis & Design
Richard Cleve DC 2117 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681 Lecture.
1.6 Solving Inequalities.
An Iterative FFT We rewrite the loop to calculate nkyk[1] once
Introduction to Quantum Computing Lecture 1 of 2
Generating Circuit Equations
MPC and Verifiable Computation on Committed Data
Recap: Chapters 1-7: Signals and Systems
Microwave Engineering
A Level Computing Component 2
Logic operations.
Quantum One.
Quantum One.
Registered Electrical & Mechanical Engineer
A Ridiculously Brief Overview
2’s Complement Arithmetic
Chap 4 Quantum Circuits: p
Logic operations.
Microwave Engineering
Chapter 2 Systems Defined by Differential or Difference Equations
Objectives Solve equations that contain absolute-value expressions.
Homework 2 This homework is the first use of quantum gates. In lectures we learned about the following gates: inverter, Feynman (controlled NOT), Toffoli.
Quantum Computation and Information Chap 1 Intro and Overview: p 28-58
Divide-and-Conquer 7 2  9 4   2   4   7
ADDITIONAL ANALYSIS TECHNIQUES
Presentation transcript:

Grover. Part 2 Anuj Dawar

Components of Grover Loop The Oracle -- O The Hadamard Transforms -- H The Zero State Phase Shift -- Z

Inputs oracle This is action of quantum oracle We need to initialize in a superposed state

This is a typical way how oracle operates This is a typical way how oracle operation is described Encodes input combination with changed sign in a superposition of all

Role of Oracle We want to encode input combination with changed sign in a superposition of all states. This is done by Oracle together with Hadamards. We need a circuit to distinguish somehow globally good and bad states.

Vector of Hadamards

This is value of oracle bit All information of oracle is in the phase but how to read it? Flips the data phase This is value of oracle bit This is just an example of a single minterm, but can be any function

Flips the oracle bit when all bits are zero Rewriting matrix Z to Dirac notation, you can change phase globally This is state of all zeros

Here you have all components of Grover’s loop This is a global view of Grover. Repeatitions of G In each G

Generality Observe that a problem is described only by Oracle. So by changing the Oracle you can have your own quantum algorithm. You can still improve the Grover loop for particular special cases

Here we explain in detail what happens inside G Here we explain in detail what happens inside G. This can be generalized to G-like circuits Grover iterate has two tasks: (1) invert the solution states and (2) invert all states about the mean proof

Here we prove that |> <  | used inside HZH calculates the mean

( ) ( ) From previous slide What does it mean invert all states about the mean? This proof is easy and it only uses formalisms that we already know.

Amplitudes of bits after Hadamard Positive or negative amplitudes in other explanations Amplitudes of bits after Hadamard For every bit All possible states

Amplitudes of bits after one stage of G This value based on previous slide

This slides explains mechanism of Grover-like algorithms

Additional Exercise You can verify it also in simulation

Here we calculate analytically when to stop The equations taken from the previous slides “Grover Iterate” For marked state For unmarked state

recursion We want to find how many times to iterate We found k from these equations