This work analyzes correlations arising from quantum systems subject to sequential projective measurements to certify that the system in question has a quantum dimension greater than some d . We refine previous known methods and show that dimension greater than two can be certified in scenarios which are considerably simpler than the ones presented before and, for the first time in this sequential projective scenario, we certify quantum systems with dimension strictly greater than three. We also perform a systematic numerical analysis in terms of robustness and conclude that performing random projective measurements on random pure qutrit states allows a robust certification of quantum dimensions with very high probability.
This work analyzes correlations arising from quantum systems subject to sequential projective measurements to certify that the system in question has a quantum dimension greater than some d . We refine previous known methods and show that dimension greater than two can be certified in scenarios which are considerably simpler than the ones presented before and, for the first time in this sequential projective scenario, we certify quantum systems with dimension strictly greater than three. We also perform a systematic numerical analysis in terms of robustness and conclude that performing random projective measurements on random pure qutrit states allows a robust certification of quantum dimensions with very high probability.
An important problem in quantum information theory is that of bounding sets of correlations that arise from making local measurements on entangled states of arbitrary dimension. Currently, the best-known method to tackle this problem is the NPA hierarchy; an infinite sequence of semidefinite programs that provides increasingly tighter outer approximations to the desired set of correlations. In this work we consider a more general scenario in which one performs sequences of local measurements on an entangled state of arbitrary dimension. We show that a simple adaptation of the original NPA hierarchy provides an analogous hierarchy for this scenario, with comparable resource requirements and convergence properties. We then use the method to tackle some problems in device-independent quantum information. First, we show how one can robustly certify over 2.3 bits of device-independent local randomness from a two-quibt state using a sequence of measurements, going beyond the theoretical maximum of two bits that can be achieved with non-sequential measurements. Finally, we show tight upper bounds to two previously defined tasks in sequential Bell test scenarios.
Quantum correlations between measurements of separated observers are crucial for applications like randomness generation and key distribution. Although device-independent security can be certified with minimal assumptions, current protocols have limited performance. Here, we exploit sequential measurements, defined with a precise temporal order, to enhance performance by reusing quantum states. We provide a geometric perspective and a general mathematical framework, analytically proving a Tsirelson-like boundary for sequential quantum correlations, which represents a trade-off in nonlocality shared by sequential users. This boundary is advantageous for secure quantum randomness generation, certifying maximum bits per state with one remote and two sequential parties, even if one sequential user shares no nonlocality. Our simple qubit protocol reaches this boundary, and numerical analysis shows improved robustness under realistic noise. A photonic implementation confirms feasibility and robustness. This study advances the understanding of sequential quantum correlations and offers insights for efficient device-independent protocols.
We consider the problem of certification of arbitrary ensembles of pure states and projective measurements solely from the experimental statistics in the prepare-and-measure scenario assuming the upper bound on the dimension of the Hilbert space. To this aim, we propose a universal and intuitive scheme based on establishing perfect correlations between target states and suitably-chosen projective measurements. The method works in all finite dimensions and allows for robust certification of the overlaps between arbitrary preparation states and between the corresponding measurement operators. Finally, we prove that for qubits, our technique can be used to robustly self-test arbitrary configurations of pure quantum states and projective measurements. These results pave the way towards the practical application of the prepare-and-measure paradigm to certification of quantum devices.
Abstract Non-projective measurements play a crucial role in various information-processing protocols. In this work, we propose an operational task to identify measurements that are neither projective nor classical post-processing of data obtained from projective measurements. Our setup involves space-like separated parties with access to a shared state with bounded local dimensions. Specifically, in the case of qubits, we focus on a bipartite scenario with different sets of target correlations. While some of these correlations can be obtained through non-projective measurements on a shared two-qubit state, it is impossible to generate these correlations using projective simulable measurements on bipartite qubit states, or equivalently, by using one bit of shared randomness and local post-processing. For certain target correlations, we show that detecting qubit non-projective measurements is robust under arbitrary depolarizing noise, except in the limiting case. We extend this task for qutrits and demonstrate that some correlations achievable via local non-projective measurements cannot be reproduced by both parties performing the same qutrit projective simulable measurements on their pre-shared state. We provide numerical evidence for the robustness of this scheme under arbitrary depolarizing noise. For a more generic consideration (bipartite and tripartite scenario), we provide numerical evidence for a projective-simulable bound on the reward function for our task. We also show a violation of this bound by using qutrit positive operator valued measures. From a foundational perspective, we extend the notion of non-projective measurements to general probabilistic theories (GPTs) and use a randomness-free test to demonstrate that a class of GPTs, called square-bits or box-world are unphysical.
Certifying quantum behavior from classically accessible data is essential for secure communication and scalable quantum technologies. While powerful certification methods such as Bell nonlocality and quantum steering exist, their implementation typically requires entanglement or additional assumptions, and experimental demonstrations mainly focus on low-dimensional systems. In minimal prepare-and-measure scenarios, where a sender encodes information into quantum states and a receiver performs a single measurement, robust certification becomes particularly challenging, especially in the presence of noise and in higher-dimensional Hilbert spaces. Here, we propose, design, and experimentally implement a protocol that certifies quantumness between two distant parties without the need for preshared resources or measurement incompatibility. The experiments are carried out using the orbital angular momentum degrees of freedom of single photons, chosen for providing increased dimensionality that is scalable. We demonstrate the robustness of the protocol through rank-stability analysis of the observed correlations, which enables the certification of non-classicality even in the presence of noise. Our results provide a practical route to validate high-dimensional quantum communication systems and open new possibilities for secure and dimension-efficient quantum information processing.
Determining the conditions under which positive operator-valued measures (POVMs), the most general class of quantum measurements, outperform projective measurements remains a challenging and largely unresolved problem. Of particular interest are projectively simulable POVMs, which can be realized through probabilistic mixtures of projective measurements, and therefore offer no advantage over projective schemes. Characterizing the boundary between simulable and non-simulable POVMs is, however, a difficult task, and existing tools either fail to scale efficiently, provide limited experimental feasibility or work only for specific POVMs. Here, we introduce and demonstrate a general method to certify non-simulability of a POVM by introducing a complete hierarchy of semidefinite programs. It provides upper bounds on the non-simulability measure of critical visibility of arbitrary POVMs which are tight in many cases and outperform previously known criteria. We experimentally certify the non-simulability of two- and three-dimensional POVMs using a trapped-ion qudit quantum processor by constructing non-simulability witnesses and introduce a modification of our framework that makes them robust against state preparation errors. Finally, we extend our results to the setting where an additional ancilla system is available.