Generalized Deutsch Algorithms IPQI 5 Jan 2010. Background Basic aim : Efficient determination of properties of functions. Efficiency: No complete evaluation.

Slides:



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

Quantum Versus Classical Proofs and Advice Scott Aaronson Waterloo MIT Greg Kuperberg UC Davis | x {0,1} n ?
Quantum Software Copy-Protection Scott Aaronson (MIT) |
University of Queensland
Puzzle Twin primes are two prime numbers whose difference is two.
Quantum Computing MAS 725 Hartmut Klauck NTU
1 Transportation problem The transportation problem seeks the determination of a minimum cost transportation plan for a single commodity from a number.
Quantum Packet Switching A. Yavuz Oruç Department of Electrical and Computer Engineering University of Maryland, College Park.
Emergence of Quantum Mechanics from Classical Statistics.
Quantum Computing MAS 725 Hartmut Klauck NTU
Department of Computer Science & Engineering University of Washington
University of Queensland
Review of basic quantum and Deutsch-Jozsa. Can we generalize Deutsch-Jozsa algorithm? Marek Perkowski, Department of Electrical Engineering, Portland State.
Introduction to Quantum Information Processing Lecture 4 Michele Mosca.
CSEP 590tv: Quantum Computing
Quantum Computing Joseph Stelmach.
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.
Quantum Mechanics from Classical Statistics. what is an atom ? quantum mechanics : isolated object quantum mechanics : isolated object quantum field theory.
Quantum Computing Lecture 1 Michele Mosca. l Course Outline
New Approach to Quantum Calculation of Spectral Coefficients Marek Perkowski Department of Electrical Engineering, 2005.
Quantum Error Correction Jian-Wei Pan Lecture Note 9.
Alice and Bob’s Excellent Adventure
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.
V. Space Curves Types of curves Explicit Implicit Parametric.
Quantum Computing MAS 725 Hartmut Klauck NTU TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A A.
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 653 Course.
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.
October 1 & 3, Introduction to Quantum Computing Lecture 1 of 2 Introduction to Quantum Computing Lecture 1 of 2
Quantum Factoring Michele Mosca The Fifth Canadian Summer School on Quantum Information August 3, 2005.
You Did Not Just Read This or did you?. Quantum Computing Dave Bacon Department of Computer Science & Engineering University of Washington Lecture 3:
Section 2.3 Properties of Solution Sets
1 Introduction to Quantum Information Processing CS 667 / PH 767 / CO 681 / AM 871 Richard Cleve DC 2117 Lecture 20 (2009)
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.
Efficiency of Multi-Qubit W states in Information Processing Atul Kumar IPQI-2014 IIT Jodhpur
A Monomial matrix formalism to describe quantum many-body states Maarten Van den Nest Max Planck Institute for Quantum Optics Montreal, October 19 th 2011.
CSEP 590tv: Quantum Computing Dave Bacon July 20, 2005 Today’s Menu n Qubit registers Begin Quantum Algorithms Administrivia Superdense Coding Finish Teleportation.
8.4.2 Quantum process tomography 8.5 Limitations of the quantum operations formalism 量子輪講 2003 年 10 月 16 日 担当:徳本 晋
Quantum Two 1. 2 Angular Momentum and Rotations 3.
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 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 653 Lecture.
International Iran conference on Quantum Information September 2007, Kish Island Evaluation of bounds of codes defined over hexagonal and honeycomb lattices.
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.
Multipartite Entanglement and its Role in Quantum Algorithms Special Seminar: Ph.D. Lecture by Yishai Shimoni.
Classical Control in Quantum Programs Dominique Unruh IAKS, Universität Karlsruhe Founded by the European Project ProSecCo IST
IPQI-2010-Anu Venugopalan 1 qubits, quantum registers and gates Anu Venugopalan Guru Gobind Singh Indraprastha Univeristy Delhi _______________________________________________.
Debasis Sarkar * Department of Applied Mathematics, University of Calcutta *
Richard Cleve DC 2117 Introduction to Quantum Information Processing QIC 710 / CS 667 / PH 767 / CO 681 / AM 871 Lecture (2011)
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.
Density matrix and its application. Density matrix An alternative of state-vector (ket) representation for a certain set of state-vectors appearing with.
Quantum Computer Simulation Alex Bush Matt Cole James Hancox Richard Inskip Jan Zaucha.
Intro to Quantum Algorithms SUNY Polytechnic Institute Chen-Fu Chiang Fall 2015.
Systems of Identical Particles
Richard Cleve DC 2117 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681 Lecture.
Unit-III Algebraic Structures
Postulates of Quantum Mechanics
Introduction to Quantum Computing Lecture 1 of 2
MATH2999 Directed Studies in Mathematics Quantum Process on One Qubit System Name: Au Tung Kin UID:
Quantum Computing Dorca Lee.
A Ridiculously Brief Overview
Quantum Information Theory Introduction
Numerical Analysis Lecture 16.
Chap 4 Quantum Circuits: p
Quantum Computation and Information Chap 1 Intro and Overview: p 28-58
Quantum Computing Joseph Stelmach.
Implementation of Learning Systems
Finite Heisenberg group and its application in quantum computing
Introduction to Quantum Information Processing CS 467 / CS 667 Phys 467 / Phys 767 C&O 481 / C&O 681 Lecture 4 (2005) Richard Cleve DC 653
Presentation transcript:

