Byung-Soo Choi.
|
|
- Cecilia Ray
- 5 years ago
- Views:
Transcription
1 Grover Search and its Applications Bung-Soo Choi
2 Contents Basics of Quantum Computation General Properties of Grover Search Idea Analsis Weight Decision Smmetric To Weights Asmmetric To Weights Multiple Weights Conclusion
3 Unit of Information 0 Basis, logical value ZERO Basis, logical value ONE = a 0 + b Unit of Information b to basis Bit(Classical Unit of Information) hen a =, b = 0 Þ = 0 or a = 0, b = Þ = Qubit(Quantum Unit of Information) = a 0 + b, a, b Î Complex Number, a + b = ( ) Example) = 0 + i
4 Basics of Quantum Computation Superposition A qubit can represent to basis states simultaneousl Example) To Qubits for Four Basis Ä = ( 0 + ) Ä ( 0 + ) n qubits can represent Än = å N - k n k = 0 Exponential Reduction of Resource for State Space!!!! = 4 0 Ä Ä + Ä 0 + Ä = ( ) = ( ) 4 ( )
5 Basics of Quantum Computation Entanglement Space-like long distance correlation ith nosignaling condition Example) An Entangled State for to qubits Ä = Ä + Ä ( 0 0 ) If the state of first qubit is 0, then the state of second qubit MUST be 0 No signaling condition: No a to communicate faster than light!!!
6 Basics of Quantum Computation Interference To phases of a same basis can be interfered a 0 + b 0 = ( a + b ) 0
7 Basics of Quantum Computation Operation on quantum state Unitar Operator for Evolving Quantum State + U Þ, hereuu = I init next Measurement Operator(Projection Operator) a 0 b 0 0 = + M = ( + ) M ì ï 0, P = a = í ïî, P = b k m ì, if k = m ü = í ý î0, otheriseþ If measure b, e can get the folloing state ith corresponding probabilit
8 Basics of Quantum Computation Quantum Parallelism
9 Basics of Quantum Computation General Vie of Quantum Computation Initialize All Input Qubits Make a Superposed State for All Search Space Appl Necessar Unitar Operators ith Oracle Calles Measure Final State If the final measurement output corresponds to the target solution, it stops. Otherise, it redo all steps from beginning
10 Basics of Quantum Computation Bounded Quantum Probabilistic (BQP) Classes Unless the quantum computation is sure success, the success probabilit is not unit Hence, e have to redo the quantum computation several times
11 Contents Basics of Quantum Computation General Properties of Grover Search Idea Analsis Weight Decision Smmetric To Weights Asmmetric To Weights Multiple Weights Conclusion
12 Search Problem Finds a certain x t here F(x t )= and x t is n- bit number x i = n = N Classical Oracle Quer Complexit is Quantum Oracle Quer Complexit is Quadratic Speedup!!! O N O ( ) ( N )
13 Basic Idea of Grover Search Lov Grover found a quantum search (996) Basic Idea Prepare and Initialize all input space Appl Grover operator until onl target input survive Each Grover operator checks all function values for all input values simultaneousl Single Time Step for All Evaluations Each Grover operator increases the phase amplitude of target input, and decreases the phase amplitudes of all other nontarget inputs Phase Amplitude increases linearl Measure the final state, and hence onl the target can be measured The measurement probabilit is the square of the phase amplitude
14 Schematic circuit for the quantum search algorithm O( N ) For Search space 0 Än n H Ä G G G Measure For Oracle Workspace 0 Oracle Phase x (- ) f x ( ) x n H Ä 0 0 x - x fo r x > 0 H Än
15 Some Insights Phase x oracle (- ) f x ( ) x n H Ä 0 0 x - x fo r x > 0 H Än 0 0 üï ý Þ - x - x fo r x > 0 ïþ ( 0 0 I ) x, x ¹ x t üï ý Þ - - x, x = xt ïþ ( I x t x t ) Ä n ( ) Þ ( - ) Ä n H I H I \ G = ( -I)( I - x x ) t t
16 Some Insights ( I - x x ) t t ( - I ) : Inversion about the target : Inversion about the average \ G= Inversion about the average * Inversion about the target
17 Example of Grover Search Original Amplitudes Negate Amplitude Average of all Amplitudes Flip all Amplitudes around Avg
18 Analsis Initial State: N - = å N x= 0 x Let s = x t ns = - å x xt N ¹ x q q N - sin = cos = N N q q = sin s + cos ns
19 Analsis Basis Vector: æ ns ö è s ø æ q ö ç cos = q sin è ø æ q q ö æ 0 ö ç cosg sin g I - xt xt = ( ) - I = è0 -ø q q sin cos ç g - g è ø æ q q ö ç cos g -sin g æcos( q ) -sin ( q ) ö G = = R ( q ) q q sin ( q ) cos( q ) sin cos ç g g è ø è ø ( )
20 G Analsis æ q q öæ q ö æ æ q öö cos sin cos cos q + ç g - g ç ç è ø = = q q q q sin cos ç sin ç æ ö ç g g ç sin q + è øè ø è è ø ø \ G k æ æ q öö ç cosç kq + è ø = ç æ q ö ç sinç kq + è è ø ø
21 k Psucess s G sin k Analsis æ q ö = = ç q + è ø æ q ö sin ç kq + =>, P sucess => è ø q p p kq + = k = - q q sin =. N q q q q If N is large, 0, sin 0, sin, \» N N k p N 4 = - \O( N )
22 Contents General Properties of Grover Search Idea Analsis Weight Decision Smmetric To Weights Asmmetric To Weights Multiple Weights Conclusion
23 Smmetric To Weight Decision Exact quantum algorithm to distinguish Boolean functions of different eights, Samuel L Braunstein, Bung-Soo Choi, Subhamo Maitra, and Subhroshekhar Ghosh, Journal of Phsics A: Mathematical and Theoretical, 40(9) ,
24 Motivation We can exploit the quantum computation for crptanalsis Crptanalsis: Analze the securit of secure functions Usuall, it takes large volume of computation, and hence computationall hard to crack the secure functions In this ork, as the basic level, e can consider to check the eight of Boolean functions
25 Definitions Weight of a Boolean function f = # of solutions / # of all inputs Smmetric Weight Condition {, + =, 0< < <} Smmetric Weight Decision Problem Decide the exact eight of f ith the smmetric eight condition Limited Weight Decision Problem æ kp ö = sin = è k + ø cos kp ö è k + ø æ
26 Grover Search in Hilbert Space b b,0 = sin s + cos ns G = -I ( q ) I ( f) s,0 s,4 ( p, p ),3 ( p, p ), i I ( q ) º I - ( - e q ) b ( p, p ) q = f = p b b, ( p, p ) G = -I ( p ) I ( p ) s,0 = ( - I)( I - s s ),0,0 b b /,0 ns b b, k = sin(k + ) s + cos(k + ) ns
27 Grover Search in Bloch Sphere,0 æ sin b ö = 0 ç cos b è - ø q f i( + ) G = -e R (-q ) R s (-f ),0 X,,3 ( p, p ) ( p, p ) ( p, p ) b b,4 b b Z s b æ 0 ö = 0 ç + è ø, k æ sin((k + ) b) ö = 0 ç - cos((k + ) b) è ø, ( p, p ) æ sin b ö 0 = ç cos b è - ø,0 ns æ 0 ö = 0 ç - è ø
28 + = s æ 0 ö = 0 ç + è ø ns æ 0 ö = 0 ç - è ø
29 = /4 s æ 0 ö = 0 ç + è ø Z X æ p ö ç sin 3 ç 0 = ç p ç - cos è 3 ø 0 ns æ 0 ö = 0 ç - è ø
30 = 3/4 æ p ö ç sin 3 ç 0 = ç p ç - cos è 3 ø 0 X s æ 0 ö = 0 ç + è ø Z ns æ 0 ö = 0 ç - è ø
31 One Quer is Sufficient When = ¼ and = ¾, One Quer is Sufficient If the final measurement output is one of solutions, = If the final measurement output is one of non-solutions, =
32 Sure Success ith One Quer If ¼ <= <= and is knon before, One Quer is Sufficient to find an One of Solutions b Finding To phases Z X D.P. Chi and J. Kim, Quantum database search b a single quer in First NASA International Conference on Quantum Computing and Quantum Communications, Palm Springs, 998, edited b C.P. Williams (Springer, Berlin, 998)
33 Limited Weight-Decision Algorithm = = = kp k + sin ( ) kp k + ( k + ) p k + cos ( ) sin ( ) æ sin( kp ) ö æ 0 ö æ 0 ö = 0 = 0 = 0 ç - cos( kp ) ç - cos( kp ) ç (-) è ø è ø è ø, k k + æ sin(( k + ) p ) ö æ 0 ö æ 0 ö 0 0 0, k = = = ç k - cos(( k + ) p ) ç - cos(( k + ) p ) ç (-) è ø è ø è ø Limited Weight-Decision Algorithm Appl k Grover operators to Measure, k in the computation basis Let the measured result be,0 If k is even and f( )=, = else = ˆx ˆx If k is odd and f( )=, = else = ˆx
34 When To Steps are Sufficient + Z = S,0 +X -X b,0 - Z = NS
35 When To Steps are Sufficient R S ( p ),0 + Z = S,0 B = R ( p) S,0 +X -X,0 b A = R ( p) S,0 - Z = NS
36 When To Steps are Sufficient R ( q ) R S ( p ),0,0 + Z = S Line f Line A A = R ( q ) R ( p ) S,0,0,0 B = R ( p) S,0 +X -X,0 b A = R ( p) S,0 B = R ( q ) R S ( p),0,0 - Z = NS Line B Line -f
37 When To Steps are Sufficient R ( p ) R ( q ) R ( p ) S,0 S,0 Line B + Z = S Line f Line A A = R ( p) R ( q ) R ( p) 3 S S,0,0 A = R ( q ) R ( p ) S,0,0,0 B = R ( p) S,0 +X -X,0 b A = R ( p) S,0 B = R ( p) R ( q ) R ( p) 3 S S,0,0 B = R ( q ) R S ( p),0,0 Line A - Z = NS Line B Line -f
38 When To Steps are Sufficient B = R ( q ) R ( p ) R ( q ) R ( p ) 4 S S,0,0,0 + Z = S Line f Line B Line A A = R ( p) R ( q ) R ( p) 3 S S,0,0 A = R ( q ) R ( p ) S,0,0,0 B = R ( p) S,0 +X -X,0 b A = R ( p) S,0 B = R ( p) R ( q ) R ( p) 3 S S,0,0 B = R ( q ) R S ( p),0,0 Line A - Z = NS Line B Line -f A = R ( q ) R ( p ) R ( q ) R ( p ) 4 S S,0,0,0
39 æ æ,0,0 X = sin b sin(k - 3) b 0 = ç cos(k 3) b è - - ø ö, k - Z Z = X tan b - ö ç 0 ç cos b è - ø B b Z Even K cos(k - ) b = X tan b - cos b non - solution A Z = - X tan b - R ( p ) Z, k - æ - sin(k - 3) b = ç 0 ç cos(k 3) b è - - ø ö = A R æ =,0, k - ( q ) R ( p ) Z, k - cos(k - ) b - cos b ç sin b = ç ç - cos(k - ) b - cos b ç cos b è ø B = R ( p ) A Z æ - cos(k - ) b + cos b ç sin b = ç - ç - cos(k - ) b - cos b ç cos b è ø ö ö
40 Odd K R ( p ) Z, k- æ -sin(k - 3) b æ,0 sin b X ö = ç 0 ç cos b è - ø = ç 0 ç cos(k 3) b è - - ø,0 Z = - X tan b + ö Z A b Z solution = X tan b -, k- cos(k - ) b cos b æ sin(k - 3) b = ç 0 ç cos(k 3) b è - - ø Z = X tan b + ö A = = R,0, k- ( q ) R ( p ) Z, k- æ cos b + cos(k - ) b ç sin b = ç ç cos b - cos(k - ) b ç cos b è ø B = R ( p ) A B æ - cos b - cos(k - ) b Z ö ç sin b = ç - ç cos b - cos(k - ) b ç cos b è ø ö
41 -, k cosq = Phase Conditions for A k (-) cos b - cos b cos(k - ) b sin b sin(k - ) b q k cos(k - ) b - (-) cos b æ sin(k - 3) b ö ç sin b R ( q,0 ) R z ( p ) 0 ç = ç k cos(k 3) b è - - cos(k ) b ( ) cos ø ç b ç cos b è ø = sinq sin(k - ) b æ Based on Even K ö
42 Phase Conditions for q R,0 k æ -cos(k - ) b + (-) cos b ç sin b æ 0 ö ( q) ç - = 0 k k ç -cos(k - ) b ( ) cos ( ) - - b è - - ø ç cos b è ø cosq = k k (-) sin b ( sin q - (-) sin b ) k cos b cos b - (-) (k - ) b ö
43 Smmetric Weight-Decision Algorithm Smmetric Weight Decision Algorithm,0 = 0, i = 0 If Otherise k satisfies While Än p 5 sin, k =, k - p k p sin ( ) < sin ( ) k - k + k - k p < b p b b = p k k i < ( k - ) do { + = - I ( p ) I ( p ), i = i + }, i s, i,0 = -I (-q ) I ( p ),, k - s, k -,0 = -I (-q ) I ( p ) -, k s, k,0 Measure, k Let the result be in the computational basis ˆx If k is odd and f ( x ˆ) = then = else = If k is even and ( ˆ) then else = f x = =
44 Performance When k is given, Classical Loer Bound At least O(k ) Quantum Upper Bound At most O(k)
45 Conclusions and Open Problems For General Weight Condition, an Exact Quantum Algorithm is possible When General Weights? Onl the condition: 0< < < When Multiple Weights?,, 3, What is the Loer Bound for Weight Decision Problems?
46 Contents General Properties of Grover Search Idea Analsis Weight Decision Smmetric To Weights Asmmetric To Weights Multiple Weights Conclusion
47 Asmmetric To Weight Decision Quantum Algorithm for the Asmmetric Weight Decision Problem and its Generalization to Multiple Weights, Bung-Soo Choi and Samuel L. Braunstein To Appear on Quantum Information Processing,
48 Motivation Extend the Smmetric Case to Asmmetric Case Problem 0< + <
49 Modif the Oracle Function b Adding to qubits more to reduce the problem into the smmetric case =n /N, =n /N Basic Idea To satisf + =, e modif the Oracle as f '( x) ì f ( x), 0 x < N, ï f ( x), N x < N, = í ï, N x < N + l, ï î0, N + l x < 4N
50 Basic Idea n + ' = 4N l n + ' = 4N l ' + ' = Þ = - + l N ( n n )
51 Conclusion B adding more input space, e can reduce the asmmetric eight decision problem into the smmetric eight decision problem For adding more inputs, e just need onl to qubits
52 Contents General Properties of Grover Search Idea Analsis Weight Decision Smmetric To Weights Asmmetric To Weights Multiple Weights Conclusion
53 Motivation Given a Boolean function f, decide exactl the eight of f here {0 < < < m < }.
54 Basic Idea Multiple Weight Decision Algorithm Let S = {,,..., m}. WHILE ( S = ) { min = smallest eight from S. max = largest eight from S. Asmmetric Weight Decision Algorithm( min, max ). S = S non_selected eight. } Return the exact eight as S.
55 Analsis Classical Quer Complexit is O(N) Overall Complexit is O( m N ) When m N, the proposed algorithm orks faster than classical one
56 Contents General Properties of Grover Search Idea Analsis Weight Decision Smmetric To Weights Asmmetric To Weights Multiple Weights Conclusion
57 Conclusion The Speedup of Grover search is quadratic, not exponential. Hoever, the applications based on Grover search is ver ide In this talk, e just discuss applications of Grover search for Weight Decision Problem of Boolean function Smmetric Weight Asmmetric Weight Multiple Weights Since lots of classical algorithms are based on Search algorithm, Grover search can be utilized for them ith shoing quadratic speedup
Trigonometry (Addition,Double Angle & R Formulae) - Edexcel Past Exam Questions. cos 2A º 1 2 sin 2 A. (2)
Trigonometry (Addition,Double Angle & R Formulae) - Edexcel Past Exam Questions. (a) Using the identity cos (A + B) º cos A cos B sin A sin B, rove that cos A º sin A. () (b) Show that sin q 3 cos q 3
More informationF O R SOCI AL WORK RESE ARCH
7 TH EUROPE AN CONFERENCE F O R SOCI AL WORK RESE ARCH C h a l l e n g e s i n s o c i a l w o r k r e s e a r c h c o n f l i c t s, b a r r i e r s a n d p o s s i b i l i t i e s i n r e l a t i o n
More informationIntroduction to Quantum Information Processing
Introduction to Quantum Information Processing Lecture 6 Richard Cleve Overview of Lecture 6 Continuation of teleportation Computation and some basic complexity classes Simple quantum algorithms in the
More information! " # $! % & '! , ) ( + - (. ) ( ) * + / 0 1 2 3 0 / 4 5 / 6 0 ; 8 7 < = 7 > 8 7 8 9 : Œ Š ž P P h ˆ Š ˆ Œ ˆ Š ˆ Ž Ž Ý Ü Ý Ü Ý Ž Ý ê ç è ± ¹ ¼ ¹ ä ± ¹ w ç ¹ è ¼ è Œ ¹ ± ¹ è ¹ è ä ç w ¹ ã ¼ ¹ ä ¹ ¼ ¹ ±
More informationDifferentiating Functions & Expressions - Edexcel Past Exam Questions
- Edecel Past Eam Questions. (a) Differentiate with respect to (i) sin + sec, (ii) { + ln ()}. 5-0 + 9 Given that y =, ¹, ( -) 8 (b) show that = ( -). (6) June 05 Q. f() = e ln, > 0. (a) Differentiate
More informationFramework for functional tree simulation applied to 'golden delicious' apple trees
Purdue University Purdue e-pubs Open Access Theses Theses and Dissertations Spring 2015 Framework for functional tree simulation applied to 'golden delicious' apple trees Marek Fiser Purdue University
More informationChapter 10. Quantum algorithms
Chapter 10. Quantum algorithms Complex numbers: a quick review Definition: C = { a + b i : a, b R } where i = 1. Polar form of z = a + b i is z = re iθ, where r = z = a 2 + b 2 and θ = tan 1 y x Alternatively,
More informationComplex numbers: a quick review. Chapter 10. Quantum algorithms. Definition: where i = 1. Polar form of z = a + b i is z = re iθ, where
Chapter 0 Quantum algorithms Complex numbers: a quick review / 4 / 4 Definition: C = { a + b i : a, b R } where i = Polar form of z = a + b i is z = re iθ, where r = z = a + b and θ = tan y x Alternatively,
More informationIntroduction to Quantum Computing
Introduction to Quantum Computing Part II Emma Strubell http://cs.umaine.edu/~ema/quantum_tutorial.pdf April 13, 2011 Overview Outline Grover s Algorithm Quantum search A worked example Simon s algorithm
More informationα x x 0 α x x f(x) α x x α x ( 1) f(x) x f(x) x f(x) α x = α x x 2
Quadratic speedup for unstructured search - Grover s Al- CS 94- gorithm /8/07 Spring 007 Lecture 11 01 Unstructured Search Here s the problem: You are given an efficient boolean function f : {1,,} {0,1},
More informationAutomatic Control III (Reglerteknik III) fall Nonlinear systems, Part 3
Automatic Control III (Reglerteknik III) fall 20 4. Nonlinear systems, Part 3 (Chapter 4) Hans Norlander Systems and Control Department of Information Technology Uppsala University OSCILLATIONS AND DESCRIBING
More informationIntroduction to Quantum Computing
Introduction to Quantum Computing Part I Emma Strubell http://cs.umaine.edu/~ema/quantum_tutorial.pdf April 12, 2011 Overview Outline What is quantum computing? Background Caveats Fundamental differences
More informationRedoing the Foundations of Decision Theory
Redoing the Foundations of Decision Theory Joe Halpern Cornell University Joint work with Larry Blume and David Easley Economics Cornell Redoing the Foundations of Decision Theory p. 1/21 Decision Making:
More informationTowards a High Level Quantum Programming Language
MGS Xmas 04 p.1/?? Towards a High Level Quantum Programming Language Thorsten Altenkirch University of Nottingham based on joint work with Jonathan Grattage and discussions with V.P. Belavkin supported
More informationAPPLYING QUANTUM SEARCH TO A KNOWN- PLAINTEXT ATTACK ON TWO-KEY TRIPLE ENCRYPTION
APPLYING QUANTUM SEARCH TO A KNOWN- PLAINTEXT ATTACK ON TWO-KEY TRIPLE ENCRYPTION Phaneendra HD, Vidya Raj C, Dr MS Shivakumar Assistant Professor, Department of Computer Science and Engineering, The National
More informationROM-BASED COMPUTATION: QUANTUM VERSUS CLASSICAL
arxiv:quant-ph/0109016v2 2 Jul 2002 ROM-BASED COMPUTATION: QUANTUM VERSUS CLASSICAL B. C. Travaglione, M. A. Nielsen Centre for Quantum Computer Technology, University of Queensland St Lucia, Queensland,
More informationQuantum Computing Lecture 6. Quantum Search
Quantum Computing Lecture 6 Quantum Search Maris Ozols Grover s search problem One of the two most important algorithms in quantum computing is Grover s search algorithm (invented by Lov Grover in 1996)
More informationLimits and Continuity. 2 lim. x x x 3. lim x. lim. sinq. 5. Find the horizontal asymptote (s) of. Summer Packet AP Calculus BC Page 4
Limits and Continuity t+ 1. lim t - t + 4. lim x x x x + - 9-18 x-. lim x 0 4-x- x 4. sinq lim - q q 5. Find the horizontal asymptote (s) of 7x-18 f ( x) = x+ 8 Summer Packet AP Calculus BC Page 4 6. x
More informationLA PRISE DE CALAIS. çoys, çoys, har - dis. çoys, dis. tons, mantz, tons, Gas. c est. à ce. C est à ce. coup, c est à ce
> ƒ? @ Z [ \ _ ' µ `. l 1 2 3 z Æ Ñ 6 = Ð l sl (~131 1606) rn % & +, l r s s, r 7 nr ss r r s s s, r s, r! " # $ s s ( ) r * s, / 0 s, r 4 r r 9;: < 10 r mnz, rz, r ns, 1 s ; j;k ns, q r s { } ~ l r mnz,
More informationA Functional Quantum Programming Language
A Functional Quantum Programming Language Thorsten Altenkirch University of Nottingham based on joint work with Jonathan Grattage and discussions with V.P. Belavkin supported by EPSRC grant GR/S30818/01
More informationQuantum Search on Strongly Regular Graphs
Quantum Search on Strongly Regular Graphs Degree Project in Engineering Physics, Second Level by Jonatan Janmark at Department of Theoretical Physics Royal Institute of Technology (KTH) & Department of
More informationprobability of k samples out of J fall in R.
Nonparametric Techniques for Density Estimation (DHS Ch. 4) n Introduction n Estimation Procedure n Parzen Window Estimation n Parzen Window Example n K n -Nearest Neighbor Estimation Introduction Suppose
More informationPhysics 101. Vectors. Lecture 2. h0r33fy. EMU Physics Department. Assist. Prof. Dr. Ali ÖVGÜN
Phsics 101 Lecture 2 Vectors ssist. Prof. Dr. li ÖVGÜN EMU Phsics Department h0r33f www.aovgun.com Coordinate Sstems qcartesian coordinate sstem qpolar coordinate sstem qfrom Cartesian to Polar coordinate
More informationQUESTIONS ON QUARKONIUM PRODUCTION IN NUCLEAR COLLISIONS
International Workshop Quarkonium Working Group QUESTIONS ON QUARKONIUM PRODUCTION IN NUCLEAR COLLISIONS ALBERTO POLLERI TU München and ECT* Trento CERN - November 2002 Outline What do we know for sure?
More informationGrover s algorithm. We want to find aa. Search in an unordered database. QC oracle (as usual) Usual trick
Grover s algorithm Search in an unordered database Example: phonebook, need to find a person from a phone number Actually, something else, like hard (e.g., NP-complete) problem 0, xx aa Black box ff xx
More informationQuantum Information Processing and Diagrams of States
Quantum Information and Diagrams of States September 17th 2009, AFSecurity Sara Felloni sara@unik.no / sara.felloni@iet.ntnu.no Quantum Hacking Group: http://www.iet.ntnu.no/groups/optics/qcr/ UNIK University
More informationh (1- sin 2 q)(1+ tan 2 q) j sec 4 q - 2sec 2 q tan 2 q + tan 4 q 2 cosec x =
Trigonometric Functions 6D a Use + tan q sec q with q replaced with q + tan q ( ) sec ( q ) b (secq -)(secq +) sec q - (+ tan q) - tan q c tan q(cosec q -) ( ) tan q (+ cot q) - tan q cot q tan q d (sec
More informationQuantum Mechanics & Quantum Computation
Quantum Mechanics & Quantum Computation Umesh V. Vazirani University of California, Berkeley Lecture 14: Quantum Complexity Theory Limits of quantum computers Quantum speedups for NP-Complete Problems?
More informationImaginary Numbers Are Real. Timothy F. Havel (Nuclear Engineering)
GEOMETRIC ALGEBRA: Imaginary Numbers Are Real Timothy F. Havel (Nuclear Engineering) On spin & spinors: LECTURE The operators for the x, y & z components of the angular momentum of a spin / particle (in
More informationDiscrete quantum random walks
Quantum Information and Computation: Report Edin Husić edin.husic@ens-lyon.fr Discrete quantum random walks Abstract In this report, we present the ideas behind the notion of quantum random walks. We further
More informationQ A. A B C A C D A,C,D A,B,C B,C B,C Q A. C C B SECTION-I. , not possible
PAPER CODE SCORE-I LEADER & ENTHUSIAST COURSE TARGET : JEE (Main + Advanced) 04 PART- : MATHEMATICS SECTION-I SECTION-II SECTION-IV. Ans. (A) 0 C T 0 7 SECTION-I For x > & >, [x] - [] - + is not possible
More informationSimon s algorithm (1994)
Simon s algorithm (1994) Given a classical circuit C f (of polynomial size, in n) for an f : {0, 1} n {0, 1} n, such that for a certain s {0, 1} n \{0 n }: x, y {0, 1} n (x y) : f (x) = f (y) x y = s with
More informationT i t l e o f t h e w o r k : L a M a r e a Y o k o h a m a. A r t i s t : M a r i a n o P e n s o t t i ( P l a y w r i g h t, D i r e c t o r )
v e r. E N G O u t l i n e T i t l e o f t h e w o r k : L a M a r e a Y o k o h a m a A r t i s t : M a r i a n o P e n s o t t i ( P l a y w r i g h t, D i r e c t o r ) C o n t e n t s : T h i s w o
More informationDiscrete Quantum Theories
Discrete Quantum Theories Andrew J. Hanson 1 Gerardo Ortiz 2 Amr Sabry 1 Yu-Tsung Tai 3 (1) School of Informatics and Computing (2) Department of Physics (3) Mathematics Department Indiana University July
More informationQuantum Searching. Robert-Jan Slager and Thomas Beuman. 24 november 2009
Quantum Searching Robert-Jan Slager and Thomas Beuman 24 november 2009 1 Introduction Quantum computers promise a significant speed-up over classical computers, since calculations can be done simultaneously.
More informationQuantum Circuits and Algorithms
Quantum Circuits and Algorithms Modular Arithmetic, XOR Reversible Computation revisited Quantum Gates revisited A taste of quantum algorithms: Deutsch algorithm Other algorithms, general overviews Measurements
More informationChapter 10 Conics, Parametric Equations, and Polar Coordinates Conics and Calculus
Chapter 10 Conics, Parametric Equations, and Polar Coordinates 10.1 Conics and Calculus 1. Parabola A parabola is the set of all points x, y ( ) that are equidistant from a fixed line and a fixed point
More informationAdiabatic quantum computation a tutorial for computer scientists
Adiabatic quantum computation a tutorial for computer scientists Itay Hen Dept. of Physics, UCSC Advanced Machine Learning class UCSC June 6 th 2012 Outline introduction I: what is a quantum computer?
More information1 Quantum Circuits. CS Quantum Complexity theory 1/31/07 Spring 2007 Lecture Class P - Polynomial Time
CS 94- Quantum Complexity theory 1/31/07 Spring 007 Lecture 5 1 Quantum Circuits A quantum circuit implements a unitary operator in a ilbert space, given as primitive a (usually finite) collection of gates
More informationIntroduction The Search Algorithm Grovers Algorithm References. Grovers Algorithm. Quantum Parallelism. Joseph Spring.
Quantum Parallelism Applications Outline 1 2 One or Two Points 3 4 Quantum Parallelism We have discussed the concept of quantum parallelism and now consider a range of applications. These will include:
More informationS T A T E B U D G E T : T A X A M E N D M E N T S
i T A X I N F O R M ATION N. 1 J a n u a r y 2 0 1 3 2 0 1 3 S T A T E B U D G E T : T A X A M E N D M E N T S I. I N T R O D U C T I O N................................... 2 I I. P E R S O N A L I N C
More informationC/CS/Phys C191 Grover s Quantum Search Algorithm 11/06/07 Fall 2007 Lecture 21
C/CS/Phys C191 Grover s Quantum Search Algorithm 11/06/07 Fall 2007 Lecture 21 1 Readings Benenti et al, Ch 310 Stolze and Suter, Quantum Computing, Ch 84 ielsen and Chuang, Quantum Computation and Quantum
More informationAPPLYING QUANTUM SEARCH TO A KNOWN- PLAINTEXT ATTACK ON TWO-KEY TRIPLE ENCRYPTION
APPLYING QUANTUM SEARCH TO A KNOWN- PLAINTEXT ATTACK ON TWO-KEY TRIPLE ENCRYPTION Phaneendra H.D., Vidya Raj C., Dr. M.S. Shivaloimar Assistant Professor, Department of Computer Science and Engineering,
More informationWaves, the Wave Equation, and Phase Velocity
Waves, the Wave Equation, and Phase Velocity What is a wave? The one-dimensional wave equation Wavelength, frequency, period, etc. Phase velocity Complex numbers and exponentials Plane waves, laser beams,
More informationQuantum Complexity Theory and Adiabatic Computation
Chapter 9 Quantum Complexity Theory and Adiabatic Computation 9.1 Defining Quantum Complexity We are familiar with complexity theory in classical computer science: how quickly can a computer (or Turing
More informationContinuous-time Fourier Methods
ELEC 321-001 SIGNALS and SYSTEMS Continuous-time Fourier Methods Chapter 6 1 Representing a Signal The convolution method for finding the response of a system to an excitation takes advantage of the linearity
More informationNovel topologies in superconducting junctions
Novel topologies in superconducting junctions Yuli V. Nazarov Delft University of Technology The Capri Spring School on Transport in Nanostructures 2018, Anacapri IT, April 15-22 2018 Overview of 3 lectures
More informationLecture 2: From Classical to Quantum Model of Computation
CS 880: Quantum Information Processing 9/7/10 Lecture : From Classical to Quantum Model of Computation Instructor: Dieter van Melkebeek Scribe: Tyson Williams Last class we introduced two models for deterministic
More informationMATH 1314 Test 2 Review
Name: Class: Date: MATH 1314 Test 2 Review Multiple Choice Identify the choice that best completes the statement or answers the question. 1. Find ( f + g)(x). f ( x) = 2x 2 2x + 7 g ( x) = 4x 2 2x + 9
More informationThere are four irrational roots with approximate values of
Power of the Quadratic Formula 1 y = (x ) - 8(x ) + 4 a = 1, b = -8, c = 4 Key 1. Consider the equation y = x 4 8x + 4. It may be a surprise, but we can use the quadratic formula to find the x-intercepts
More informationConcepts and Algorithms of Scientific and Visual Computing Advanced Computation Models. CS448J, Autumn 2015, Stanford University Dominik L.
Concepts and Algorithms of Scientific and Visual Computing Advanced Computation Models CS448J, Autumn 2015, Stanford University Dominik L. Michels Advanced Computation Models There is a variety of advanced
More informationElectromagnetics I Exam No. 3 December 1, 2003 Solution
Electroagnetics Ea No. 3 Deceber 1, 2003 Solution Please read the ea carefull. Solve the folloing 4 probles. Each proble is 1/4 of the grade. To receive full credit, ou ust sho all ork. f cannot understand
More informationCalculus Summer TUTORIAL
Calculus Summer TUTORIAL The purpose of this tutorial is to have you practice the mathematical skills necessary to be successful in Calculus. All of the skills covered in this tutorial are from Pre-Calculus,
More informationab = c a If the coefficients a,b and c are real then either α and β are real or α and β are complex conjugates
Further Pure Summary Notes. Roots of Quadratic Equations For a quadratic equation ax + bx + c = 0 with roots α and β Sum of the roots Product of roots a + b = b a ab = c a If the coefficients a,b and c
More information6.896 Quantum Complexity Theory October 2, Lecture 9
6896 Quantum Complexity heory October, 008 Lecturer: Scott Aaronson Lecture 9 In this class we discuss Grover s search algorithm as well as the BBBV proof that it is optimal 1 Grover s Algorithm 11 Setup
More informationExponential Quantum Speed-ups are Generic
Exponential Quantum Speed-ups are Generic Fernando GSL Brandão 1 and Michał Horodecki 2 1 Universidade Federal de Minas Gerais, Brazil 2 University of Gdansk, Poland The Role of Fourier Transform in Quantum
More informationETIKA V PROFESII PSYCHOLÓGA
P r a ž s k á v y s o k á š k o l a p s y c h o s o c i á l n í c h s t u d i í ETIKA V PROFESII PSYCHOLÓGA N a t á l i a S l o b o d n í k o v á v e d ú c i p r á c e : P h D r. M a r t i n S t r o u
More informationTransformation Rules for Designing CNOT-based Quantum Circuits
Transformation Rules for Designing CNOT-based Quantum Circuits Kazuo Iwama Sch. of Inform., Kyoto Univ. QCI, ERATO, JST iwama@kuis.kyoto-u.ac.jp Yahiko Kambayashi Sch. of Inform., Kyoto Univ. yahiko@i.kyoto-u.ac.jp
More informationTutorial on Quantum Computing. Vwani P. Roychowdhury. Lecture 1: Introduction
Tutorial on Quantum Computing Vwani P. Roychowdhury Lecture 1: Introduction 1 & ) &! # Fundamentals Qubits A single qubit is a two state system, such as a two level atom we denote two orthogonal states
More informationAn Example file... log.txt
# ' ' Start of fie & %$ " 1 - : 5? ;., B - ( * * B - ( * * F I / 0. )- +, * ( ) 8 8 7 /. 6 )- +, 5 5 3 2( 7 7 +, 6 6 9( 3 5( ) 7-0 +, => - +< ( ) )- +, 7 / +, 5 9 (. 6 )- 0 * D>. C )- +, (A :, C 0 )- +,
More informationQuantum Computer Algorithms: basics
Quantum Computer Algorithms: basics Michele Mosca Canada Research Chair in Quantum Computation SQUINT Summer School on Quantum Information Processing June 3 Overview A quantum computing model Basis changes
More informationVolume 2, Issue 9, September 2014 International Journal of Advance Research in Computer Science and Management Studies
Volume 2, Issue 9, September 2014 International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online at: www.ijarcsms.com
More informationMETHODS OF DIFFERENTIATION. Contents. Theory Objective Question Subjective Question 10. NCERT Board Questions
METHODS OF DIFFERENTIATION Contents Topic Page No. Theor 0 0 Objective Question 0 09 Subjective Question 0 NCERT Board Questions Answer Ke 4 Sllabus Derivative of a function, derivative of the sum, difference,
More informationCHAPTER 3 Describing Relationships
CHAPTER 3 Describing Relationships 3.1 Scatterplots and Correlation The Practice of Statistics, 5th Edition Starnes, Tabor, Yates, Moore Bedford Freeman Worth Publishers Scatterplots and Correlation Learning
More information( ) 4. Jones Matrix Method 4.1 Jones Matrix Formulation A retardation plate with azimuth angle y. V û ë y û. év ù év ù év. ë y û.
4. Jons Mati Mthod 4. Jons Mati Foulation A tadation plat with aziuth angl Yh; 4- Linal polaizd input light é = ë û Dcoposd into th slow and ast noal ods és é cos sin é = sin cos ë- û ë û R ( ), otation
More informationTrigonometry and modelling 7E
Trigonometry and modelling 7E sinq +cosq º sinq cosa + cosq sina Comparing sin : cos Comparing cos : sin Divide the equations: sin tan cos Square and add the equations: cos sin (cos sin ) since cos sin
More informationMatrices and Determinants
Matrices and Determinants Teaching-Learning Points A matri is an ordered rectanguar arra (arrangement) of numbers and encosed b capita bracket [ ]. These numbers are caed eements of the matri. Matri is
More informationShort Course in Quantum Information Lecture 2
Short Course in Quantum Information Lecture Formal Structure of Quantum Mechanics Course Info All materials downloadable @ website http://info.phys.unm.edu/~deutschgroup/deutschclasses.html Syllabus Lecture
More informationQuantum Computers. Peter Shor MIT
Quantum Computers Peter Shor MIT 1 What is the difference between a computer and a physics experiment? 2 One answer: A computer answers mathematical questions. A physics experiment answers physical questions.
More informationExponential algorithmic speedup by quantum walk
Exponential algorithmic speedup by quantum walk Andrew Childs MIT Center for Theoretical Physics joint work with Richard Cleve Enrico Deotto Eddie Farhi Sam Gutmann Dan Spielman quant-ph/0209131 Motivation
More informationNumerical Methods School of Mechanical Engineering Chung-Ang University
Part 2 Chapter 5 Roots: Bracketing Methods Prof. Hae-Jin Choi hjchoi@cau.ac.kr 1 Overview of Part 2 l To find the roots of general second order polynomial, the quadratic formula is used b b 2 2 - ± - 4ac
More informationFILL THE ANSWER HERE
Home Assignment # STRAIGHT OBJCTIV TYP J-Mathematics. Assume that () = and that for all integers m and n, (m + n) = (m) + (n) + (mn ), then (9) = 9 98 9 998. () = {} + { + } + { + }...{ + 99}, then [ (
More informationQuantum Permanent Compromise Attack to Blum-Micali Pseudorandom Generator
Quantum Permanent Compromise Attack to Blum-Micali Pseudorandom Generator Elloá B Guedes, Francisco M de Assis, Bernardo Lula Jr IQuanta Institute for Studies in Quantum Computation and Quantum Information
More informationExperimental plug and play quantum coin flipping Supplementary Information
Experimental plug and pla quantum coin flipping Supplementar Information SUPPLEMENTARY FIGURES SUPPLEMENTARY NOTES Supplementar Note 1 - Securit Analsis 1 Φ 1,1 Φ 0,1 + θ = cos 1 Φ 0,0 0 Φ 1,0 Supplementar
More informationUNIQUE FJORDS AND THE ROYAL CAPITALS UNIQUE FJORDS & THE NORTH CAPE & UNIQUE NORTHERN CAPITALS
Q J j,. Y j, q.. Q J & j,. & x x. Q x q. ø. 2019 :. q - j Q J & 11 Y j,.. j,, q j q. : 10 x. 3 x - 1..,,. 1-10 ( ). / 2-10. : 02-06.19-12.06.19 23.06.19-03.07.19 30.06.19-10.07.19 07.07.19-17.07.19 14.07.19-24.07.19
More informationNotes for Lecture 3... x 4
Stanford University CS254: Computational Complexity Notes 3 Luca Trevisan January 18, 2012 Notes for Lecture 3 In this lecture we introduce the computational model of boolean circuits and prove that polynomial
More informationAn Introduction to Optimal Control Applied to Disease Models
An Introduction to Optimal Control Applied to Disease Models Suzanne Lenhart University of Tennessee, Knoxville Departments of Mathematics Lecture1 p.1/37 Example Number of cancer cells at time (exponential
More informationCompute the Fourier transform on the first register to get x {0,1} n x 0.
CS 94 Recursive Fourier Sampling, Simon s Algorithm /5/009 Spring 009 Lecture 3 1 Review Recall that we can write any classical circuit x f(x) as a reversible circuit R f. We can view R f as a unitary
More informationIE 400 Principles of Engineering Management. Graphical Solution of 2-variable LP Problems
IE 400 Principles of Engineering Management Graphical Solution of 2-variable LP Problems Graphical Solution of 2-variable LP Problems Ex 1.a) max x 1 + 3 x 2 s.t. x 1 + x 2 6 - x 1 + 2x 2 8 x 1, x 2 0,
More informationName:... Batch:... TOPIC: II (C) 1 sec 3 2x - 3 sec 2x. 6 é ë. logtan x (A) log (tan x) (B) cot (log x) (C) log log (tan x) (D) tan (log x) cos x (C)
Nm:... Bch:... TOPIC: II. ( + ) d cos ( ) co( ) n( ) ( ) n (D) non of hs. n sc d sc + sc é ësc sc ù û sc sc é ë ù û (D) non of hs. sc cosc d logn log (n ) co (log ) log log (n ) (D) n (log ). cos log(
More informationPart I consists of 14 multiple choice questions (worth 5 points each) and 5 true/false question (worth 1 point each), for a total of 75 points.
Math 131 Exam 1 Solutions Part I consists of 14 multiple choice questions (orth 5 points each) and 5 true/false question (orth 1 point each), for a total of 75 points. 1. The folloing table gives the number
More informationQuantum algorithms (CO 781/CS 867/QIC 823, Winter 2013) Andrew Childs, University of Waterloo LECTURE 13: Query complexity and the polynomial method
Quantum algorithms (CO 781/CS 867/QIC 823, Winter 2013) Andrew Childs, University of Waterloo LECTURE 13: Query complexity and the polynomial method So far, we have discussed several different kinds of
More information18.12 FORCED-DAMPED VIBRATIONS
8. ORCED-DAMPED VIBRATIONS Vibrations A mass m is attached to a helical spring and is suspended from a fixed support as before. Damping is also provided in the system ith a dashpot (ig. 8.). Before the
More informationScandinavia SUMMER / GROUPS. & Beyond 2014
/ & 2014 25 f f Fx f 211 9 Öæ Höf æ å f 807 ø 19 øø ä 2111 1 Z F ø 1328 H f fö F H å fö ö 149 H 1 ö f Hø ø Hf 1191 2089 ä ø å F ä 1907 ä 1599 H 1796 F ø ä Jä J ( ) ø F ø 19 ö ø 15 á Å f 2286 æ f ó ä H
More informationTwo NP-hard Interchangeable Terminal Problems*
o NP-hard Interchangeable erminal Problems* Sartaj Sahni and San-Yuan Wu Universit of Minnesota ABSRAC o subproblems that arise hen routing channels ith interchangeable terminals are shon to be NP-hard
More informationQuantum Computing. Thorsten Altenkirch
Quantum Computing Thorsten Altenkirch Is Computation universal? Alonzo Church - calculus Alan Turing Turing machines computable functions The Church-Turing thesis All computational formalisms define the
More informationCSCI 2570 Introduction to Nanocomputing. Discrete Quantum Computation
CSCI 2570 Introduction to Nanocomputing Discrete Quantum Computation John E Savage November 27, 2007 Lect 22 Quantum Computing c John E Savage What is Quantum Computation It is very different kind of computation
More informationM30-1: Polynomial, Radical and Rational Functions, Graphs and Equations Exam /20
Class: Date: ID: A M30-1: Polynomial, Radical and Rational Functions, Graphs and Equations Exam /20 Multiple Choice Identify the choice that best completes the statement or answers the question. 1. Which
More informationIntroduction to Quantum Algorithms Part I: Quantum Gates and Simon s Algorithm
Part I: Quantum Gates and Simon s Algorithm Martin Rötteler NEC Laboratories America, Inc. 4 Independence Way, Suite 00 Princeton, NJ 08540, U.S.A. International Summer School on Quantum Information, Max-Planck-Institut
More informationConstructive Decision Theory
Constructive Decision Theory Joe Halpern Cornell University Joint work with Larry Blume and David Easley Economics Cornell Constructive Decision Theory p. 1/2 Savage s Approach Savage s approach to decision
More informationQuantum search by local adiabatic evolution
PHYSICAL REVIEW A, VOLUME 65, 042308 Quantum search by local adiabatic evolution Jérémie Roland 1 and Nicolas J. Cerf 1,2 1 Ecole Polytechnique, CP 165, Université Libre de Bruxelles, 1050 Brussels, Belgium
More informationA Glimpse of Quantum Computation
A Glimpse of Quantum Computation Zhengfeng Ji (UTS:QSI) QCSS 2018, UTS 1. 1 Introduction What is quantum computation? Where does the power come from? Superposition Incompatible states can coexist Transformation
More information3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 REDCLIFF MUNICIPAL PLANNING COMMISSION FOR COMMENT/DISCUSSION DATE: TOPIC: April 27 th, 2018 Bylaw 1860/2018, proposed amendments to the Land Use Bylaw regarding cannabis
More informationHamiltonian simulation and solving linear systems
Hamiltonian simulation and solving linear systems Robin Kothari Center for Theoretical Physics MIT Quantum Optimization Workshop Fields Institute October 28, 2014 Ask not what you can do for quantum computing
More informationQuantum Computation 650 Spring 2009 Lectures The World of Quantum Information. Quantum Information: fundamental principles
Quantum Computation 650 Spring 2009 Lectures 1-21 The World of Quantum Information Marianna Safronova Department of Physics and Astronomy February 10, 2009 Outline Quantum Information: fundamental principles
More informationLecture 3: Constructing a Quantum Model
CS 880: Quantum Information Processing 9/9/010 Lecture 3: Constructing a Quantum Model Instructor: Dieter van Melkebeek Scribe: Brian Nixon This lecture focuses on quantum computation by contrasting it
More informationAn Architectural Framework For Quantum Algorithms Processing Unit (QAPU)
An Architectural Framework For Quantum s Processing Unit (QAPU) Mohammad Reza Soltan Aghaei, Zuriati Ahmad Zukarnain, Ali Mamat, and ishamuddin Zainuddin Abstract- The focus of this study is developing
More informationA Quantum Associative Memory Based on Grover s Algorithm
A Quantum Associative Memory Based on Grover s Algorithm Dan Ventura and Tony Martinez Neural Networks and Machine Learning Laboratory (http://axon.cs.byu.edu) Department of Computer Science Brigham Young
More informationPropositional Calculus - Semantics (3/3) Moonzoo Kim CS Dept. KAIST
Propositional Calculus - Semantics (3/3) Moonzoo Kim CS Dept. KAIST moonzoo@cs.kaist.ac.kr 1 Overview 2.1 Boolean operators 2.2 Propositional formulas 2.3 Interpretations 2.4 Logical Equivalence and substitution
More information14 April Kidoguchi, Kenneth
Objectives.. Solve Trigonometric Equations Using a Calculator. 3. Solve Trigonometric Equations Quadratic in Form. 4. Solve Trigonometric Equations Using Fundamental Identities. 5. Solve Trigonometric
More information