3 papers
cs.IT2026
Average-Radius List-Decodability of Random Linear Codes
Venkatesan Guruswami, Shilun Li, Mihir Singhal
We prove that for every prime power and every , a random -linear code of rate is -average-radius list-decodable…
quant-ph2026
Nearly Time-Optimal Pure State Tomography with Pauli Measurements
Sabee Grewal, Meghal Gupta, William He +2
We give an algorithm for pure state tomography with near-optimal copy and time complexity using only single-qubit measurements. Specifically, given copies o…
cs.CC2025
The communication complexity of distributed estimation
Parikshit Gopalan, Raghu Meka, Prasad Raghavendra +2
We study an extension of the standard two-party communication model in which Alice and Bob hold probability distributions and over domains and , respectively. Their…