Generalized Deutsch Algorithms IPQI 5 Jan 2010

Background Basic aim : Efficient determination of properties of functions. Efficiency: No complete evaluation of the function itself. Tools: Quantum Circuits. Principles: Superposition, Entanglement

Example: Deutsch Algorithm Let f : {0,1} → {0,1} f There are four possibilities: xf1(x)f1(x) xf2(x)f2(x) xf3(x)f3(x) xf4(x)f4(x) Goal: Distinguish Constant from Non-constant Any classical method requires two queries

Deutsch contd….. Is There a Quantum Method? Answer: determine f(0)  f(1)

Quantum Oracle Function black box or Oracle:- Unitary operation implementing unknown function After applying a series of Gates and the Oracle, we “measure” the final state of the qubit in a suitable basis. Membership to sets of functions with orthogonal final states determinable by measurement.

Deutsch Algorithm  The final state is |0> for constant and |1> for non-constant  Operate |0> <1| : one measurement distinguishes between constant and non constant functions. |0> |1> H H |0>-|1> |0>+|1> H

Note: Vectors vis-à-vis Rays xf1(x)f1(x) xf2(x)f2(x) xf3(x)f3(x) xf4(x)f4(x) (0 + 1)(0 + 1) (0 – 1)(0 – 1)

Experimental Implementation: IISc group

Generalization: Deutsch Jozsa algorithm F:{0,..,2 n -1} → {0,1} Strong Restriction Further Restrictions: Either balanced or constant Recall: balanced functions send half the domain points to 0 and the other half to 1 Question Posed : constant or balanced ?

The Circuit Single Measurement/query does the job H

Deutsch Jozsa algorithm contd Constant : outcome is |0> with probability 1 Balanced : outcome is non |0> with probability 1 Classical algorithm requires minimum of 2 and maximum of 2 n-1 +1 measurements H

AIM :Generalization to more general functions

Approach to generalization Question posed must be ‘non-trivial’ Functions must have symmetries that can be exploited. Generalize Deutsch-Josza : Include a larger range and hence a larger class of functions.

Approach contd… Constructive approach : Circuit is designed. Allows the study of the relationship between quantum circuits and properties of functions,

Larger Aim Theory of Quantum Circiits

Illustration: The 2-qubit case 256 such functions 4 functions in each category obtained by uniform translation CONSTANT PLATEAU/BASIN SAWTOOTH EVEN STEP

Circuit: Ansatz Category |0>,|1>,|2> or |3>. Deutsch Jozsa is a subset = identity, for the particular classification being attempted

Circuit Continued… 3 Can be written as a product of single qubit gates

Applying the oracle gives : Circuit Explanation:…

The final state is : Circuit Continued…

Important Point Invariants within each category are in the parentheses.

