3 papers
cs.CC2026
On Sampling Lower Bounds for Polynomials
Mohammad Mahdi Khodabandeh, Igor Shinkar
In this work, we continue the line of research on the complexity of distributions (Viola, Journal of Computing 2012), and study samplers defined by low degree polynomials. An -t…
quant-ph2025
Witnessing the Effective Entanglement in the COW Protocol
F. Rezazadeh, A. Mani, M. Khodabandeh +2
We present a rigorous mathematical framework for verifying effective entanglement in a Coherent One-Way (COW) quantum key distribution setup. In particular, we introduce a two-para…
cs.CC2024
On the Power of Interactive Proofs for Learning
Tom Gur, Mohammad Mahdi Jahanara, Mohammad Mahdi Khodabandeh +3
We continue the study of doubly-efficient proof systems for verifying agnostic PAC learning, for which we obtain the following results. - We construct an interactive protocol for l…