Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2605.16151

Generalized measurement incompatibility

Edwin Peter Lobo, Maria Balanzó-Juandó, Stefano Pironio

quant-phSubmitted May 15, 2026• Announced May 18, 2026• 0 citations
arXivHTMLPDF

Abstract

Quantum measurements can be incompatible, i.e., they can fail to be jointly measurable. Recently, a weaker notion of joint-measurability, called partial joint-measurability, was proposed by Masini et al. in [Quantum 8, 1574 (2024)]. In this work, we further generalize this notion to the setting where only a subset of the outcomes of each measurement is required to be jointly determined by classical variables. We provide two mathematical formulations of partial joint-measurability and show that, like full joint-measurability, it can be decided by solving a single semidefinite program. We prove that in the case of an untrusted measurement device, an adversary Eve, limited to classical side information, can perfectly guess the outcomes of the measurement device if and only if the set of measurements is partially jointly measurable. We derive analytical thresholds on the detection efficiency below which generic measurements become partially jointly measurable. Such bounds directly yield limits on the robustness of device-independent and semi-device-independent quantum cryptographic protocols against detection inefficiency. In particular, our results highlight the importance of a careful treatment of postselection in security analyses.

Comments
12+7 pages, 4 figures

Related papers

Joint-measurability and quantum communication with untrusted devices

Michele Masini, Marie Ioannou, Nicolas Brunner +2 more

Photon loss represents a major challenge for the implementation of quantum communication protocols with untrusted devices, e.g. in the device-independent (DI) or semi-DI approaches. Determining critical loss thresholds is usually done in case-by-case studies. In the present work, we develop a general framework for characterizing the admissible levels of loss and noise in a wide range of scenarios and protocols with untrusted measurement devices. In particular, we present general bounds that apply to prepare-and-measure protocols for the semi-DI approach, as well as to Bell tests for DI protocols. A key step in our work is to establish a general connection between quantum protocols with untrusted measurement devices and the fundamental notions of channel extendibility and joint-measurability, which capture essential aspects of the communication and measurement of quantum information. In particular, this leads us to introduce the notion of partial joint-measurability, which naturally arises within quantum cryptography.

arXiv:2403.14785•Quantum•Dec 23, 2024•6 citations

Measurement incompatibility and quantum steering via linear programming

Lucas Emanuel Antunes Porto, Sébastien Designolle, Sebastian Pokutta +1 more

The problem of deciding whether a set of quantum measurements is jointly measurable is known to be equivalent to determining whether a quantum assemblage is unsteerable. This problem can be formulated as a semidefinite program (SDP). However, the number of variables and constraints in such a formulation grows exponentially with the number of measurements, rendering it intractable for large measurement sets. In this work, we circumvent this problem by transforming the SDP into a hierarchy of linear programs that compute upper and lower bounds on the incompatibility robustness with a complexity that grows polynomially in the number of measurements. The hierarchy is guaranteed to converge and it can be applied to arbitrary measurements – including non-projective POVMs (Positive Operator-Valued Measures) – in arbitrary dimensions. While convergence becomes impractical in high dimensions, in the case of qubits our method reliably provides accurate upper and lower bounds for the incompatibility robustness of sets with several hundred measurements in a short time using a standard laptop. We also apply our methods to qutrits, obtaining non-trivial upper and lower bounds in scenarios that are otherwise intractable using the standard SDP approach, although such bounds are significantly looser than the ones obtained in the qubit case. Finally, we show how our methods can be used to construct local hidden state models for states (i.e., to prove that a state cannot lead to steering under any possible local measurements), or conversely, to certify that a given state exhibits steering; for two-qubit quantum states, our approach is comparable to, and in some cases outperforms, the current best methods.

arXiv:2506.03045•Quantum•Jun 19, 2026•1 citation

Compatibility of Binary Qubit Measurements

Dmitry Grinko, Roope Uola

Deciding which sets of quantum measurements allow a simultaneous readout is a central problem in quantum measurement theory. The problem is relevant not only from the foundational perspective, but also has direct applications in quantum correlation problems fueled by incompatible measurements. Although central, only a few analytical criteria exist for deciding the incompatibility of general sets of measurements. This Letter approaches the problem through functions defined on the Boolean hypercube and their Fourier transformations. We show that this reformulation of the problem leads to a complete geometric characterization of joint measurability of any finite set of unbiased binary qubit measurements and gives a necessary condition for the biased case. We discuss our results in the realm of quantum steering, where they translate into a family of steering inequalities. When certain unbiasedness conditions are fulfilled, these criteria are tight, hence fully characterizing the steering problem when the trusted party holds a qubit, and the untrusted party performs any finite number of binary measurements. We further discuss how our results point towards a second-order cone programming approach to measurement incompatibility and compare this to the predominantly used semi-definite programming-based techniques. We use our approach to falsify an existing conjecture on measurement incompatibility of special sets of measurements.

