Quantum Algorithms for OPI Variants Beyond Locality and Classical DecodabilityResearch Paper
The code intersection problem asks for a codeword of a linear code that lies in a prescribed set . It is NP-hard even for and a Cartesian product of per-coordinate sets (arXiv:2610.00502, §1). Optimal polynomial intersection (OPI), which asks for a low-degree polynomial whose values lie in prescribed sets at all evaluation…