@inproceedings{70d163d0f3824c5fa4753c6818357950,
title = "Quantum soundness of testing tensor codes",
abstract = "A locally testable code is an error-correcting code that admits very efficient probabilistic tests of membership. Tensor codes provide a simple family of combinatorial constructions of locally testable codes that generalize the family of Reed-Muller codes. The natural test for tensor codes, the axis-parallel line vs. point test, plays an essential role in constructions of probabilistically checkable proofs. We analyze the axis-parallel line vs. point test as a two-prover game and show that the test is sound against quantum provers sharing entanglement. Our result implies the quantum-soundness of the low individual degree test, which is an essential component of the MIP* = RE theorem. Our proof also generalizes to the infinite-dimensional commuting-operator model of quantum provers.",
author = "Zhengfeng Ji and Anand Natarajan and Thomas Vidick and John Wright and Henry Yuen",
note = "Publisher Copyright: {\textcopyright} 2022 IEEE.; 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021 ; Conference date: 07-02-2022 Through 10-02-2022",
year = "2022",
month = mar,
day = "4",
doi = "10.1109/FOCS52979.2021.00064",
language = "الإنجليزيّة",
isbn = "978-1-6654-2056-3",
series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",
publisher = "IEEE Computer Society",
pages = "586--597",
booktitle = "Proceedings - 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science, FOCS 2021",
address = "الولايات المتّحدة",
}