Master’s Thesis Presentation • Quantum Computing — A Study of One-turn Quantum Refereed GamesExport this event to calendar

Monday, June 29, 2020 — 10:00 AM EDT

Please note: This master’s thesis presentation will be given online.

Soumik Ghosh, Master’s candidate
David R. Cheriton School of Computer Science

This thesis studies one-turn quantum refereed games, which are abstract zero-sum games with two competing computationally unbounded quantum provers and a computationally bounded quantum referee. The provers send quantum states to the referee, who plugs the two states into his quantum circuit, measures the output of the circuit in the standard basis, and declares one of the two players as the winner depending on the outcome of the measurement. The complexity class $\class{QRG(1)}$ comprises of those promise problems for which there exists a one-turn quantum refereed game such that one of the players wins with high probability for the yes-instances, and the other player wins with high probability for the no-instances, irrespective of the opponent’s strategy. $\class{QRG(1)}$ is a generalization of $\class{QMA}$ (or $\class{co-QMA}$), and can informally be viewed as $\class{QMA}$ with a no-prover (or $\class{co-QMA}$ with a yes-prover).

We have given a full characterization of $\class{QRG(1)}$, starting with appropriate definitions and known results, and building on to two new results about this class. Previously, the best known upper bound on $\class{QRG(1)}$ was $\class{PSPACE}$. We have proved that if one of the provers is completely classical, sending a classical probability distribution instead of a quantum state, the new class, which we name $\class{CQRG(1)}$, is contained in $\exists \cdot \class{PP}$ (non-deterministic polynomial-time operator applied to the class $\class{PP}$). We have also defined another restricted version of $\class{QRG(1)}$ where both provers send quantum states, but the referee measures one of the quantum states first, and plugs the classical outcome into the measurement, along with the other prover’s quantum state, into a quantum circuit, before measuring the output of the quantum circuit in the standard basis. The new class, which we name $\class{MQRG(1)}$, is contained in $\class{P}\cdot\class{PP}$ (the probabilistic polynomial time operator applied to $\class{PP}$). $\exists \cdot \class{PP}$ is contained in $\class{P} \cdot \class{PP}$, which is, in turn, contained in $\class{PSPACE}$. Hence, our results give better containments than $\class{PSPACE}$ for restricted versions of $\class{QRG(1)}$.

Location 
Online presentation
200 University Avenue West

Waterloo, ON N2L 3G1
Canada

S M T W T F S
26
27
28
29
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
3
4
5
  1. 2020 (149)
    1. September (1)
    2. August (14)
    3. July (14)
    4. June (19)
    5. May (17)
    6. April (20)
    7. March (17)
    8. February (25)
    9. January (22)
  2. 2019 (255)
    1. December (21)
    2. November (25)
    3. October (16)
    4. September (20)
    5. August (18)
    6. July (12)
    7. June (23)
    8. May (23)
    9. April (32)
    10. March (25)
    11. February (16)
    12. January (24)
  3. 2018 (220)
  4. 2017 (36)
  5. 2016 (21)
  6. 2015 (36)
  7. 2014 (33)
  8. 2013 (23)
  9. 2012 (4)
  10. 2011 (1)
  11. 2010 (1)
  12. 2009 (1)
  13. 2008 (1)