DOCSLIB.ORG

Total Functions in QMA

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Total Functions in QMA Total Functions in QMA Serge Massar1 and Miklos Santha2,3 1Laboratoire d’Information Quantique CP224, Université libre de Bruxelles, B-1050 Brussels, Belgium. 2CNRS, IRIF, Université Paris Diderot, 75205 Paris, France. 3Centre for Quantum Technologies & MajuLab, National University of Singapore, Singapore. December 15, 2020 The complexity class QMA is the quan- either output a circuit with length less than `, or tum analog of the classical complexity class output NO if such a circuit does not exist. The NP. The functional analogs of NP and functional analog of P, denoted FP, is the subset QMA, called functional NP (FNP) and of FNP for which the output can be computed in functional QMA (FQMA), consist in ei- polynomial time. ther outputting a (classical or quantum) Total functional NP (TFNP), introduced in witness, or outputting NO if there does [37] and which lies between FP and FNP, is the not exist a witness. The classical com- subset of FNP for which it can be shown that the plexity class Total Functional NP (TFNP) NO outcome never occurs. As an example, factor- is the subset of FNP for which it can be ing (given an integer n, output the prime factors shown that the NO outcome never occurs. of n) lies in TFNP since for all n a (unique) set TFNP includes many natural and impor- of prime factors exists, and it can be verified in tant problems. Here we introduce the polynomial time that the factorisation is correct. complexity class Total Functional QMA TFNP can also be defined as the functional ana- (TFQMA), the quantum analog of TFNP. log of NP ∩ coNP [37]. We show that FQMA and TFQMA can be TFNP contains many natural and impor- defined in such a way that they do not de- tant problems, including factoring, local search pend on the values of the completeness and problems[29, 42, 35], computational versions of soundness probabilities. We provide ex- Brouwer’s fixed point theorem[41] and finding amples of problems that lie in TFQMA, Nash equilibria[22, 17]. Although there proba- coming from areas such as the complex- bly do not exist complete problems for TFNP, ity of k-local Hamiltonians and public key there are many syntactically defined subclasses of quantum money. In the context of black- TFNP that contain complete problems, and for box groups, we note that Group Non- which some of the above natural problems can be Membership, which was known to belong shown to be complete. For recent work in this to QMA, in fact belongs to TFQMA. We direction, see [23]. also provide a simple oracle with respect to The quantum analog of NP is QMA [34]. which we have a separation between FBQP QMA has been extensively studied, and contains and TFQMA. a rich set of complete problems, see e.g. [12]. These complete problems are all promise prob- arXiv:1805.00670v4 [quant-ph] 12 Dec 2020 1 Introduction lems. For instance the most famous one, the k-local Hamiltonian problem, involves a promise Classical complexity classes are generally defined that the ground state energy of the input k-local as consisting of decision problems. But functional Hamiltonian is either less than b or greater than analogs of these classes can also be defined. The a, with a−b = 1/q(n), for some polynomial q(n), functional analog of NP is denoted FNP (Func- and the problem is to determine which is the case. tional NP). As a simple example, the functional Functional QMA, the problem of producing a analog of the travelling salesman problem is the quantum state that serves as witness for a QMA following: given a weighted graph and a length `, problem was first introduced in the unpublished manuscript [28]. For instance the functional ana- Serge Massar: [email protected] log of the k-local Hamiltonian problem is the fol- 1 lowing: given the classical description of a k-local 2 Definitions Hamiltonian, either output a state with energy less than b, or output NO if such a state does not 2.1 QMA exist. We denote by Hn the Hilbert space of n qubits. In [28] it was observed that there is no obvi- For pure states we use the Dirac ket notation ous reduction of FQMA problems to QMA prob- |ψi, whereas for density matrices we just use the lems. This should be opposed to the case of NP Greek letter ρ. We denote by In the identity ma- complete problems for which finding a witness re- trix acting on n qubits. duces to solving the decision problem. We denote by poly the set of all functions It is well known that the definition of QMA f : N → N, where N = {1, 2, ...}, for which does not depend on the values of the complete- there exists a polynomial time deterministic Tur- f(n) n ness and soundness probabilities, as they can be ing machine that outputs 1 on input 1 . Note brought exponentially close to 1 and 0 respec- that if f ∈ poly then there exists a polynomial q tively [34, 36, 40]. We discuss different definitions such that for all n ∈ N, f(n) < q(n). of Functional QMA. We show that with an ap- Computational processes that can be carried propriate definition, based on the notion of eigen- out in polynomial time are sometimes called effi- basis of a quantum verification procedure, one cient. can prove a similar amplification result. These theoretical considerations are the topic of Section Definition 1. Quantum Verification Proce- 2. dure. A quantum verification procedure is a family of polynomial time uniform quantum cir- In Section2 we also introduce the functional cuits Q = {Qn : n ∈ N} with Qn taking as in- class TFQMA (Total Functional QMA) as the put (x, |ψi ⊗ |0k(n)i) where x ∈ {0, 1}n is a bi- subset of FQMA such that only the YES an- nary string of length n, |ψi is a state of m(n) swer of the FQMA problem occurs, i.e. for all qubits, and both m = m(n) and k = k(n) belong classical inputs x there exists a witness. Simi- to poly. The last k qubits, initialized to the state larly to , the problems in are k TFNP TFQMA |0 i, form the ancilla Hilbert space Hk, and the not promise problems, rather they have a struc- m-qubit states |ψi form the witness Hilbert space ture such that one can prove that only the YES Hm. The outcome of the run of Qn is a random answer occurs. bit which is obtained by measuring the first qubit The main aim of the present paper is to show in the computational basis. We denote this out- that TFQMA is an interesting and rich complex- come by Qn(x, |ψi), and we interpret the outcome ity class. In Section3 we provide examples of 1 as accept and the outcome 0 as reject. problems that belong to TFQMA. These are related to problems previously studied in quan- Note that a quantum verification procedure can tum complexity, such as commuting quantum k- of course also take as input a mixed state ρ, rather SAT, commuting k-local Hamiltonian, the Quan- than a pure state |ψi. Mixed states can be writ- tum Lovász Local Lemma (QLLL) [8] and pub- ten as convex combinations of pure states. The lic key quantum money based on knots [20]. We acceptance (rejection) probability for the mixed show how these problems can be adapted to fit state is the convex combination of the acceptance (rejection) probabilities for the constituent pure into the TFQMA framework. Then in Section 4 we consider relativized problems. In the con- states. Abusing slightly the notation, we use text of black-box groups, we show that Group the same notation Qn(x, ρ) for the outcome of Non-Membership, which was known to belong to the quantum verification procedure on the mixed state ρ. QMA [50], in fact belongs to TFQMA. We also exhibit problems based on the Quantum Fourier Definition 2. (a,b)–Quantum Verification Transform (QFT) and provide a simple oracle Procedure. Let q ∈ poly, and let a, b : → with respect to which there is a separation be- N [0, 1] be polynomial time computable functions tween and . FBQP TFQMA which satisfy In the conclusion we present open questions raised by the present work. a(n) − b(n) ≥ 1/q(n) . (1) 2 We say that a quantum verification procedure Q As a consequence the precise values of the is an (a, b)-quantum verification procedure (or bounds a and b are irrelevant. Traditionally they shortly an (a, b)-procedure) if for every x of are taken to be 2/3 and 1/3. We will do here the length n, one of the following holds: same. ∃|ψi : Pr[Qn(x, |ψi) = 1] ≥ a, (2) Definition 4. We define the class QMA as (2/3, 1/3). ∀|ψi : Pr[Qn(x, |ψi) = 1] ≤ b. (3) QMA We call a and b the completeness and soundness We will come back to the QMA amplification probabilities of the quantum verification proce- procedure below. dure. We now turn to a particular kind of (a, b)- procedure which will be our main topic of study: Definition 3. QMA and coQMA. Let a, b be functions as in Definition 2. The class Definition 5. a-Total Quantum Verification QMA(a, b) is the set of languages L ⊆ {0, 1}∗ Procedure. Let a : N → [0, 1] be a polynomially such that there exists an (a, b)-procedure Q, where time computable function. We say that a quan- for every x, we have x ∈ L if and only if Equa- tum verification procedure Q is an a-total quan- tion (2) holds (and consequently, x∈ / L if and tum verification procedure (or shortly an a-total only if Equation (3) holds).
Load more

Recommended publications
  • LSPACE VS NP IS AS HARD AS P VS NP 1. Introduction in Complexity
    LSPACE VS NP IS AS HARD AS P VS NP FRANK VEGA Abstract. The P versus NP problem is a major unsolved problem in com- puter science. This consists in knowing the answer of the following question: Is P equal to NP? Another major complexity classes are LSPACE, PSPACE, ESPACE, E and EXP. Whether LSPACE = P is a fundamental question that it is as important as it is unresolved. We show if P = NP, then LSPACE = NP. Consequently, if LSPACE is not equal to NP, then P is not equal to NP. According to Lance Fortnow, it seems that LSPACE versus NP is easier to be proven. However, with this proof we show this problem is as hard as P versus NP. Moreover, we prove the complexity class P is not equal to PSPACE as a direct consequence of this result. Furthermore, we demonstrate if PSPACE is not equal to EXP, then P is not equal to NP. In addition, if E = ESPACE, then P is not equal to NP. 1. Introduction In complexity theory, a function problem is a computational problem where a single output is expected for every input, but the output is more complex than that of a decision problem [6]. A functional problem F is defined as a binary relation (x; y) 2 R over strings of an arbitrary alphabet Σ: R ⊂ Σ∗ × Σ∗: A Turing machine M solves F if for every input x such that there exists a y satisfying (x; y) 2 R, M produces one such y, that is M(x) = y [6].
    [Show full text]
  • The Classes FNP and TFNP
    Outline The classes FNP and TFNP C. Wilson1 1Lane Department of Computer Science and Electrical Engineering West Virginia University Christopher Wilson Function Problems Outline Outline 1 Function Problems defined What are Function Problems? FSAT Defined TSP Defined 2 Relationship between Function and Decision Problems RL Defined Reductions between Function Problems 3 Total Functions Defined Total Functions Defined FACTORING HAPPYNET ANOTHER HAMILTON CYCLE Christopher Wilson Function Problems Outline Outline 1 Function Problems defined What are Function Problems? FSAT Defined TSP Defined 2 Relationship between Function and Decision Problems RL Defined Reductions between Function Problems 3 Total Functions Defined Total Functions Defined FACTORING HAPPYNET ANOTHER HAMILTON CYCLE Christopher Wilson Function Problems Outline Outline 1 Function Problems defined What are Function Problems? FSAT Defined TSP Defined 2 Relationship between Function and Decision Problems RL Defined Reductions between Function Problems 3 Total Functions Defined Total Functions Defined FACTORING HAPPYNET ANOTHER HAMILTON CYCLE Christopher Wilson Function Problems Function Problems What are Function Problems? Function Problems FSAT Defined Total Functions TSP Defined Outline 1 Function Problems defined What are Function Problems? FSAT Defined TSP Defined 2 Relationship between Function and Decision Problems RL Defined Reductions between Function Problems 3 Total Functions Defined Total Functions Defined FACTORING HAPPYNET ANOTHER HAMILTON CYCLE Christopher Wilson Function Problems Function
    [Show full text]
  • Lecture: Complexity of Finding a Nash Equilibrium 1 Computational
    Algorithmic Game Theory Lecture Date: September 20, 2011 Lecture: Complexity of Finding a Nash Equilibrium Lecturer: Christos Papadimitriou Scribe: Miklos Racz, Yan Yang In this lecture we are going to talk about the complexity of finding a Nash Equilibrium. In particular, the class of problems NP is introduced and several important subclasses are identified. Most importantly, we are going to prove that finding a Nash equilibrium is PPAD-complete (defined in Section 2). For an expository article on the topic, see [4], and for a more detailed account, see [5]. 1 Computational complexity For us the best way to think about computational complexity is that it is about search problems.Thetwo most important classes of search problems are P and NP. 1.1 The complexity class NP NP stands for non-deterministic polynomial. It is a class of problems that are at the core of complexity theory. The classical definition is in terms of yes-no problems; here, we are concerned with the search problem form of the definition. Definition 1 (Complexity class NP). The class of all search problems. A search problem A is a binary predicate A(x, y) that is efficiently (in polynomial time) computable and balanced (the length of x and y do not differ exponentially). Intuitively, x is an instance of the problem and y is a solution. The search problem for A is this: “Given x,findy such that A(x, y), or if no such y exists, say “no”.” The class of all search problems is called NP. Examples of NP problems include the following two.
    [Show full text]
  • The Relative Complexity of NP Search Problems
    Journal of Computer and System Sciences 57, 319 (1998) Article No. SS981575 The Relative Complexity of NP Search Problems Paul Beame* Computer Science and Engineering, University of Washington, Box 352350, Seattle, Washington 98195-2350 E-mail: beameÄcs.washington.edu Stephen Cook- Computer Science Department, University of Toronto, Canada M5S 3G4 E-mail: sacookÄcs.toronto.edu Jeff Edmonds Department of Computer Science, York University, Toronto, Ontario, Canada M3J 1P3 E-mail: jeffÄcs.yorku.ca Russell Impagliazzo9 Computer Science and Engineering, UC, San Diego, 9500 Gilman Drive, La Jolla, California 92093-0114 E-mail: russellÄcs.ucsd.edu and Toniann PitassiÄ Department of Computer Science, University of Arizona, Tucson, Arizona 85721-0077 E-mail: toniÄcs.arizona.edu Received January 1998 1. INTRODUCTION Papadimitriou introduced several classes of NP search problems based on combinatorial principles which guarantee the existence of In the study of computational complexity, there are many solutions to the problems. Many interesting search problems not known to be solvable in polynomial time are contained in these classes, problems that are naturally expressed as problems ``to find'' and a number of them are complete problems. We consider the question but are converted into decision problems to fit into standard of the relative complexity of these search problem classes. We prove complexity classes. For example, a more natural problem several separations which show that in a generic relativized world the than determining whether or not a graph is 3-colorable search classes are distinct and there is a standard search problem in might be that of finding a 3-coloring of the graph if it exists.
    [Show full text]
  • Total Functions in the Polynomial Hierarchy 11
    Electronic Colloquium on Computational Complexity, Report No. 153 (2020) TOTAL FUNCTIONS IN THE POLYNOMIAL HIERARCHY ROBERT KLEINBERG∗, DANIEL MITROPOLSKYy, AND CHRISTOS PAPADIMITRIOUy Abstract. We identify several genres of search problems beyond NP for which existence of solutions is guaranteed. One class that seems especially rich in such problems is PEPP (for “polynomial empty pigeonhole principle”), which includes problems related to existence theorems proved through the union bound, such as finding a bit string that is far from all codewords, finding an explicit rigid matrix, as well as a problem we call Complexity, capturing Complexity Theory’s quest. When the union bound is generous, in that solutions constitute at least a polynomial fraction of the domain, we have a family of seemingly weaker classes α-PEPP, which are inside FPNPjpoly. Higher in the hierarchy, we identify the constructive version of the Sauer- Shelah lemma and the appropriate generalization of PPP that contains it. The resulting total function hierarchy turns out to be more stable than the polynomial hierarchy: it is known that, under oracles, total functions within FNP may be easy, but total functions a level higher may still be harder than FPNP. 1. Introduction The complexity of total functions has emerged over the past three decades as an intriguing and productive branch of Complexity Theory. Subclasses of TFNP, the set of all total functions in FNP, have been defined and studied: PLS, PPP, PPA, PPAD, PPADS, and CLS. These classes are replete with natural problems, several of which turned out to be complete for the corresponding class, see e.g.
    [Show full text]
  • Optimisation Function Problems FNP and FP
    Complexity Theory 99 Complexity Theory 100 Optimisation The Travelling Salesman Problem was originally conceived of as an This is still reasonable, as we are establishing the difficulty of the optimisation problem problems. to find a minimum cost tour. A polynomial time solution to the optimisation version would give We forced it into the mould of a decision problem { TSP { in order a polynomial time solution to the decision problem. to fit it into our theory of NP-completeness. Also, a polynomial time solution to the decision problem would allow a polynomial time algorithm for finding the optimal value, CLIQUE Similar arguments can be made about the problems and using binary search, if necessary. IND. Anuj Dawar May 21, 2007 Anuj Dawar May 21, 2007 Complexity Theory 101 Complexity Theory 102 Function Problems FNP and FP Still, there is something interesting to be said for function problems A function which, for any given Boolean expression φ, gives a arising from NP problems. satisfying truth assignment if φ is satisfiable, and returns \no" Suppose otherwise, is a witness function for SAT. L = fx j 9yR(x; y)g If any witness function for SAT is computable in polynomial time, where R is a polynomially-balanced, polynomial time decidable then P = NP. relation. If P = NP, then for every language in NP, some witness function is A witness function for L is any function f such that: computable in polynomial time, by a binary search algorithm. • if x 2 L, then f(x) = y for some y such that R(x; y); P = NP if, and only if, FNP = FP • f(x) = \no" otherwise.
    [Show full text]
  • Computational Complexity; Slides 9, HT 2019 NP Search Problems, and Total Search Problems
    Computational Complexity; slides 9, HT 2019 NP search problems, and total search problems Prof. Paul W. Goldberg (Dept. of Computer Science, University of Oxford) HT 2019 Paul Goldberg NP search problems, and total search problems 1 / 21 Examples of total search problems in NP FACTORING NASH: the problem of computing a Nash equilibrium of a game (comes in many versions depending on the structure of the game) PIGEONHOLE CIRCUIT: Input: a boolean circuit with n input gates and n output gates Output: either input vector x mapping to 0 or vectors x, x0 mapping to the same output NECKLACE SPLITTING SECOND HAMILTONIAN CYCLE (in 3-regular graph) HAM SANDWICH: search for ham sandwich cut Search for local optima in settings with neighbourhood structure The above seem to be hard. (of course, many search probs are in P, e.g. input a list L of numbers, output L in increasing order) Paul Goldberg NP search problems, and total search problems 2 / 21 Search problems as poly-time checkable relations NP search problem is modelled as a relation R(·; ·) where R(x; y) is checkable in time polynomial in jxj, jyj input x, find y with R(x; y)( y as certificate) total search problem: 8x9y (jyj = poly(jxj); R(x; y)) SAT: x is boolean formula, y is satisfying bit vector. Decision version of SAT is polynomial-time equivalent to search for y. FACTORING: input (the \x" in R(x; y)) is number N, output (the \y") is prime factorisation of N. No decision problem! NECKLACE SPLITTING (k thieves): input is string of n beads in c colours; output is a decomposition into c(k − 1) + 1 substrings and allocation of substrings to thieves such that they all get the same number of beads of each colour.
    [Show full text]
  • On Total Functions, Existence Theorems and Computational Complexity
    Theoretical Computer Science 81 (1991) 317-324 Elsevier Note On total functions, existence theorems and computational complexity Nimrod Megiddo IBM Almaden Research Center, 650 Harry Road, Sun Jose, CA 95120-6099, USA, and School of Mathematical Sciences, Tel Aviv University, Tel Aviv, Israel Christos H. Papadimitriou* Computer Technology Institute, Patras, Greece, and University of California at Sun Diego, CA, USA Communicated by M. Nivat Received October 1989 Abstract Megiddo, N. and C.H. Papadimitriou, On total functions, existence theorems and computational complexity (Note), Theoretical Computer Science 81 (1991) 317-324. wondeterministic multivalued functions with values that are polynomially verifiable and guaran- teed to exist form an interesting complexity class between P and NP. We show that this class, which we call TFNP, contains a host of important problems, whose membership in P is currently not known. These include, besides factoring, local optimization, Brouwer's fixed points, a computa- tional version of Sperner's Lemma, bimatrix equilibria in games, and linear complementarity for P-matrices. 1. The class TFNP Let 2 be an alphabet with two or more symbols, and suppose that R G E*x 2" is a polynomial-time recognizable relation which is polynomially balanced, that is, (x,y) E R implies that lyl sp(lx()for some polynomial p. * Research supported by an ESPRIT Basic Research Project, a grant to the Universities of Patras and Bonn by the Volkswagen Foundation, and an NSF Grant. Research partially performed while the author was visiting the IBM Almaden Research Center. 0304-3975/91/$03.50 @ 1991-Elsevier Science Publishers B.V.
    [Show full text]
  • The Existence of One-Way Functions Frank Vega
    The Existence of One-Way Functions Frank Vega To cite this version: Frank Vega. The Existence of One-Way Functions. 2014. hal-01020088v2 HAL Id: hal-01020088 https://hal.archives-ouvertes.fr/hal-01020088v2 Preprint submitted on 8 Jul 2014 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. THE EXISTENCE OF ONE-WAY FUNCTIONS FRANK VEGA Abstract. We assume there are one-way functions and obtain a contradiction following a solid argumentation, and therefore, one-way functions do not exist applying the reductio ad absurdum method. Indeed, for every language L that is in EXP and not in P , we show that any configuration, which belongs to the accepting computation of x 2 L and is at most polynomially longer or shorter than x, has always a non-polynomial time algorithm that find it from the initial or the acceptance configuration on a deterministic Turing Machine which decides L and has always a string in the acceptance computation that is at most polynomially longer or shorter than the input x 2 L. Next, we prove the existence of one-way functions contradicts this fact, and thus, they should not exist.
    [Show full text]
  • A Tour of the Complexity Classes Between P and NP
    A Tour of the Complexity Classes Between P and NP John Fearnley University of Liverpool Joint work with Spencer Gordon, Ruta Mehta, Rahul Savani Simple stochastic games T A two player game I Maximizer (box) wants to reach T I Minimizer (triangle) who wants to avoid T I Nature (circle) plays uniformly at random Simple stochastic games 0.5 1 1 0.5 0.5 0 Value of a vertex: I The largest probability of winning that max can ensure I The smallest probability of winning that min can ensure Computational Problem: find the value of each vertex Simple stochastic games 0.5 1 1 0.5 0.5 0 Is the problem I Easy? Does it have a polynomial time algorithm? I Hard? Perhaps no such algorithm exists This is currently unresolved Simple stochastic games 0.5 1 1 0.5 0.5 0 The problem lies in NP \ co-NP I So it is unlikely to be NP-hard But there are a lot of NP-intermediate classes... This talk: whare are these complexity classes? Simple stochastic games Solving a simple-stochastic game lies in NP \ co-NP \ UP \ co-UP \ TFNP \ PPP \ PPA \ PPAD \ PLS \ CLS \ EOPL \ UEOPL Simple stochastic games Solving a simple-stochastic game lies in NP \ co-NP \ UP \ co-UP \ TFNP \ PPP \ PPA \ PPAD \ PLS \ CLS \ EOPL \ UEOPL This talk: whare are these complexity classes? TFNP PPAD PLS CLS Complexity classes between P and NP NP P There are many problems that lie between P and NP I Factoring, graph isomorphism, computing Nash equilibria, local max cut, simple-stochastic games, ..
    [Show full text]
  • Lecture 5: PPAD and Friends 1 Introduction 2 Reductions
    CS 354: Unfulfilled Algorithmic Fantasies April 15, 2019 Lecture 5: PPAD and friends Lecturer: Aviad Rubinstein Scribe: Jeffrey Gu 1 Introduction Last week, we saw query complexity and communication complexity, which are nice because you can prove lower bounds but have the drawback that the complexity is bounded by the size of the instance. Starting from this lecture, we'll start covering computational complexity and conditional hardness. 2 Reductions The main tool for proving conditional hardness are reductions. For decision problems, reductions can be thought of as functions between two problems that map yes instances to yes instances and no instances to no instances: To put it succinct, \yes maps to yes" and \no maps to no". As we'll see, this notion of reduction breaks down for problems that have only \yes" instances, such as the problem of finding a Nash Equilibrium. Nash proved that a Nash Equilibrium always exists, so the Nash Equilibrium and the related 휖-Nash Equilibrium only have \yes" instances. Now suppose that we wanted to show that Nash Equilibrium is a hard problem. It doesn't make sense to reduce from a decision problem such as 3-SAT, because a decision problem has \no" instances. Now suppose we tried to reduce from another problem with only \yes" instances, such as the End-of-a-Line problem that we've seen before (and define below), as in the above definition of reduction: 1 For example f may map an instance (S; P ) of End-of-a-Line to an instance f(S; P ) = (A; B) of Nash equilibrium.
    [Show full text]
  • 4.1 Introduction 4.2 NP And
    601.436/636 Algorithmic Game Theory Lecturer: Michael Dinitz Topic: Hardness of Computing Nash Equilibria Date: 2/6/20 Scribe: Michael Dinitz 4.1 Introduction Last class we saw an exponential time algorithm (Lemke-Howson) for computing a Nash equilibrium of a bimatrix game. Today we're going to argue that we can't really expect a polynomial-time algorithm for computing Nash, even for the special case of two-player games (even though for two- player zero-sum we saw that there is such an algorithm). Formally proving this was an enormous accomplishment in complexity theory, which we're not going to do (but might be a cool final project!). Instead, I'm going to try to give a high-level point of view of what the result actually says, and not dive too deeply into how to prove it. Today's lecture is pretty complexity-theoretic, so if you haven't seen much complexity theory before, feel free to jump in with questions. The main problem we're going to be analyzing is what I'll call Two-Player Nash: given a bimatrix game, compute a Nash equilibrium. Clearly this is a special case of the more general problem of Nash: given a simultaneous one-shot game, compute a Nash equilibrium. So if we can prove that Two-Player Nash is hard, then so is Nash. 4.2 NP and FNP As we all know, the most common way of proving that a problem is \unlikely" to have a polynomial- time algorithm is to prove that it is NP-hard.
    [Show full text]