Quantum soundness of testing tensor codes

@article{Ji2022QuantumSO,
  title={Quantum soundness of testing tensor codes},
  author={Zhengfeng Ji and Anand Natarajan and Thomas Vidick and John G. Wright and Henry S. Yuen},
  journal={2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)},
  year={2022},
  pages={586-597}
}
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… 
Nonlocal games, compression theorems, and the arithmetical hierarchy
TLDR
The Π2-completeness result is a new “gapless” compression theorem that holds for both quantum and commuting operator strategies, and explains how results about the complexity of nonlocal games all follow in a unified manner from a technique known as compression.
Orthogonalization of Positive Operator Valued Measures
We show that a partition of the unity (or POVM) on a Hilbert space that is almost orthogonal is close to an orthogonal POVM in the same von Neumann algebra. This generalizes to infinite dimension

References

SHOWING 1-10 OF 35 REFERENCES
Robust Locally Testable Codes and Products of Codes
TLDR
The notion of robust local testability of codes is introduced, and codes built by tensor products can be tested robustly and somewhat locally by applying a variant of a test and proof technique introduced by Raz and Safra in the context of testing low‐degree multivariate polynomials.
Robust Local Testability of Tensor Products of LDPC Codes
TLDR
It is shown that expander codes and locally-testable codes are smooth, which complements recent examples of P. Valiant and Coppersmith and Rudra of codes whose tensor product is not robustly testable.
Locally testable codes and PCPs of almost-linear length
TLDR
It is shown that certain PCP systems can be modified to yield locally testable codes and PCPs of almost-linear length, and novel techniques in use include a random projection of certain codewords and PCP-oracles, an adaptation of PCP constructions to obtain "linear PCP -oracles" for proving conjunctions of linear conditions, and a direct construction of local testable (linear) codes of sub-exponential length.
Low-Degree Testing for Quantum States, and a Quantum Entangled Games PCP for QMA
We show that given an explicit description of a multiplayer game, with a classical verifier and a constant number of players, it is QMA-hard, under randomized reductions, to distinguish between the
Almost synchronous quantum correlations
The study of quantum correlation sets initiated by Tsirelson in the 1980s and originally motivated by questions in the foundations of quantum mechanics has more recently been tied to questions in
A Multi-prover Interactive Proof for NEXP Sound against Entangled Provers
TLDR
This work proves a strong limitation on the ability of entangled provers to collude in a multiplayer game, and shows that the correlations produced by any entangled strategy which succeeds in the multilinearity test with high probability can always be closely approximated using shared randomness alone.
A combination of testability and decodability by tensor products
TLDR
Meir (SICOMP 2009) used the Ben‐Sasson and Sudan result to present a combinatorial construction of locally testable codes with largest known rate, and this construction was obtained over sufficiently large fields.
Quantum soundness of the classical low individual degree test
TLDR
A variant of the low degree test called the low individual degree test, initially shown to be sound against multiple quantum provers in [Vid16], is analyzed and the main result is that the two-player version of this test is sound against quantumProvers.
Three-Player Entangled XOR Games Are NP-Hard to Approximate
  • Thomas Vidick
  • Computer Science
    2013 IEEE 54th Annual Symposium on Foundations of Computer Science
  • 2013
TLDR
The key technical component of this work is a soundness analysis of a point-vs-plane low-degree test against entangled players that extends and simplifies the analysis of the multilinearity test by Ito and Vidick.
...
...