Quantum soundness of testing tensor codes
Zhengfeng Ji, Anand Natarajan, Thomas Vidick, John Wright, Henry Yuen
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext dcab5bd5-820f-41af-8ad1-c7b4da8407b9Cited by top-tier papers4
- Nonlocal games, compression theorems, and the arithmetical hierarchyHamoon Mousavi, Seyed Sajjad Nezhadi, Henry YuenSTOC 2022 · 9 citations
- Succinct Arguments for QMA from Standard Assumptions via Compiled Nonlocal GamesTony Metger, Anand Natarajan, Tina ZhangFOCS 2024 · 8 citations
- Two Prover Perfect Zero Knowledge for MIPKieran Mastel, William SlofstraSTOC 2024 · 2 citations
- MIPᶜᵒ=coREJunqiao (Randy) LinSTOC 2026 · 1 citation
Related papers
- Robust Local Testability of Tensor Products of Constant-Rate Algebraic Geometry CodesSumegha Garg, Akash Kumar SenguptaFOCS 2025
- Improved Round-by-round Soundness IOPs via Reed-Muller CodesDor Minzer, Kai Zhe ZhengFOCS 2025 · 3 citations
- Maximally Extendable Product Codes are Good Coboundary ExpandersGleb Kalachev, Pavel PanteleevFOCS 2025 · 14 citations
- Asymptotically good Quantum and locally testable classical LDPC codesPavel Panteleev, Gleb KalachevSTOC 2022 · 214 citations
- Expansion of High-Dimensional Cubical Complexes: with Application to Quantum Locally Testable CodesIrit Dinur, Ting-Chun Lin, Thomas VidickFOCS 2024 · 4 citations
