Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author John Bostanci:

TR23-204 | 17th November 2023
John Bostanci, Luowen Qian, Nicholas Spooner, Henry Yuen

An efficient quantum parallel repetition theorem and applications

Revisions: 1

We prove a tight parallel repetition theorem for 3-message computationally-secure quantum interactive protocols between an efficient challenger and an efficient adversary. We also prove under plausible assumptions that the security of 4-message computationally secure protocols does not generally decrease under parallel repetition. These mirror the classical results of Bellare, Impagliazzo, ... more >>>

ISSN 1433-8092 | Imprint