An efficient quantum parallel repetition theorem and applications

arXiv:2311.10681v2 Announce Type: replace-cross
Abstract: 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 be generically compiled to an equivalent $3$-message argument system, mirroring the transformation for …

adversary applications arxiv cs.cc cs.cr message mirror parallel protocols prove quant-ph quantum repetition results security under