Show simple item record

dc.contributor.authorHornby, Taylor 16:57:55 (GMT) 16:57:55 (GMT)
dc.description.abstractThis thesis contributes to the study of parallel repetition theorems and concentration bounds for nonlocal games and quantum interactive proofs. We make the following contributions: - A lemma that is useful for converting parallel repetition theorems (bounds on the probability of winning all instances of a nonlocal game which is being repeated in parallel) into concentration bounds (bounds on winning a certain fraction of the instances). - Exponentially-decaying concentration bounds for two-player games on the uniform distribution and k-player free games, against quantum strategies. - A proof that given a quantum interactive proof system with parameters α (the probability with which the verifier can be convinced to accept when they should accept) and β (the soundness error), as long as α > β, both the soundness error and completeness error can be reduced exponentially by repeating the protocol in parallel and requiring an (α + β)/2 fraction of the repetitions to be won. Our result requires a log-factor more repetitions than are necessary in the classical case.en
dc.publisherUniversity of Waterlooen
dc.subjectquantum informationen
dc.subjectparallel repetitionen
dc.subjectnonlocal gamesen
dc.subjectinteractive proofsen
dc.subjectconcentration boundsen
dc.titleConcentration Bounds from Parallel Repetition Theoremsen
dc.typeMaster Thesisen
dc.pendingfalse R. Cheriton School of Computer Scienceen Science (Quantum Information)en of Waterlooen
uws-etd.degreeMaster of Mathematicsen
uws.contributor.advisorWatrous, John
uws.contributor.affiliation1Faculty of Mathematicsen

Files in this item


This item appears in the following Collection(s)

Show simple item record


University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages