Standard projective measurements (PMs) represent a subset of all possible measurements in quantum physics, defined by positive-operator-valued measures. We study what quantum measurements are projective simulable, that is, can be simulated by using projective measurements and classical randomness. We first prove that every measurement on a given quantum system can be realized by classical randomization of projective measurements on the system plus an ancilla of the same dimension. Then, given a general measurement in dimension two or three, we show that deciding whether it is PM simulable can be solved by means of semidefinite programming. We also establish conditions for the simulation of measurements using projective ones valid for any dimension. As an application of our formalism, we improve the range of visibilities for which two-qubit Werner states do not violate any Bell inequality for all measurements. From an implementation point of view, our work provides bounds on the amount of white noise a measurement tolerates before losing any advantage over projective ones.
Standard projective measurements (PMs) represent a subset of all possible measurements in quantum physics, defined by positive-operator-valued measures. We study what quantum measurements are projective simulable, that is, can be simulated by using projective measurements and classical randomness. We first prove that every measurement on a given quantum system can be realized by classical randomization of projective measurements on the system plus an ancilla of the same dimension. Then, given a general measurement in dimension two or three, we show that deciding whether it is PM simulable can be solved by means of semidefinite programming. We also establish conditions for the simulation of measurements using projective ones valid for any dimension. As an application of our formalism, we improve the range of visibilities for which two-qubit Werner states do not violate any Bell inequality for all measurements. From an implementation point of view, our work provides bounds on the amount of white noise a measurement tolerates before losing any advantage over projective ones.
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.
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.
In quantum theory, general measurements are described by Positive Operator-Valued Measures (POVMs). We show that for anyd-dimensional system, applying depolarizing noise with constant visibility rendersanyPOVM simulable by a randomized implementation of projective measurements— without auxiliary systems. This constrains the asymptotic advantage of POVMs over projective measurements in tasks such as state discrimination, shadow tomography, and quantum metrology. We further improve known bounds on the visibility range for which noisy pure two-qudit states admit local hidden-variable models under general measurements. As a byproduct, we obtain asymptotically tight bounds on the critical visibility for joint measurability of all POVMs. Technically, we leverage recent results in POVM simulation, the Kadison–Singer problem, and introduce a “dimension-deficient” Naimark theorem. Additionally, we demonstrate that general2N-qubit circuits can be simulated via randomization over circuits onN +1qubits, with constant overhead, suggesting new avenues for circuit knitting in near-term quantum architectures.
Identifying whether a state family admits an irreducible quantum advantage is a fundamental task in quantum resource theory and quantum information processing. Here we study classically simulable state families, namely those residing within the convex hull of pairwise commuting families and therefore admitting a classical explanation. We develop a complete semidefinite-programming (SDP) hierarchy characterizing the set of classically simulable state families in arbitrary finite dimension. The key step is to reformulate classical simulability as a feasibility problem over deterministic response functions and auxiliary positive-operator-valued measures (POVMs) simulable by rank-one projective measurements. We establish a complete SDP hierarchy for rank-one projectively simulable POVMs and transfer the resulting characterization to state families, yielding both primal feasibility tests and dual affine witnesses certifying failure of classical simulability. Applying the hierarchy to state families mixed with depolarizing noise gives computable upper bounds on the critical classical visibility, which are matched by explicit classical simulations in several symmetric examples. These results provide a systematic convex-optimization framework for certifying classical simulability of quantum state families.
Quantum instruments describe both the classical outcome and the updated state associated with a quantum measurement. We ask whether these processes can be simulated using only a natural subset of resources, namely projective measurements on the system and quantum processing of the postmeasurement states. We show that the simulability of instruments can be connected to an entanglement classification problem. This leads to a computationally efficient necessary condition for simulation of generic instruments and to a complete characterisation for qubits. We use this to address relevant quantum information tasks, namely (i) the noise tolerance of standard qubit unsharp measurements, (ii) nonprojective advantages in information-disturbance trade-offs, and (iii) increased sequential Bell inequality violations under projective measurements. Moreover, we consider also d-dimensional Lüders instruments that correspond to weak versions of standard basis measurements and show that for large d these can permit scalable noise advantages over projective implementations.
Abstract In the standard Bell scenario, when making a local projective measurement on each system component, the amount of randomness generated is restricted. However, this limitation can be surpassed through the implementation of sequential measurements. Nonetheless, a rigorous definition of random numbers in the context of sequential measurements is yet to be established, except for the lower quantification in device-independent scenarios. In this paper, we define quantum intrinsic randomness in sequential measurements and quantify the randomness in the Collins–Gisin–Linden–Massar–Popescu inequality sequential scenario. Initially, we investigate the quantum intrinsic randomness of the mixed states under sequential projective measurements and the intrinsic randomness of the sequential positive-operator-valued measure (POVM) under pure states. Naturally, we rigorously define quantum intrinsic randomness under sequential POVM for arbitrary quantum states. Furthermore, we apply our method to one-Alice and two-Bobs sequential measurement scenarios, and quantify the quantum intrinsic randomness of the maximally entangled state and maximally violated state by giving an extremal decomposition. Finally, using the sequential Navascues–Pironio–Acin hierarchy in the device-independent scenario, we derive lower bounds on the quantum intrinsic randomness of the maximally entangled state and maximally violated state.