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.

Slides:



Advertisements
Similar presentations
Department of Computer Science & Engineering University of Washington
Advertisements

Quantum Computation and Quantum Information – Lecture 2
Quantum Computation and Quantum Information – Lecture 3
University of Queensland
Sequences and Mathematical Induction
Quantum Packet Switching A. Yavuz Oruç Department of Electrical and Computer Engineering University of Maryland, College Park.
Quantum Phase Estimation using Multivalued Logic.
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.
KEG PARTY!!!!!  Keg Party tomorrow night  Prof. Markov will give out extra credit to anyone who attends* *Note: This statement is a lie.
Department of Computer Science & Engineering University of Washington
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.
5 Qubits Error Correcting Shor’s code uses 9 qubits to encode 1 qubit, but more efficient codes exist. Given our error model where errors can be any of.
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.
Ternary Deutsch’s, Deutsch-Jozsa and Affine functions Problems All those problems are not published yet.
Engineering Models and Design Methods for Quantum State Machines.
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.
Quantum Computing Lecture 22 Michele Mosca. Correcting Phase Errors l Suppose the environment effects error on our quantum computer, where This is a description.
Quantum Search Heuristics: Tad Hogg’s Perspective George Viamontes February 4, 2002.
Quantum Computing Joseph Stelmach.
Quantum Search Algorithms for Multiple Solution Problems EECS 598 Class Presentation Manoj Rajagopalan.
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
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.
Orthogonal Transforms
ROM-based computations: quantum versus classical B.C. Travaglione, M.A.Nielsen, H.M. Wiseman, and A. Ambainis.
Zeroing in on the Implicit Function Theorem The Implicit Function Theorem for several equations in several unknowns.
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.
Quantum Error Correction Jian-Wei Pan Lecture Note 9.
Alice and Bob’s Excellent Adventure
Analysis of Algorithms
October 1 & 3, Introduction to Quantum Computing Lecture 1 of 2 Introduction to Quantum Computing Lecture 1 of 2
Short course on quantum computing Andris Ambainis University of Latvia.
Mathematical Induction I Lecture 4: Sep 16. This Lecture Last time we have discussed different proof techniques. This time we will focus on probably the.
Quantum Computer Simulation Alex Bush Matt Cole James Hancox Richard Inskip Jan Zaucha.
1 hardware of quantum computer 1. quantum registers 2. quantum gates.
You Did Not Just Read This or did you?. Quantum Computing Dave Bacon Department of Computer Science & Engineering University of Washington Lecture 3:
Zeroing in on the Implicit Function Theorem Real Analysis II Spring, 2007.
Date: 2.4 Real Zeros of Polynomial Functions
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.
CHARACTERIZATIONS OF INVERTIBLE MATRICES
Multipartite Entanglement and its Role in Quantum Algorithms Special Seminar: Ph.D. Lecture by Yishai Shimoni.
Quantum Computation Stephen Jordan. Church-Turing Thesis ● Weak Form: Anything we would regard as “computable” can be computed by a Turing machine. ●
Quantum Computer Simulation Alex Bush Matt Cole James Hancox Richard Inskip Jan Zaucha.
Announcements Reading quiz shifted to tomorrow 9/12 Lectures through Monday posted Homework solutions 1, 2a, 2b posted.
1 An Introduction to Quantum Computing Sabeen Faridi Ph 70 October 23, 2007.
Intro to Quantum Algorithms SUNY Polytechnic Institute Chen-Fu Chiang Fall 2015.
Richard Cleve DC 2117 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681 Lecture.
Introduction to Quantum Computing Lecture 1 of 2
Logic operations.
A Ridiculously Brief Overview
Chap 4 Quantum Circuits: p
Logic operations.
OSU Quantum Information Seminar
Quantum Computation and Information Chap 1 Intro and Overview: p 28-58
Grover. Part 2 Anuj Dawar.
Presentation transcript:

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 is Hadamards Z is Zero State Phase Shift Grover Iterate

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

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

Notation Reminder a Control with value a=1 a Control with value a=0 a equivalent

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

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

= With accuracy to phase

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

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

proof 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

Here we prove that |  > <  | used inside HZH calculates the mean a Vector of mean values Will be explained in next slide Explanation of the first part of Grover iterate formula

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

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

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

This slides explains the basic mechanism of the Grover-like algorithms

You can verify it also in simulation Additional Exercise This is a lot calculations, requires matrix multiplication

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

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

But you can do better if you have knowledge, for instance the upper bound of chromatic number in graph coloring

Grover search example. Here is an example of Grover search for n = 3 qubits, where N = 2 n =8. –We omit reference to qubit n+1, which is in state 1 /√2 (|0>−|1>i) and does not change. The dimension of the unitary operators for this example is thus 2 n = 8 also.)

(Remember that numbering starts with 0 and ends with 7, so that the -1 here is in the slot for |5>.) This matrix reverses the sign on state |5>, and leaves the other states unchanged. Suppose the unknown number is |a> = |5>. The matrix or black box oracle Ufa is oracle

The Walsh matrix W 8 is Now we use normalization

The matrix −U f 0 is

This matrix changes the sign on all states except |0>. Finally, we have the repeated step R s R a in the Grover algorithm: oracle shift hadamards

After second rotation we get

Summary and our work When you know anything about the problem (symmetry, observation, bounds, function within some classification class) you can design a better Grover like algorithm but for your data only. This is enough in real life like CAD or Image Processing, since data are always specific, not the worst case data as in Mathematic proofs

Problem for students Build the Grover algorithm for ternary quantum logic. First you need to generalize Hadamard transform to Chrestenson transform. Next you need to have some kind of ternary reversible gates to build oracle. The same gates will be used for Zero State Phase Shift circuit.