On compatibility of binary qubit measurements

Dmitry Grinko, Roope Uola

Published 2024-07-10Version 1

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 work 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 characterisation 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.