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.
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.
The prepare-and-measure framework based on energy constraints offers a practical middle ground between fully device-dependent and device-independent quantum cryptography. The only assumption on an otherwise uncharacterized prepare-and-measure device is that the energy of the prepared states is bounded. Existing security analyses of this framework assume that the preparation and measurement devices share at most classical correlations, and under this assumption certified lower bounds on the extractable randomness have been established. Recent work has shown that an adversary who pre-distributes entanglement between the devices can mount attacks that are strictly more powerful than those available when the devices share only classical correlations, reducing the extractable randomness below the previously certified rates. This leaves open the fundamental question of whether randomness can be certified at all in this scenario.
We address this open question by constructing semidefinite programming relaxations of the guessing probability by adapting the Navascués-Pironio-Acín hierarchy to the energy-constrained setting where shared entanglement between the devices is permitted. Our relaxations yield certified lower bounds on the extractable randomness without enforcing any restrictions on the dimensions of the quantum state shared between the preparation and measurement devices. We show that these certified lower bounds are strictly positive for a range of energy values, thereby answering the open question affirmatively: certified randomness generation is theoretically possible in the energy-constrained SDI framework even in the presence of a fully quantum adversary.
The semi-device-independent approach provides a framework for prepare-and-measure quantum protocols using devices whose behavior must not be characterized nor trusted, except for a single assumption on the dimension of the Hilbert space characterizing the quantum carriers. Here, we propose instead to constrain the quantum carriers through a bound on the mean value of a well-chosen observable. This modified assumption is physically better motivated than a dimension bound and closer to the description of actual experiments. In particular, we consider quantum optical schemes where the source emits quantum states described in an infinite-dimensional Fock space and model our assumption as an upper bound on the average photon number in the emitted states. We characterize the set of correlations that may be exhibited in the simplest possible scenario compatible with our new framework, based on two energy-constrained state preparations and a two-outcome measurement. Interestingly, we uncover the existence of quantum correlations exceeding the set of classical correlations that can be produced by devices behaving in a purely pre-determined fashion (possibly including shared randomness). This feature suggests immediate applications to certified randomness generation. Along this line, we analyze the achievable correlations in several prepare-and-measure optical schemes with a mean photon number constraint and demonstrate that they allow for the generation of certified randomness. Our simplest optical scheme works by the on-off keying of an attenuated laser source followed by photocounting. It opens the path to more sophisticated energy-constrained semi-device-independent quantum cryptography protocols, such as quantum key distribution.
We investigate the correlations that can arise between Alice and Bob in prepare-and-measure communication scenarios where the source (Alice) and the measurement device (Bob) can share prior entanglement.The paradigmatic example of such a scenario is the quantum dense-coding protocol, where the communication capacity of a qudit can be doubled if a two-qudit entangled state is shared between Alice and Bob.We provide examples of correlations that actually require more general protocols based on higher-dimensional entangled states.This motivates us to investigate the set of correlations that can be obtained from communicating either a classical or a quantum d-dimensional system in the presence of an unlimited amount of entanglement.We show how such correlations can be characterized by a hierarchy of semidefinite programming relaxations by reducing the problem to a noncommutative polynomial optimization problem.We also introduce an alternative relaxation hierarchy based on the notion of informationally restricted quantum correlations, which, though it represents a strict (nonconverging) relaxation scheme, is less computationally demanding.As an application, we introduce device-independent tests of the dimension of classical and quantum systems that, in contrast to previous results, do not make the implicit assumption that Alice and Bob share no entanglement.We also establish several relations between communication with and without entanglement as resources for creating correlations.
Semi-device-independent QRNG frameworks represent a particularly attractive approach, combining strong security guarantees with high randomness generation rates while relying only on reduced and practical physical assumptions. A recently proposed approach based on photon-number constraints is particularly suited to photonic implementations, where these assumptions can be easily assessed experimentally. Here, we experimentally demonstrate a quantum random number generator within this framework, enabling the direct computation of lower bounds on the certifiable Shannon entropy via semidefinite relaxation techniques. When combined with entropy accumulation methods, this approach enables finite-size randomness certification without assuming independent and identically distributed rounds. We realize the protocol using a four-state coherent-state constellation symmetrically distributed in phase space and measured by heterodyne detection, certifying 0.223 bit per measurement, which is the highest value reported to date for a continuous-variable semi-device-independent QRNG. The implementation combines a low-loss integrated photonic heterodyne receiver with a simple transmitter assembled from commercial components, providing a practical and high-speed architecture for semi-device-independent randomness generation.
A key aspect in quantum information is to understand the advantage offered by quantum systems over classical ones in communication tasks. In recent years, a fundamental approach to this problem has been developed, focusing on quantum correlations in prepare-and-measure scenarios. Inspired by the developments in Bell nonlocality and device-independent information processing, this line of research aims to characterize the possibilities and limits of quantum systems for communication, in particular to precisely capture the advantage they offer over classical systems. In addition to fundamental insights, these ideas also underpin the concept of semi-device-independent quantum information processing. Exploring trade-offs between security, performance and ease-of-implementation, this approach opens promising directions for novel quantum information processing technologies and devices. A number of protocols and proof-of-principle demonstrations have been reported in recent years, in particular for quantum randomness certification and key distribution. Here, we provide a comprehensive introduction to quantum prepare-and-measure correlations and semi-device independent applications.
Quantum information tasks are often analyzed under varying trust assumptions about the devices involved. The semi-device-independent (SDI) framework offers a balance between needed assumptions and experimental feasibility. In this work, we study the energy-constrained SDI scenario, where the only assumption in a prepare-and-measure setup is an upper bound on the energy of the prepared quantum states. In contrast to previous studies that restricted the preparation and measurement devices to be classically correlated, we show that allowing entanglement strictly enlarges the set of achievable correlations. We identify two operational consequences of this result. The first concerns randomness certification, where we show that allowing the adversary to employ entangled strategies may significantly reduce the amount of certifiable randomness. This includes situations where the amount of randomness drops to zero in the presence of entanglement, while it remains positive when entanglement is excluded. Second, for the task of distinguishing an arbitrary quantum channel from the identity, we show that the known dimension-independent bound on the advantage conferred by entanglement is violated under an energy constraint.