Quantum Query Complexity of Boolean Functions with Small On-Sets
|
|
- Randell Bradley
- 5 years ago
- Views:
Transcription
1 Quantum Query Complexity of Boolean Functions with Small On-Sets Seiichiro Tani TT/JST ERATO-SORST. Joint work with Andris Ambainis Univ. of Latvia Kazuo Iwama Kyoto Univ. Masaki akanishi AIST. Harumichi ishimura Osaka Pref. Univ Rudy Raymond IBM Shigeru Yamashita AIST.
2 Motivation Want to test some properties of huge data X, Or, compute some function f(x). e.g. WWW analysis, Experimental data analysis. X Reading all memory cells of X costs too much. Can we save the number of accessing X when computing certain functions f(x)?
3 Oracle Computation Model Can know the value of one cell by making a query to X. Description of f (e.g. truth table) What is value x i of the i th cell? 0/1 X x 1 x i x f(x) output Cost measure:= of queries to be made. (All other computation is free.) R(f): Query complexity of f := of queries needed to compute f for the worst input X
4 Oracle Computation Model Can know the value of one cell by making a query to X. Description of f (e.g. truth table) What is value x i of the i th cell? 0/1 X x 1 x i x f(x) output Cost measure:= of queries to be made. (All other computation is free.) Bounded error R(f): Query complexity of f with error probability < 1/3 := of queries needed to compute f for the worst input X
5 Quantum Computation Qubit: A unit of quantum information. A quantum state φ of one qubit : a unit vector in 2- dimensional Hilbert space. For an orthonorma l basis '' 1$, ' 0$ $ = 0 1 φ = α 0 + β 1 where α, β C and α ( 0, 1 ) 2 + β, 2 = 1. A quantum state ϕ of n qubits : n a unit vector in 2 - dimensiona l Hilbert space. ϕ n 2 1 = α for orthonormal basis { }. i 0 i i i = i Quantum operation: only unitary operation H ϕ ϕ
6 Oracle Computation Model (Quantum) A quantum query is a linear combination of classical queries. Can know a linear combination of the value of cells per query. Description of f (e.g. truth table) f(x) output α i α i i i 0 x i 2 ( αi = 1) i X x 1 x i x Q(f): (Bounded-error) Quantum query complexity of f := of quantum queries needed to compute f with error probability < 1/3 for the worst input X
7 Fundamental Problems What is the quantum/classical query complexity of function f? For what function f, is quantum computation faster than classical one? In particular, Boolean functions are major targets. This talk focuses on Boolean functions in bounded-error setting (constant error probability is allowed).
8 Previous Works (Almost) o quantum speed up against classical. PARITY, MAJORITY [BBCMdW01]. Ω() quantum queries are needed. Polynomial quantum speed up against classical OR [Gro96], AD-OR trees [HMW03,ACRSZ07] Quantum O( ) v.s. Classical Ω (). k-threshold functions for k<< /2 [BBCMdW01] Quantum Θ( (k)) v.s. Classical Ω (). Testing graph properties (=n(n-1)/2 variables) Triangle: Quantum O(n 1.3 ) [MSS05] Star: Quantum Θ(n 1.5 ) [BCdWZ99] Connectivity: Quantum Θ(n 1.5 ) [DHHM06] Classical Ω(n 2 ) But much less is known except for the above typical cases. We investigate the query complexity of the families defined a natural parameter.
9 On-set of Boolean Functions We consider the size of the on-set of a Boolean function as a parameter. On-set S f of a Boolean function f: The set of input X {0,1} for which f(x)=1. Ex.) On-set S f of f=(x 1 x 2 ) x 3 : (x 1,x 2,x 3 )=(1,1,0), (1,1,1), (0,0,1), (0,1,1), (1,0,1). The size of S f is 5.
10 Our Results (1/2) F,M : family of -variable Boolean functions f whose on-set is of size M. Query complexity of the functions ( poly() M 2 with 0 < d < 1) d in F, M Quantum Q(f) (1) Hardest case : Θ$ (2) Easiest case : Θ (3) Average Case : ( ) O( M + ), Ω$ M M + << Classical R(f) Ω() F,M easy (2) (3) (1) complexity hard
11 Our results (2/2) Our hardest-case complexity gives the tight complexity of some graph property testing. Does G have property P? Is there edge (i,j)? Yes/o a b c d e a $ b $ c $ $ d $ e $ Adjacency matrix of G = b n(n-1)/2 variables c a d e Unknown G (Planarity testing) Is G planar? : Q(f)=Θ(n 1.5 ). R(f)=Ω(n 2 ) (For a given adjacency list, O(n) time complexity [Hopcroft-Tarjan74]) (Graph Isomorphism testing) Is G isomorphic to a fixed graph G? : Q(f)=Θ(n 1.5 ). (R(f)=Ω(n 2 ) [DHHM06]) By setting M = of graphs with property P.
12 OUTLIES OF PROOFS
13 Our Results(1/2) F,M : family of -variable Boolean functions f whose on-set is of size M. Query complexity of the functions ( poly() M 2 with 0 < d < 1) d in F, M (1) Hardest case : Θ$ (2) Easiest case : Θ (3) Average Case : Quantum Q(f) F,M ( ) O( M + ), Ω$ M M + << Classical R(f) Ω() easy (2) (3) (1) complexity hard
14 Hardest-case Bound Theorem :For any function f F, M, Q( f ) ' = Θ M $ if poly( ) M 2 d for some constant d(0 < d < 1). Proof. Lower Bound: By showinga function for every M Upper bound: which has O$ M (The function is similar to t - threshold function for t =.) M complexity. Use the algorithm [AIKMRY07] for Oracle Identification Problem.
15 Oracle Identification Problem (OIP) Given a set of M candidates, identify the -bit string in the oracle.. Oracle (=8) i x i ???????? Candidate Set (=8, M=4) Can see the contents w/o making queries. i Candidate 1 Candidate 2 Candidate 3 Candidate
16 Hardest-case Bound Proof (Continued) Theorem[AIKMRY07]: ' OIP can be solved with bounded - error by making O if poly( ) M 2 d for some constant d(0 < d < 1). M $ quantum queries, Idea: Set the onset S f to the candidate set of OIP and run the algorithm for OIP to get an estimate Y S f of X. By definition, Y=X (with high probability) iff f(x)=1. Test if X=Y, which can be done with quantum query complexity O( ).
17 Our Results (1/2) F,M : family of -variable Boolean functions f whose on-set is of size M. Query complexity of the functions ( poly() M 2 with 0 < d < 1) d in F, M (1) Hardest case : Θ$ (2) Easiest case : Θ (3) Average Case : Quantum Q(f) ( ) O( M + ), Ω$ M M + << Classical R(f) Ω() F,M easy (2) (3) (1) complexity hard
18 Easiest-case Bound Theorem :If Q( f 2+ ε M 2 for any positive constant ε, ) = Θ( ) for any f F., M Proof: Use sensitivity argument. Th.[Beals et al. 2001] Q( f ) = Ω( s( f )) Assuming s(f)=o(), we can conclude a contradiction by simply counting, f 1 (1) 2+ ε > 2 M We can construct a function with such quantum query complexity.
19 Our Results (1/2) F,M : family of -variable Boolean functions f whose on-set is of size M. Query complexity of the functions ( poly() M 2 with 0 < d < 1) d in F, M (1) Hardest case : Θ$ (2) Easiest case : Θ (3) Average Case : Quantum Q(f) ( ) O( M + ), Ω$ M M + << Classical R(f) Ω() F,M easy (2) (3) (1) complexity hard
20 Average-case Bound Theorem :Averageof Q( f ) over all f F, is O( M M + ). Proof. Claim: For almost all functions f in F,M, every element in the on-set S f differs from any other in the first O( M) bits. Y 1 Y M-1 Y M O( M) bits Make queries to the first O( M) bits to identify a unique string Y in S f (If there is no such Y, we are done: f(x)=0.) 2. Test if Y=X with O( ) quantum queries. Y=X if and only if f(x)=1.
21 Average-case Bound M Theorem : Average of Q( f ) over all f F, M is O$ +. c + M Proof 1 xi With one quantum query, ϕ X = ( 1) i. i= 1 Claim: For almost all functions in F, M, every X,Y intheonset 1 M ϕ X ϕ Y = ( 2Ham( X, Y )) > 2. S f satisfy (Proof is by bounding Hamming distance with coding-theory argument and Chernoff-like bound.) ϕ X ϕ Y is large enough to identify X in S f with ' M O c + M $ copies of ϕ X according toquantum state discriminationtheorem [HW06].
22 Average-case Bound Theorem : Average of Q( f ) over all f F, M is Ω( M / + ). Actually, we prove stronger statement.
23 Average-case Bound Theorem : Average of unbounded - error query complexity over all f F is Ω( M / )., M + Unbounded-error: error probability is 1/2-ε for arbitrary small ε Proof: Use the next theorem. Theorem[Anthony ext Talk] The number of Boolean functions f whose unbounded query complexity is d/2 is For d = M 2 T(, d), 2 D 1 k = 0 we can prove ( 2 1 ' k $ for D = d i= 0 ( ' i. $ T$, M 2 is much smaller than $ 2 M, i.e., the sizeof F,M.
24 Our Quantum Complexity F,M : family of -variable Boolean functions f whose on-set is of size M. Quantum query complexity of the functions in F, M For poly() M 2 with 0 < d < 1, M (1) Hardest case : Θ$ (2) Easiest case : Θ (3) Average Case : d ( ) O( M + ), Ω$ M + M Θ$ c + M (1 M 2 M Θ$ + c + M (1 M 2 /( ) 2+ε / 2) ) F,M easy (2) (3) (1) complexity hard
25 Theorem: Application: Planarity Testing R(f planarity )= Θ(n 1.5 ), while R(f planarity )=Θ(n 2 ). Proof. Since the planar graph has at most 3n-6 edges. of possible edges M = (of planar graphs) ' $ 3n 6 = ' n( n 1) / 2$ 3n 6 2 6nn By the hardest - case complexity, M, we can obtain the upper bound. For the lower bound, we carefully prepare a set of planar graphs and a set of non-planar graphs, and then apply the quantum/classical adversary method [Amb01,Aar04].
26 Summary Proved the tight quantum query complexity of the family of Boolean functions with fixed on-set size M. Functions with on-set size M have various quantum query complexity, while their randomized query d complexity is Ω() for poly( ) M 2. (For large M, the functions may have small randomized query complexity.) On-set size is a very simple and natural parameter, which enables us to easily analyze the query complexity of some Boolean functions with our bounds. In particular, we proved the tight quantum query complexity of some graph property testing problems.
27 Thank you
The query register and working memory together form the accessible memory, denoted H A. Thus the state of the algorithm is described by a vector
1 Query model In the quantum query model we wish to compute some function f and we access the input through queries. The complexity of f is the number of queries needed to compute f on a worst-case input
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 informationThe Quantum Query Complexity of the Determinant
The Quantum Query Complexity of the Determinant Sebastian Dörn Inst. für Theoretische Informatik Universität Ulm 89069 Ulm, Germany Thomas Thierauf Fak. Elektronik und Informatik HTW Aalen 73430 Aalen,
More informationQuantum Algorithms for Finding Constant-sized Sub-hypergraphs
Quantum Algorithms for Finding Constant-sized Sub-hypergraphs Seiichiro Tani (Joint work with François Le Gall and Harumichi Nishimura) NTT Communication Science Labs., NTT Corporation, Japan. The 20th
More informationFrom Adversaries to Algorithms. Troy Lee Rutgers University
From Adversaries to Algorithms Troy Lee Rutgers University Quantum Query Complexity As in classical complexity, it is difficult to show lower bounds on the time or number of gates required to solve a problem
More informationThe Quantum Query Complexity of Algebraic Properties
The Quantum Query Complexity of Algebraic Properties Sebastian Dörn Institut für Theoretische Informatik Universität Ulm 89069 Ulm, Germany Thomas Thierauf Fak. Elektronik und Informatik HTW Aalen 73430
More informationQuantum algorithms based on span programs
Quantum algorithms based on span programs Ben Reichardt IQC, U Waterloo [arxiv:0904.2759] Model: Complexity measure: Quantum algorithms Black-box query complexity Span programs Witness size [KW 93] [RŠ
More informationAdversary-Based Parity Lower Bounds with Small Probability Bias
Adversary-Based Parity Lower Bounds with Small Probability Bias Badih Ghazi Adversary-Based Parity Lower Bounds with Small Probability Bias 1 / 10 Setup Computing the parity function in the query model
More informationQuantum Query Algorithm Constructions for Computing AND, OR and MAJORITY Boolean Functions
LATVIJAS UNIVERSITĀTES RAKSTI. 008, 733. sēj.: DATORZINĀTNE UN INFORMĀCIJAS TEHNOLOĢIJAS 15. 38. lpp. Quantum Query Algorithm Constructions for Computing AND, OR and MAJORITY Boolean Functions Alina Vasiljeva
More informationQuantum algorithms. Andrew Childs. Institute for Quantum Computing University of Waterloo
Quantum algorithms Andrew Childs Institute for Quantum Computing University of Waterloo 11th Canadian Summer School on Quantum Information 8 9 June 2011 Based in part on slides prepared with Pawel Wocjan
More informationarxiv:quant-ph/ v1 29 May 2003
Quantum Lower Bounds for Collision and Element Distinctness with Small Range arxiv:quant-ph/0305179v1 29 May 2003 Andris Ambainis Abstract We give a general method for proving quantum lower bounds for
More informationImproved Quantum Algorithm for Triangle Finding via Combinatorial Arguments
Improved Quantum Algorithm for Triangle Finding via Combinatorial Arguments François Le Gall The University of Tokyo Technical version available at arxiv:1407.0085 [quant-ph]. Background. Triangle finding
More informationQuantum query complexity of entropy estimation
Quantum query complexity of entropy estimation Xiaodi Wu QuICS, University of Maryland MSR Redmond, July 19th, 2017 J o i n t C e n t e r f o r Quantum Information and Computer Science Outline Motivation
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 informationSimultaneous Communication Protocols with Quantum and Classical Messages
Simultaneous Communication Protocols with Quantum and Classical Messages Oded Regev Ronald de Wolf July 17, 2008 Abstract We study the simultaneous message passing model of communication complexity, for
More informationTutorial on the adversary method for quantum and classical lower bounds. Sophie Laplante LRI, Université Paris-Sud Orsay
Tutorial on the adversary method for quantum and classical lower bounds Sophie Laplante LRI, Université Paris-Sud Orsay Adversary method lower bounds Exact complexity Strong lower bound Semidefinite Programming
More informationData Structures and Algorithms Running time and growth functions January 18, 2018
Data Structures and Algorithms Running time and growth functions January 18, 2018 Measuring Running Time of Algorithms One way to measure the running time of an algorithm is to implement it and then study
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 informationLimitations of Algorithm Power
Limitations of Algorithm Power Objectives We now move into the third and final major theme for this course. 1. Tools for analyzing algorithms. 2. Design strategies for designing algorithms. 3. Identifying
More informationLecture 13: Lower Bounds using the Adversary Method. 2 The Super-Basic Adversary Method [Amb02]
Quantum Computation (CMU 18-859BB, Fall 015) Lecture 13: Lower Bounds using the Adversary Method October 1, 015 Lecturer: Ryan O Donnell Scribe: Kumail Jaffer 1 Introduction There are a number of known
More informationSimulating classical circuits with quantum circuits. The complexity class Reversible-P. Universal gate set for reversible circuits P = Reversible-P
Quantum Circuits Based on notes by John Watrous and also Sco8 Aaronson: www.sco8aaronson.com/democritus/ John Preskill: www.theory.caltech.edu/people/preskill/ph229 Outline Simulating classical circuits
More informationChebyshev Polynomials, Approximate Degree, and Their Applications
Chebyshev Polynomials, Approximate Degree, and Their Applications Justin Thaler 1 Georgetown University Boolean Functions Boolean function f : { 1, 1} n { 1, 1} AND n (x) = { 1 (TRUE) if x = ( 1) n 1 (FALSE)
More informationQuantum algorithms for testing Boolean functions
Quantum algorithms for testing Boolean functions Dominik F. Floess Erika Andersson SUPA, School of Engineering and Physical Sciences Heriot-Watt University, Edinburgh EH4 4AS, United Kingdom dominikfloess@gmx.de
More informationQuantum Algorithms for Graph Traversals and Related Problems
Quantum Algorithms for Graph Traversals and Related Problems Sebastian Dörn Institut für Theoretische Informatik, Universität Ulm, 89069 Ulm, Germany sebastian.doern@uni-ulm.de Abstract. We study the complexity
More informationAsymptotic Analysis. Slides by Carl Kingsford. Jan. 27, AD Chapter 2
Asymptotic Analysis Slides by Carl Kingsford Jan. 27, 2014 AD Chapter 2 Independent Set Definition (Independent Set). Given a graph G = (V, E) an independent set is a set S V if no two nodes in S are joined
More informationCS Communication Complexity: Applications and New Directions
CS 2429 - Communication Complexity: Applications and New Directions Lecturer: Toniann Pitassi 1 Introduction In this course we will define the basic two-party model of communication, as introduced in the
More informationSimultaneous Communication Protocols with Quantum and Classical Messages
Simultaneous Communication Protocols with Quantum and Classical Messages Dmitry Gavinsky Oded Regev Ronald de Wolf December 29, 2008 Abstract We study the simultaneous message passing (SMP) model of communication
More informationarxiv:quant-ph/ v1 3 Nov 2006
Quantum Network Coding for General Graphs arxiv:quant-ph/06039v 3 Nov 006 Kazuo Iwama Harumichi Nishimura Rudy Raymond 3 Shigeru Yamashita 4 School of Informatics, Kyoto University iwama@kuis.kyoto-u.ac.jp
More informationNon-Approximability Results (2 nd part) 1/19
Non-Approximability Results (2 nd part) 1/19 Summary - The PCP theorem - Application: Non-approximability of MAXIMUM 3-SAT 2/19 Non deterministic TM - A TM where it is possible to associate more than one
More informationTheoretical Computer Science
Theoretical Computer Science 456 (0) 5 64 Contents lists available at SciVerse ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Quantum counterfeit coin problems
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 informationSensitivity, Block Sensitivity and Certificate Complexity of Boolean Functions (Master s Thesis)
Sensitivity, Block Sensitivity and Certificate Complexity of Boolean Functions (Master s Thesis) Sourav Chakraborty Thesis Advisor: László Babai February, 2005 Abstract We discuss several complexity measures
More informationLecture 10: Learning DNF, AC 0, Juntas. 1 Learning DNF in Almost Polynomial Time
Analysis of Boolean Functions (CMU 8-859S, Spring 2007) Lecture 0: Learning DNF, AC 0, Juntas Feb 5, 2007 Lecturer: Ryan O Donnell Scribe: Elaine Shi Learning DNF in Almost Polynomial Time From previous
More informationImproving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision
Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision Stacey Jeffery 1,2, Robin Kothari 1,2, and Frédéric Magniez 3 1 David R. Cheriton School of Computer Science, University
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 informationEssential facts about NP-completeness:
CMPSCI611: NP Completeness Lecture 17 Essential facts about NP-completeness: Any NP-complete problem can be solved by a simple, but exponentially slow algorithm. We don t have polynomial-time solutions
More informationarxiv: v1 [quant-ph] 24 Jul 2015
Quantum Algorithm for Triangle Finding in Sparse Graphs François Le Gall Shogo Nakajima Department of Computer Science Graduate School of Information Science and Technology The University of Tokyo, Japan
More informationQUANTUM COMPUTATION. Exercise sheet 1. Ashley Montanaro, University of Bristol H Z U = 1 2
School of Mathematics Spring 017 QUANTUM COMPUTATION Exercise sheet 1 Ashley Montanaro, University of Bristol ashley.montanaro@bristol.ac.uk 1. The quantum circuit model. (a) Consider the following quantum
More informationMajority is incompressible by AC 0 [p] circuits
Majority is incompressible by AC 0 [p] circuits Igor Carboni Oliveira Columbia University Joint work with Rahul Santhanam (Univ. Edinburgh) 1 Part 1 Background, Examples, and Motivation 2 Basic Definitions
More informationComplexity, P and NP
Complexity, P and NP EECS 477 Lecture 21, 11/26/2002 Last week Lower bound arguments Information theoretic (12.2) Decision trees (sorting) Adversary arguments (12.3) Maximum of an array Graph connectivity
More informationThe quantum query complexity of read-many formulas
The quantum query complexity of read-many formulas Andrew Childs Waterloo Shelby Kimmel MIT Robin Kothari Waterloo Boolean formulas ^ x 1 x 2 _ x 3 ^ x 1 x 3 A formula is read-once if every input appears
More informationReductions to Graph Isomorphism
Reductions to raph Isomorphism Jacobo Torán Institut für Theoretische Informatik Universität Ulm D-89069 Ulm, ermany jacobo.toran@uni-ulm.de June 13, 2008 Keywords: Computational complexity, reducibilities,
More informationarxiv: v1 [quant-ph] 6 Feb 2013
Exact quantum query complexity of EXACT and THRESHOLD arxiv:302.235v [quant-ph] 6 Feb 203 Andris Ambainis Jānis Iraids Juris Smotrovs University of Latvia, Raiņa bulvāris 9, Riga, LV-586, Latvia February
More informationB(w, z, v 1, v 2, v 3, A(v 1 ), A(v 2 ), A(v 3 )).
Lecture 13 PCP Continued Last time we began the proof of the theorem that PCP(poly, poly) = NEXP. May 13, 2004 Lecturer: Paul Beame Notes: Tian Sang We showed that IMPLICIT-3SAT is NEXP-complete where
More informationCS151 Complexity Theory. Lecture 6 April 19, 2017
CS151 Complexity Theory Lecture 6 Shannon s counting argument frustrating fact: almost all functions require huge circuits Theorem (Shannon): With probability at least 1 o(1), a random function f:{0,1}
More informationLecture 4. 1 Circuit Complexity. Notes on Complexity Theory: Fall 2005 Last updated: September, Jonathan Katz
Notes on Complexity Theory: Fall 2005 Last updated: September, 2005 Jonathan Katz Lecture 4 1 Circuit Complexity Circuits are directed, acyclic graphs where nodes are called gates and edges are called
More information18.5 Crossings and incidences
18.5 Crossings and incidences 257 The celebrated theorem due to P. Turán (1941) states: if a graph G has n vertices and has no k-clique then it has at most (1 1/(k 1)) n 2 /2 edges (see Theorem 4.8). Its
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 informationLecture 12: Lower Bounds for Element-Distinctness and Collision
Quantum Computation (CMU 18-859BB, Fall 015) Lecture 1: Lower Bounds for Element-Distinctness and Collision October 19, 015 Lecturer: John Wright Scribe: Titouan Rigoudy 1 Outline In this lecture, we will:
More informationAlgorithms Design & Analysis. Approximation Algorithm
Algorithms Design & Analysis Approximation Algorithm Recap External memory model Merge sort Distribution sort 2 Today s Topics Hard problem Approximation algorithms Metric traveling salesman problem A
More informationComputational Complexity of Bayesian Networks
Computational Complexity of Bayesian Networks UAI, 2015 Complexity theory Many computations on Bayesian networks are NP-hard Meaning (no more, no less) that we cannot hope for poly time algorithms that
More informationNotes on Computer Theory Last updated: November, Circuits
Notes on Computer Theory Last updated: November, 2015 Circuits Notes by Jonathan Katz, lightly edited by Dov Gordon. 1 Circuits Boolean circuits offer an alternate model of computation: a non-uniform one
More informationCS151 Complexity Theory. Lecture 14 May 17, 2017
CS151 Complexity Theory Lecture 14 May 17, 2017 IP = PSPACE Theorem: (Shamir) IP = PSPACE Note: IP PSPACE enumerate all possible interactions, explicitly calculate acceptance probability interaction extremely
More informationComplexity Theory VU , SS The Polynomial Hierarchy. Reinhard Pichler
Complexity Theory Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 15 May, 2018 Reinhard
More informationOutline. Complexity Theory EXACT TSP. The Class DP. Definition. Problem EXACT TSP. Complexity of EXACT TSP. Proposition VU 181.
Complexity Theory Complexity Theory Outline Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität
More informationarxiv: v1 [quant-ph] 9 Jul 2009
Span-program-based quantum algorithm for evaluating unbalanced formulas Ben W. Reichardt arxiv:0907.622v [quant-ph] 9 Jul 2009 Abstract The formula-evaluation problem is defined recursively. A formula
More informationAdmin NP-COMPLETE PROBLEMS. Run-time analysis. Tractable vs. intractable problems 5/2/13. What is a tractable problem?
Admin Two more assignments No office hours on tomorrow NP-COMPLETE PROBLEMS Run-time analysis Tractable vs. intractable problems We ve spent a lot of time in this class putting algorithms into specific
More informationLecture 4 : Quest for Structure in Counting Problems
CS6840: Advanced Complexity Theory Jan 10, 2012 Lecture 4 : Quest for Structure in Counting Problems Lecturer: Jayalal Sarma M.N. Scribe: Dinesh K. Theme: Between P and PSPACE. Lecture Plan:Counting problems
More informationQuantum walk algorithms
Quantum walk algorithms Andrew Childs Institute for Quantum Computing University of Waterloo 28 September 2011 Randomized algorithms Randomness is an important tool in computer science Black-box problems
More informationCircuits. Lecture 11 Uniform Circuit Complexity
Circuits Lecture 11 Uniform Circuit Complexity 1 Recall 2 Recall Non-uniform complexity 2 Recall Non-uniform complexity P/1 Decidable 2 Recall Non-uniform complexity P/1 Decidable NP P/log NP = P 2 Recall
More informationNP-Completeness I. Lecture Overview Introduction: Reduction and Expressiveness
Lecture 19 NP-Completeness I 19.1 Overview In the past few lectures we have looked at increasingly more expressive problems that we were able to solve using efficient algorithms. In this lecture we introduce
More informationOn the inverse matrix of the Laplacian and all ones matrix
On the inverse matrix of the Laplacian and all ones matrix Sho Suda (Joint work with Michio Seto and Tetsuji Taniguchi) International Christian University JSPS Research Fellow PD November 21, 2012 Sho
More informationComputational Intractability 2010/4/15. Lecture 2
Computational Intractability 2010/4/15 Professor: David Avis Lecture 2 Scribe:Naoki Hatta 1 P and NP 1.1 Definition of P and NP Decision problem it requires yes/no answer. Example: X is a set of strings.
More informationFourier Sampling & Simon s Algorithm
Chapter 4 Fourier Sampling & Simon s Algorithm 4.1 Reversible Computation A quantum circuit acting on n qubits is described by an n n unitary operator U. Since U is unitary, UU = U U = I. This implies
More informationOn the Sensitivity of Cyclically-Invariant Boolean Functions
On the Sensitivity of Cyclically-Invariant Boolean Functions Sourav Charaborty University of Chicago sourav@csuchicagoedu Abstract In this paper we construct a cyclically invariant Boolean function whose
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 information1 Terminology and setup
15-451/651: Design & Analysis of Algorithms August 31, 2017 Lecture #2 last changed: August 29, 2017 In this lecture, we will examine some simple, concrete models of computation, each with a precise definition
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 informationIs Quantum Search Practical?
DARPA Is Quantum Search Practical? George F. Viamontes Igor L. Markov John P. Hayes University of Michigan, EECS Outline Motivation Background Quantum search Practical Requirements Quantum search versus
More informationConcrete models and tight upper/lower bounds
Lecture 3 Concrete models and tight upper/lower bounds 3.1 Overview In this lecture, we will examine some simple, concrete models of computation, each with a precise definition of what counts as a step,
More informationQuantum advantage with shallow circuits. arxiv: Sergey Bravyi (IBM) David Gosset (IBM) Robert Koenig (Munich)
Quantum advantage with shallow circuits arxiv:1704.00690 ergey Bravyi (IBM) David Gosset (IBM) Robert Koenig (Munich) In this talk I will describe a provable, non-oracular, quantum speedup which is attained
More informationLecture Introduction. 2 Brief Recap of Lecture 10. CS-621 Theory Gems October 24, 2012
CS-62 Theory Gems October 24, 202 Lecture Lecturer: Aleksander Mądry Scribes: Carsten Moldenhauer and Robin Scheibler Introduction In Lecture 0, we introduced a fundamental object of spectral graph theory:
More informationLecture 2: November 9
Semidefinite programming and computational aspects of entanglement IHP Fall 017 Lecturer: Aram Harrow Lecture : November 9 Scribe: Anand (Notes available at http://webmitedu/aram/www/teaching/sdphtml)
More informationQuantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 11: From random walk to quantum walk
Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 11: From random walk to quantum walk We now turn to a second major topic in quantum algorithms, the concept
More informationP, NP, NP-Complete, and NPhard
P, NP, NP-Complete, and NPhard Problems Zhenjiang Li 21/09/2011 Outline Algorithm time complicity P and NP problems NP-Complete and NP-Hard problems Algorithm time complicity Outline What is this course
More informationPolynomials, quantum query complexity, and Grothendieck s inequality
Polynomials, quantum query complexity, and Grothendieck s inequality Scott Aaronson 1, Andris Ambainis 2, Jānis Iraids 2, Martins Kokainis 2, Juris Smotrovs 2 1 Computer Science and Artificial Intelligence
More informationCS 301: Complexity of Algorithms (Term I 2008) Alex Tiskin Harald Räcke. Hamiltonian Cycle. 8.5 Sequencing Problems. Directed Hamiltonian Cycle
8.5 Sequencing Problems Basic genres. Packing problems: SET-PACKING, INDEPENDENT SET. Covering problems: SET-COVER, VERTEX-COVER. Constraint satisfaction problems: SAT, 3-SAT. Sequencing problems: HAMILTONIAN-CYCLE,
More information2.2 Asymptotic Order of Growth. definitions and notation (2.2) examples (2.4) properties (2.2)
2.2 Asymptotic Order of Growth definitions and notation (2.2) examples (2.4) properties (2.2) Asymptotic Order of Growth Upper bounds. T(n) is O(f(n)) if there exist constants c > 0 and n 0 0 such that
More informationAn exponential separation between quantum and classical one-way communication complexity
An exponential separation between quantum and classical one-way communication complexity Ashley Montanaro Centre for Quantum Information and Foundations, Department of Applied Mathematics and Theoretical
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 informationLecture 7: More Arithmetic and Fun With Primes
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Advanced Course on Computational Complexity Lecture 7: More Arithmetic and Fun With Primes David Mix Barrington and Alexis Maciel July
More informationA Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity
Electronic Colloquium on Computational Complexity, Report No. 27 (2014) A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity Krišjānis Prūsis and Andris Ambainis
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 informationLecture 21: Quantum communication complexity
CPSC 519/619: Quantum Computation John Watrous, University of Calgary Lecture 21: Quantum communication complexity April 6, 2006 In this lecture we will discuss how quantum information can allow for a
More informationHow Low Can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions?
How Low Can Approximate Degree and Quantum Query Complexity be for Total Boolean Functions? Andris Ambainis Ronald de Wolf Abstract It has long been known that any Boolean function that depends on n input
More informationFourier analysis of boolean functions in quantum computation
Fourier analysis of boolean functions in quantum computation Ashley Montanaro Centre for Quantum Information and Foundations, Department of Applied Mathematics and Theoretical Physics, University of Cambridge
More informationOn the tightness of the Buhrman-Cleve-Wigderson simulation
On the tightness of the Buhrman-Cleve-Wigderson simulation Shengyu Zhang Department of Computer Science and Engineering, The Chinese University of Hong Kong. syzhang@cse.cuhk.edu.hk Abstract. Buhrman,
More informationSorting algorithms. Sorting algorithms
Properties of sorting algorithms A sorting algorithm is Comparison based If it works by pairwise key comparisons. In place If only a constant number of elements of the input array are ever stored outside
More informationQuantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 1: Quantum circuits and the abelian QFT
Quantum algorithms (CO 78, Winter 008) Prof. Andrew Childs, University of Waterloo LECTURE : Quantum circuits and the abelian QFT This is a course on quantum algorithms. It is intended for graduate students
More informationCOMP Analysis of Algorithms & Data Structures
COMP 3170 - Analysis of Algorithms & Data Structures Shahin Kamali Computational Complexity CLRS 34.1-34.4 University of Manitoba COMP 3170 - Analysis of Algorithms & Data Structures 1 / 50 Polynomial
More informationAn Introduction to Quantum Information and Applications
An Introduction to Quantum Information and Applications Iordanis Kerenidis CNRS LIAFA-Univ Paris-Diderot Quantum information and computation Quantum information and computation How is information encoded
More informationC/CS/Phys C191 Quantum Gates, Universality and Solovay-Kitaev 9/25/07 Fall 2007 Lecture 9
C/CS/Phys C191 Quantum Gates, Universality and Solovay-Kitaev 9/25/07 Fall 2007 Lecture 9 1 Readings Benenti, Casati, and Strini: Quantum Gates Ch. 3.2-3.4 Universality Ch. 3.5-3.6 2 Quantum Gates Continuing
More informationCS 583: Algorithms. NP Completeness Ch 34. Intractability
CS 583: Algorithms NP Completeness Ch 34 Intractability Some problems are intractable: as they grow large, we are unable to solve them in reasonable time What constitutes reasonable time? Standard working
More informationCS 350 Algorithms and Complexity
1 CS 350 Algorithms and Complexity Fall 2015 Lecture 15: Limitations of Algorithmic Power Introduction to complexity theory Andrew P. Black Department of Computer Science Portland State University Lower
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 informationA better lower bound for quantum algorithms searching an ordered list
A better lower bound for quantum algorithms searching an ordered list Andris Ambainis Computer Science Division University of California Berkeley, CA 94720, e-mail: ambainis@cs.berkeley.edu Abstract We
More informationMore advanced codes 0 1 ( , 1 1 (
p. 1/24 More advanced codes The Shor code was the first general-purpose quantum error-correcting code, but since then many others have been discovered. An important example, discovered independently of
More informationPh 219b/CS 219b. Exercises Due: Wednesday 4 December 2013
1 Ph 219b/CS 219b Exercises Due: Wednesday 4 December 2013 4.1 The peak in the Fourier transform In the period finding algorithm we prepared the periodic state A 1 1 x 0 + jr, (1) A j=0 where A is the
More informationCS Foundations of Communication Complexity
CS 49 - Foundations of Communication Complexity Lecturer: Toniann Pitassi 1 The Discrepancy Method Cont d In the previous lecture we ve outlined the discrepancy method, which is a method for getting lower
More informationSome Depth Two (and Three) Threshold Circuit Lower Bounds. Ryan Williams Stanford Joint work with Daniel Kane (UCSD)
Some Depth Two (and Three) Threshold Circuit Lower Bounds Ryan Williams Stanford Joint wor with Daniel Kane (UCSD) Introduction Def. f n : 0,1 n 0,1 is a linear threshold function (LTF) if there are w
More information