arXiv:2407.07711•Physical Review Letters•Nov 14, 2025•0 citations

Measurement incompatibility in Bayesian multiparameter quantum estimation

Francesco Albarelli, Dominic Branford, Jesús Rubio

We present a comprehensive and pedagogical formulation of Bayesian multiparameter quantum estimation. Within this framework, we analyse the role of measurement incompatibility and establish its quantitative effect on attainable precision. We achieve this by deriving upper bounds based on the pretty good measurement -- a notion from hypothesis testing -- combined with the evaluation of the Nagaoka-Hayashi lower bound. In general, we prove that, as in the many-copy regime of local estimation theory, incompatibility can at most double the minimum loss relative to the idealised scenario in which individually optimal measurements are assumed jointly implementable. Therefore, in practical situations, the latter may provide a sufficient and computationally efficient benchmark without solving the full optimisation problem. Our results, which we illustrate through applications of discrete phase imaging, phase and dephasing estimation, and qubit sensing, provide analytical and numerical tools for assessing ultimate precision limits and the role of measurement incompatibility in Bayesian multiparameter quantum metrology, including an open-source package for all the bounds discussed here.

quant-pharXiv:2511.16645•Quantum•Nov 21, 2025•0 citations

Quantum Incompatibility Witnesses

Claudio Carmeli, Teiko Heinosaari, Alessandro Toigo

We demonstrate that quantum incompatibility can always be detected by means of a state discrimination task with partial intermediate information. This is done by showing that only incompatible measurements allow for an efficient use of premeasurement information in order to improve the probability of guessing the correct state. Thus, the gap between the guessing probabilities with pre- and postmeasurement information is a witness of the incompatibility of a given collection of measurements. We prove that all linear incompatibility witnesses can be implemented as some state discrimination protocol according to this scheme. As an application, we characterize the joint measurability region of two noisy mutually unbiased bases.

•Aug 28, 2025•0 citations

Complete Resource Theory of Quantum Incompatibility as Quantum Programmability

Francesco Buscemi, Eric Chitambar, Wenbin Zhou

Measurement incompatibility describes two or more quantum measurements whose expected joint outcome on a given system cannot be defined. This purely nonclassical phenomenon provides a necessary ingredient in many quantum information tasks such as violating a Bell inequality or nonlocally steering part of an entangled state. In this Letter, we characterize incompatibility in terms of programmable measurement devices and the general notion of quantum programmability. This refers to the temporal freedom a user has in issuing programs to a quantum device. For devices with a classical control and classical output, measurement incompatibility emerges as the essential quantum resource embodied in their functioning. Based on the processing of programmable measurement devices, we construct a quantum resource theory of incompatibility. A complete set of convertibility conditions for programmable devices is derived based on quantum state discrimination with postmeasurement information.

