Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

ACM SIGACT News

Guest column: parallel repetition theorems for interactive arguments

Kai-Min Chung, Rafael Pass

Published Mar 6, 2013• 1 citation
Publisher

Abstract

We survey recent results on parallel repetition theorems for computationally-sound interactive proofs (a.k.a. interactive arguments).
DOI
10.1145/2447712.2447731

Related papers

A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments.

Itay Berman, Iftach Haitner, Eliad Tsfadia

Electronic colloquium on computational complexity•Jan 1, 2019•1 citation

On Parallel Repetition of Interactive Proof Systems

Oded Goldreich

Lecture notes in computer science•Jan 1, 2025•1 citation

A Parallel Repetition Theorem for the GHZ Game: A Simpler Proof.

Uma Girish, Justin Holmgren, Kunal Mittal +2 more

Electronic colloquium on computational complexity•Jan 1, 2021•0 citations

Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems

Richard Cleve, William Slofstra, Falk Unger +1 more

arXiv:quant-ph/0608146•Computational Complexity•Apr 29, 2008•116 citations

A K-Provers Parallel Repetition Theorem for a Version of No-Signaling Model

Ricky Rosen

Lecture notes in computer science•Jan 1, 2010•4 citations

Strong Parallel Repetition Theorem for Free Projection Games

Boaz Barak, Anup Rao, Ran Raz +2 more

Lecture notes in computer science•Jan 1, 2009•28 citations