Improved Local Leakage Resilience of Shamir Secret Sharing and Worst-Case Optimal Polynomial Intersection
quant-ph, cs.CR, cs.DM, cs.IT, math.IT
Submitted: 2026-10-08
Updated: 2026-10-08
Terminology
Sources
- Combinatorial Bounds for List Recovery via Discrete Brascamp--Lieb Inequalities
- OPI x Soft Decoders
- Discrepancy for Random Linear Codes
- Worst-Case Quantum Algorithm for Optimal Polynomial Intersection Beyond Decoded Quantum Interferometry
- A provable quantum advantage for approximate optimization via decoded quantum interferometry
- Tight inapproximability of max-LINSAT and implications for decoded quantum interferometry
- Verifiable Quantum Advantage via Optimized DQI Circuits
- True complexity and iterated Cauchy--Schwarz
- A nearly linear-time Decoded Quantum Interferometry algorithm for the Optimal Polynomial Intersection problem
- On Worst-Case Optimal Polynomial Intersection
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
- Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity