Paper 2023/1783
An efficient quantum parallel repetition theorem and applications
Abstract
We prove a tight parallel repetition theorem for
Note: Full version.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Published elsewhere. Major revision. STOC 2024
- DOI
- 10.1145/3618260.3649603
- Keywords
- post-quantumaverage-case complexitydirect productpuzzle
- Contact author(s)
-
chb2154 @ columbia edu
luowenq @ bu edu
nickspoon0 @ gmail com
hyuen @ cs columbia edu - History
- 2024-04-16: revised
- 2023-11-17: received
- See all versions
- Short URL
- https://ia.cr/2023/1783
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2023/1783, author = {John Bostanci and Luowen Qian and Nicholas Spooner and Henry Yuen}, title = {An efficient quantum parallel repetition theorem and applications}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/1783}, year = {2023}, doi = {10.1145/3618260.3649603}, url = {https://eprint.iacr.org/2023/1783} }