An efficient quantum parallel repetition theorem and applications

ePrint Report: An efficient quantum parallel repetition theorem and applications

John Bostanci, Luowen Qian, Nicholas Spooner, Henry Yuen

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, and Naor [BIN97]. Finally, we prove that all quantum argument systems can …

adversary applications eprint report john message protocols prove quantum repetition report security under