arXiv:1908.11274•Physical Review Letters•Mar 24, 2020•75 citations
Quantum measurements can be incompatible, i.e., they can fail to be jointly measurable. Recently, a weaker notion of joint-measurability, called partial joint-measurability, was proposed by Masini et al. in [Quantum 8, 1574 (2024)]. In this work, we further generalize this notion to the setting where only a subset of the outcomes of each measurement is required to be jointly determined by classical variables. We provide two mathematical formulations of partial joint-measurability and show that, like full joint-measurability, it can be decided by solving a single semidefinite program. We prove that in the case of an untrusted measurement device, an adversary Eve, limited to classical side information, can perfectly guess the outcomes of the measurement device if and only if the set of measurements is partially jointly measurable. We derive analytical thresholds on the detection efficiency below which generic measurements become partially jointly measurable. Such bounds directly yield limits on the robustness of device-independent and semi-device-independent quantum cryptographic protocols against detection inefficiency. In particular, our results highlight the importance of a careful treatment of postselection in security analyses.
Photon loss represents a major challenge for the implementation of quantum communication protocols with untrusted devices, e.g. in the device-independent (DI) or semi-DI approaches. Determining critical loss thresholds is usually done in case-by-case studies. In the present work, we develop a general framework for characterizing the admissible levels of loss and noise in a wide range of scenarios and protocols with untrusted measurement devices. In particular, we present general bounds that apply to prepare-and-measure protocols for the semi-DI approach, as well as to Bell tests for DI protocols. A key step in our work is to establish a general connection between quantum protocols with untrusted measurement devices and the fundamental notions of channel extendibility and joint-measurability, which capture essential aspects of the communication and measurement of quantum information. In particular, this leads us to introduce the notion of partial joint-measurability, which naturally arises within quantum cryptography.
The problem of deciding whether a set of quantum measurements is jointly measurable is known to be equivalent to determining whether a quantum assemblage is unsteerable. This problem can be formulated as a semidefinite program (SDP). However, the number of variables and constraints in such a formulation grows exponentially with the number of measurements, rendering it intractable for large measurement sets. In this work, we circumvent this problem by transforming the SDP into a hierarchy of linear programs that compute upper and lower bounds on the incompatibility robustness with a complexity that grows polynomially in the number of measurements. The hierarchy is guaranteed to converge and it can be applied to arbitrary measurements – including non-projective POVMs (Positive Operator-Valued Measures) – in arbitrary dimensions. While convergence becomes impractical in high dimensions, in the case of qubits our method reliably provides accurate upper and lower bounds for the incompatibility robustness of sets with several hundred measurements in a short time using a standard laptop. We also apply our methods to qutrits, obtaining non-trivial upper and lower bounds in scenarios that are otherwise intractable using the standard SDP approach, although such bounds are significantly looser than the ones obtained in the qubit case. Finally, we show how our methods can be used to construct local hidden state models for states (i.e., to prove that a state cannot lead to steering under any possible local measurements), or conversely, to certify that a given state exhibits steering; for two-qubit quantum states, our approach is comparable to, and in some cases outperforms, the current best methods.
Deciding which sets of quantum measurements allow a simultaneous readout is a central problem in quantum measurement theory. The problem is relevant not only from the foundational perspective, but also has direct applications in quantum correlation problems fueled by incompatible measurements. Although central, only a few analytical criteria exist for deciding the incompatibility of general sets of measurements. This Letter approaches the problem through functions defined on the Boolean hypercube and their Fourier transformations. We show that this reformulation of the problem leads to a complete geometric characterization of joint measurability of any finite set of unbiased binary qubit measurements and gives a necessary condition for the biased case. We discuss our results in the realm of quantum steering, where they translate into a family of steering inequalities. When certain unbiasedness conditions are fulfilled, these criteria are tight, hence fully characterizing the steering problem when the trusted party holds a qubit, and the untrusted party performs any finite number of binary measurements. We further discuss how our results point towards a second-order cone programming approach to measurement incompatibility and compare this to the predominantly used semi-definite programming-based techniques. We use our approach to falsify an existing conjecture on measurement incompatibility of special sets of measurements.
We present a comprehensive and pedagogical formulation of Bayesian multiparameter quantum estimation. Within this framework, we analyse the role of measurement incompatibility and establish its quantitative effect on attainable precision. We achieve this by deriving upper bounds based on the pretty good measurement -- a notion from hypothesis testing -- combined with the evaluation of the Nagaoka-Hayashi lower bound. In general, we prove that, as in the many-copy regime of local estimation theory, incompatibility can at most double the minimum loss relative to the idealised scenario in which individually optimal measurements are assumed jointly implementable. Therefore, in practical situations, the latter may provide a sufficient and computationally efficient benchmark without solving the full optimisation problem. Our results, which we illustrate through applications of discrete phase imaging, phase and dephasing estimation, and qubit sensing, provide analytical and numerical tools for assessing ultimate precision limits and the role of measurement incompatibility in Bayesian multiparameter quantum metrology, including an open-source package for all the bounds discussed here.
We demonstrate that quantum incompatibility can always be detected by means of a state discrimination task with partial intermediate information. This is done by showing that only incompatible measurements allow for an efficient use of premeasurement information in order to improve the probability of guessing the correct state. Thus, the gap between the guessing probabilities with pre- and postmeasurement information is a witness of the incompatibility of a given collection of measurements. We prove that all linear incompatibility witnesses can be implemented as some state discrimination protocol according to this scheme. As an application, we characterize the joint measurability region of two noisy mutually unbiased bases.
Measurement incompatibility describes two or more quantum measurements whose expected joint outcome on a given system cannot be defined. This purely nonclassical phenomenon provides a necessary ingredient in many quantum information tasks such as violating a Bell inequality or nonlocally steering part of an entangled state. In this Letter, we characterize incompatibility in terms of programmable measurement devices and the general notion of quantum programmability. This refers to the temporal freedom a user has in issuing programs to a quantum device. For devices with a classical control and classical output, measurement incompatibility emerges as the essential quantum resource embodied in their functioning. Based on the processing of programmable measurement devices, we construct a quantum resource theory of incompatibility. A complete set of convertibility conditions for programmable devices is derived based on quantum state discrimination with postmeasurement information.