A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-Kilian

Authors Dana Moshkovitz, Govind Ramnarayan, Henry Yuen

Thumbnail PDF


  • Filesize: 0.66 MB
  • 29 pages

Document Identifiers

Author Details

Dana Moshkovitz
Govind Ramnarayan
Henry Yuen

Cite AsGet BibTex

Dana Moshkovitz, Govind Ramnarayan, and Henry Yuen. A No-Go Theorem for Derandomized Parallel Repetition: Beyond Feige-Kilian. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 60, pp. 42:1-42:29, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)


In this work we show a barrier towards proving a randomness-efficient parallel repetition, a promising avenue for achieving many tight inapproximability results. Feige and Kilian (STOC'95) proved an impossibility result for randomness-efficient parallel repetition for two prover games with small degree, i.e., when each prover has only few possibilities for the question of the other prover. In recent years, there have been indications that randomness-efficient parallel repetition (also called derandomized parallel repetition) might be possible for games with large degree, circumventing the impossibility result of Feige and Kilian. In particular, Dinur and Meir (CCC'11) construct games with large degree whose repetition can be derandomized using a theorem of Impagliazzo, Kabanets and Wigderson (SICOMP'12). However, obtaining derandomized parallel repetition theorems that would yield optimal inapproximability results has remained elusive. This paper presents an explanation for the current impasse in progress, by proving a limitation on derandomized parallel repetition. We formalize two properties which we call "fortification-friendliness" and "yields robust embeddings". We show that any proof of derandomized parallel repetition achieving almost-linear blow-up cannot both (a) be fortification-friendly and (b) yield robust embeddings. Unlike Feige and Kilian, we do not require the small degree assumption. Given that virtually all existing proofs of parallel repetition, including the derandomized parallel repetition result of Dinur and Meir, share these two properties, our no-go theorem highlights a major barrier to achieving almost-linear derandomized parallel repetition.
  • Derandomization
  • parallel repetition
  • Feige-Killian
  • fortification


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. L. Babai, L. Fortnow, and C. Lund. Nondeterministic exponential time has two-prover interactive protocols. In Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on, pages 16-25. IEEE, 1990. Google Scholar
  2. M. Bellare, S. Goldwasser, C. Lund, and A. Russell. Efficient probabilistically checkable proofs and applications to approximations. In Proc. 25th ACM Symp. on Theory of Computing, pages 294-304, 1993. Google Scholar
  3. M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Multi-prover interactive proofs: How to remove intractability assumptions. In Proceedings of the twentieth annual ACM symposium on Theory of computing, pages 113-131. ACM, 1988. Google Scholar
  4. M. Ben-Or, S. Goldwasser, J. Kilian, and A. Wigderson. Efficient identification schemes using two prover interactive proofs. In Advances in Cryptology - CRYPTO’89 Proceedings, pages 498-506. Springer, 1990. Google Scholar
  5. A. Bhangale, R. Saptharishi, G. Varma, and R. Venkat. On fortification of projection games. arXiv, 2015. URL: http://arxiv.org/abs/1504.05556.
  6. Andrej Bogdanov. Gap amplification fails below 1/2, 2005. Comment on ECCC TR05-046, can be found at URL: http://eccc.uni-trier.de/eccc-reports/2005/TR05-046/commt01.pdf.
  7. M. Braverman and A. Garg. Small value parallel repetition for general games. In Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, pages 335-340. ACM, 2015. Google Scholar
  8. R. Cleve, P. Høyer, B. Toner, and J. Watrous. Consequences and limits of nonlocal strategies. In Computational Complexity, 2004. Proceedings. 19th IEEE Annual Conference on, pages 236-249. IEEE, 2004. Google Scholar
  9. I. Dinur. The PCP theorem by gap amplification. Journal of the ACM, 54(3):12, 2007. Google Scholar
  10. I. Dinur and O. Meir. Derandomized parallel repetition via structured PCPs. Computational Complexity, 20(2):207-327, 2011. Google Scholar
  11. I. Dinur and D. Steurer. Analytical approach to parallel repetition. In Proceedings of the 46th Annual ACM Symposium on Theory of Computing, pages 624-633. ACM, 2014. Google Scholar
  12. U. Feige and J. Kilian. Impossibility results for recycling random bits in two-prover proof systems. In Proc. 27th ACM Symp. on Theory of Computing, pages 457-468, 1995. Google Scholar
  13. J. Håstad. Some optimal inapproximability results. Journal of the ACM, 48(4):798-859, 2001. Google Scholar
  14. T. Holenstein. Parallel repetition: Simplification and the no-signaling case. Theory of Computing, 5(1):141-172, 2009. Google Scholar
  15. R. Impagliazzo, V. Kabanets, and A. Wigderson. New direct-product testers and 2-query PCPs. SIAM Journal on Computing, 41(6):1722-1768, 2012. Google Scholar
  16. S. Khot. On the power of unique 2-prover 1-round games. In Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, pages 767-775. ACM, 2002. Google Scholar
  17. D. Moshkovitz. Parallel repetition from fortification. In Proc. 55th IEEE Symp. on Foundations of Computer Science, pages 414-423, 2014. Google Scholar
  18. D. Moshkovitz. The projection games conjecture and the NP-hardness of ln n-approximating set-cover. Theory of Computing, 11(7):221-235, 2015. Google Scholar
  19. D. Moshkovitz and R. Raz. Two query PCP with sub-constant error. Journal of the ACM, 57(5), 2010. Google Scholar
  20. A. Rao. Parallel repetition in projection games and a concentration bound. SIAM Journal on Computing, 40(6):1871-1891, 2011. Google Scholar
  21. R. Raz. A parallel repetition theorem. SIAM Journal on Computing, 27:763-803, 1998. Google Scholar
  22. B.W. Reichardt, F. Unger, and U. Vazirani. Classical command of quantum systems. Nature, 496(7446):456-460, 2013. Google Scholar
  23. R. Shaltiel. Derandomized parallel repetition theorems for free games. Computational Complexity, 22(3):565-594, 2013. Google Scholar
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail