NDLI: A parallel repetition theorem for entangled projection games

Please wait, while we are loading the content...

A parallel repetition theorem for entangled projection games

Content Provider	Springer Nature Link
Author	Steurer, David Vidick, Thomas Dinur, Irit
Copyright Year	2015
Abstract	We study the behavior of the entangled value of two-player one-round projection games under parallel repetition. We show that for any projection game G of entangled value $${1- \epsilon < 1}$$ , the value of the k-fold repetition of G goes to zero as $${O((1-\epsilon^c)^k)}$$ , for some universal constant $${c \geq 1}$$ . If furthermore the constraint graph of G is expanding, we obtain the optimal c = 1. Previously exponential decay of the entangled value under parallel repetition was only known for the case of XOR and unique games. To prove the theorem, we extend an analytical framework introduced by Dinur and Steurer for the study of the classical value of projection games under parallel repetition. Our proof, as theirs, relies on the introduction of a simple relaxation of the entangled value that is perfectly multiplicative. The main technical component of the proof consists in showing that the relaxed value remains tightly connected to the entangled value, thereby establishing the parallel repetition theorem. More generally, we obtain results on the behavior of the entangled value under products of arbitrary (not necessarily identical) projection games.Relating our relaxed value to the entangled value is done by giving an algorithm for converting a relaxed variant of quantum strategies that we call “vector quantum strategy” to a quantum strategy. The algorithm is considerably simpler in case the bipartite distribution of questions in the game has good expansion properties. When this is not the case, the algorithm relies on a quantum analogue of Holenstein’s correlated sampling lemma which may be of independent interest. Our “quantum correlated sampling lemma” generalizes results of van Dam and Hayden on universal embezzlement to the following approximate scenario: two non-communicating parties, given classical descriptions of bipartite states $${\|{\psi}\rangle, \|{\varphi}\rangle}$$ , respectively, such that $${\|{\psi}\rangle \approx \|{\varphi}\rangle}$$ , are able to locally generate a joint entangled state $${\|{\Psi}\rangle \approx \|{\psi}\rangle \approx \|{\varphi}\rangle}$$ using an initial entangled state that is independent of their inputs.
Ending Page	254
Page Count	54
Starting Page	201
File Format	PDF
ISSN	10163328
e-ISSN	14208954
Journal	Computational complexity
Issue Number	2
Volume Number	24
Language	English
Publisher	Springer Basel
Publisher Date	2015-05-19
Publisher Place	Basel
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Parallel repetition Computational Mathematics and Numerical Analysis projection games embezzlement Quantum algorithms and complexity entangled games correlated sampling Algorithm Analysis and Problem Complexity
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Computational Theory and Mathematics Computational Mathematics

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems

Rank-one quantum games

A Parallel Repetition Theorem for Entangled Projection Games

A parallel repetition theorem for entangled projection games

Quantum Arthur–Merlin games

Spectral Algorithms for Unique Games

Derandomized Parallel Repetition Theorems for Free Games

Multipartite Quantum Correlation and Communication Complexities

Derandomized Parallel Repetition via Structured PCPs

A parallel repetition theorem for entangled projection games

Similar Documents

Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems

Rank-one quantum games

A Parallel Repetition Theorem for Entangled Projection Games

A parallel repetition theorem for entangled projection games

Quantum Arthur–Merlin games

Spectral Algorithms for Unique Games

Derandomized Parallel Repetition Theorems for Free Games

Multipartite Quantum Correlation and Communication Complexities

Derandomized Parallel Repetition via Structured PCPs

A parallel repetition theorem for entangled projection games