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.
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.
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.
Nonlocality and its connections to entanglement are fundamental features of quantum mechanics that have found numerous applications in quantum information science. A set of correlations is said to be nonlocal if it cannot be reproduced by spacelike-separated parties sharing randomness and performing local operations. An important practical consideration is that the runtime of the parties has to be shorter than the time it takes light to travel between them. One way to model this restriction is to assume that the parties are computationally bounded. We therefore initiate the study of nonlocality under computational assumptions and derive the following results: (a) We define the set NeL (not-efficiently-local) as consisting of all bipartite states whose correlations arising from local measurements cannot be reproduced with shared randomness and \emph{polynomial-time} local operations. (b) Under the assumption that the Learning With Errors problem cannot be solved in \emph{quantum} polynomial-time, we show that NeL=ENT, where ENT is the set of \emph{all} bipartite entangled states (pure and mixed). This is in contrast to the standard notion of nonlocality where it is known that some entangled states, e.g. Werner states, are local. In essence, we show that there exist (efficient) local measurements producing correlations that cannot be reproduced through shared randomness and quantum polynomial-time computation. (c) We prove that if NeL=ENT unconditionally, then BQP=PP. In other words, the ability to certify all bipartite entangled states against computationally bounded adversaries gives a non-trivial separation of complexity classes. (d) Using (c), we show that a certain natural class of 1-round delegated quantum computation protocols that are sound against PP provers cannot exist.
In a measurement-device-independent or quantum-refereed protocol, a referee can verify whether two parties share entanglement or Einstein-Podolsky-Rosen (EPR) steering without the need to trust either of the parties or their devices. The need for trusting a party is substituted by a quantum channel between the referee and that party, through which the referee encodes the measurements to be performed on that party's subsystem in a set of nonorthogonal quantum states. In this Letter, an EPR-steering inequality is adapted as a quantum-refereed EPR-steering witness, and the trust-free experimental verification of higher dimensional quantum steering is reported via preparing a class of entangled photonic qutrits. Further, with two measurement settings, we extract 1.106±0.023 bits of private randomness per every photon pair from our observed data, which surpasses the one-bit limit for projective measurements performed on qubit systems. Our results advance research on quantum information processing tasks beyond qubits.
In the heart of every physical theory lies measurement theory. While classical measurements are passive probes, QMs can be viewed as active physical processes that shape the available information. Depending on the measurement type, different aspects of the information about a system are retrieved. All possible measurements in quantum physics are described by mathematical objects called Positive Operator-Valued Measures (POVMs). The most familiar standard measurements are called Projective-Valued Measures (PVMs) and make up a subset of POVMs. The complementary subset of POVMs is non-projective. However, some non-projective POVMs can be expressed as a probabilistic mixture of PVMs. Such POVMs are called projectively simulable, while non-simulable POVMs are genuinely non-projective. These can be made projectively simulable by adding noise to the measurements. If a genuinely non-projective POVM requires a large amount of noise before it becomes projectively simulable, it is more non-projective than a POVM that requires less noise. Hence, the degree of non-projectiveness is determined by the required noise strength. The act of measuring a quantum system changes the quantum state. While quantum measurements only take into account the readable classical output value, quantum instruments account for both the classical outcome and the post-measurement state. Hence, instruments are associated with measurements, and in an analogous way, projective and projectively simulable instruments can be defined. For many purposes, non-projective POVMs are more useful than PVMs, and the more non-projective a POVM is, the greater the advantage of using them over PVMs. Therefore, the aim of the thesis is to investigate the genuinely non-projective POVMs. More precisely, the degree of non-projectiveness in qubit POVMs is studied. This is done by convex optimization, specifically by solving semidefinite programs. Furthermore, the thesis addresses the open problem of finding the most non-projective qubit quantum instrument by a witness-based see-saw algorithm.
Abstract We propose an optimal and efficient numerical test for witnessing genuine multipartite nonlocality based on a geometric approach. In particular, we consider two non-equivalent models of local hidden variables, namely the Svetlichny and the no-signaling bilocal models. While our knowledge concerning these models is well established for Bell-type scenarios involving two measurement settings per party, the general case based on an arbitrary number of settings is a considerably more challenging task and very little work has been done in this field. In this paper, we applied such general tests to detect and characterize genuine n-way nonlocal correlations for various states of three qubits and qutrits. Apart from the fundamental problem of characterizing genuine multipartite nonlocal correlations, the extension of the number of measurements beyond two is also of practical importance. As a measure of nonlocality, we use the probability of violation of local realism under randomly sampled observables, and the strength of nonlocality, described by the resistance to white noise admixture. In particular, we analyze to what extent the Bell-type scenario involving two measurement settings can be used to certify genuine n-way nonlocal correlations generated for more general models. In addition, we propose a simple procedure to detect such nonlocal correlations for randomly chosen settings with an efficiency of up to 100%. Due to its near-perfect efficiency, our method may open new possibilities in device-independent quantum cryptography applications where strong nonlocality between all partners is required.
Abstract Quantum random numbers are fundamental resources ( Rev. Mod. Phys. 89 015004) for the fields of communications and information security. Usually, projective measurements can be applied on a two-qubit entangled state to generate quantum random numbers. However, it cannot certify more than one bit of randomness for one set of measurements. On contrast, non-projective measurements in-principle may be able to generate more random bits, and therefore show some merits among present methods. Here, we report the implementation of a quantum random number generator based on a symmetric informationally complete positive operator-valued measure. In our experiment, we prepare a maximally entangled state of two-qubits through spontaneous parametric down-conversion processes, and observe the violation of Gisin’s elegant Bell inequality with the value of 6.8138 ± 0.0822, exceeding the classical bound of 6. Through randomness extractors, including a Toeplitz extractor and a parallel linear feedback shift register based extractor, we finally extract a random string with an autocorrelation coefficient below 10 −3 and the string can pass all randomness tests of the National Institute of Science and Technology (NIST).