Basic requirement : functions from different categories produce orthogonal final states i.e. : if f belongs to the i-th category, |i> is obtained with probability 1 on measurement. Eg : constant functions is the 0-th category CONSTANT PLATEAU/BASIN SAWTOOTH EVEN STEP |00> |11> |01> |10>

CONSTANT PLATEAU/BASIN SAWTOOTH EVEN STEP

Characteristics of categories: Functions in a given category give the same ray as the output. Such functions cannot be distinguished by the circuit. These indistinguishable functions form a category

Questions Is a further generalization Possible? Note: We still have 240 functions untouched Is it possible to understand why the above circuit works?

A unique Unitary transformation U(f) : action of the oracle on |x>|y>, corresponding to a function f. {U(f i )} corresponding to the 256 functions form an abelian group, with composition as the group operation.. The Underlying Group Structure

For a given f which has f(0)=F 0, f(1)=F 1, f(2)=F 2, f(3)=F 3, U(f) is given by a 16 x 16 matrix Explicit form of U Note: A A = A a ba  b

Basic idea behind the generalization Cosets of the subgroup consisting of U(f i ’ ) Left and right cosets equivalent since the group is abelian 16 cosets of order 16 each

Cosets Each coset is “labelled” by the set {k i } The 16 cosets {k i } required to exhaust all 256 group elements are as shown {0,0,0,0}{1,0,0,0}{2,0,0,0}{3,0,0,0} {0,1,1,0}{0,1,0,0}{1,0,3,0}{0,3,0,0} {0,0,1,1}{0,0,1,0}{1,3,0,0}{0,0,3,0} {0,1,0,1}{0,0,0,1}{1,0,0,3}{0,0,0,3} Note that within each coset, we can again distinguish between categories consisting of 4 functions each, as we shall now see.

Claim within each coset, we can again distinguish four categories consisting of 4 functions each.

An Example: Coset generation and its labeling: {0,1,1,0} CONSTANT PLATEAU/BASIN SAWTOOTH EVEN STEP {0,1,1,0}

Modification of the circuit: Introduce

The structure of the Gate : =

Example |00> |11> |01> |10> 0000→ → → → → → → → → → → → → → → → 3021

Cost of the new gate Depends on the “entanglement” in the state!

Entanglement ? Preparation of an entangled state is not required at any step in the Deutsch/Deutsch-Jozsa. It is also not required if we were to consider only those 16 functions corresponding to the subgroup However, the state shown, which is necessary for categorization of a coset, may be entangled for certain cosets.

is a measure of entanglement for : Entanglement of the initial state {0,0,0,0}{1,0,0,0}{2,0,0,0}{3,0,0,0} {0,1,1,0}{0,1,0,0} {1,0,30}{0,3,0,0} {0,0,1,1}{0,0,1,0}{1,3,0,0 }{0,0,3,0} {0,1,0,1}{0,0,0,1}{1,0,0,3}{0,0,0,3} (k 0 k 1 k 2 k 3 for each coset) Partially entangled (E = 0.707) Entangled (E = 1) Not entangled (E = 0)

Entanglement of initial state Identify a global property of the functions that is invariant within each coset Measure of entanglement explicitly for the initial state. sin(π(k 1 + k 2 – k 3 – k 0 )/4).

Entanglement of initial state In the subgroup f(1)+f(2)-f(0)-f(3) = 0, f(1)+f(2)-f(0)-f(3) = 0, we do not need an entangled state to categorize this coset. f(1)+f(2)-f(0)-f(3) = 1 or 3, we need a partially entangled state If f(1)+f(2)-f(0)-f(3) = 2, then we need a maximally entangled state

Points to note The measure of entanglement which we have used has no non-trivial generalization to multipartite systems In such cases, entropy of reduced density matrices is an indicator of entanglement (In this particular case (bipartite), Entropy is a monotonic function of the measure used)

Generalization to n Qubits = =

There are N N functions. ( N = 2 n ) Subgroup – N 2 elements N N-2 cosets = =

Thank You Collaborators : Vipul Ambasht Pronoy Sircar Sunil Yeshwanth