Answers are grounded in this paper and cite their sources.
This analysis reveals optimal performance bounds in quantum communication tasks under photon-number constraints, highlighting their implications for randomness extraction.
We study correlations in the prepare-and-measure scenario when quantum communication is constrained by photon-number statistics. Such constraints are natural and practical control parameters for semi-device-independent certification in optical platforms. To analyse these scenarios, we show how semidefinite programming relaxations for noncommutative polynomial optimization can be used to bound the set of quantum correlations under restrictions on the photon-number distribution. The practicality of this method is demonstrated by computing optimal performance bounds on several well-known communication tasks. We then apply the method to the certification of semi-device-inpependent random number generation protocols and show how to bound the conditional Shannon entropy. We showcase this versatile tool by improving randomness extraction in established protocols based on coherent states and homodyne measurements.
No takes yet. Share an insight, caveat, or question.
Carceller et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: