⚛️ quantum physics

Strict hierarchy between $n$ -wise measurement simulability, compatibility structures, and multi-copy compatibility

This paper establishes a strict mathematical and operational hierarchy between different generalizations of quantum measurement incompatibility—specifically $n$ -wise simulability, compatibility structures, and multi-copy compatibility—by demonstrating that these notions describe distinct sets of measurement assemblages and providing a unified framework to resolve their interrelations.

Original authors: Lucas Tendick, Costantino Budroni, Marco Túlio Quintino

Published 2026-09-16

📖 6 min read🧠 Deep dive

CC BY 4.0

Original authors: Lucas Tendick, Costantino Budroni, Marco Túlio Quintino

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

In the quantum world, the act of measuring a system is not a passive observation but a fundamental interaction that changes the system itself. Unlike checking the temperature of a room, where the thermometer simply reads a pre-existing value, looking at a quantum particle forces it to choose a state, often destroying information about other properties it might have held. This leads to a peculiar limitation: certain properties of a quantum system cannot be measured at the same time with perfect precision. This phenomenon, known as measurement incompatibility, is not a flaw in our instruments but a core feature of nature. It is the reason why quantum computers can outperform classical ones and why quantum encryption is theoretically unbreakable. For decades, physicists have focused on the simple question of whether a set of measurements can be performed together. However, as the field has matured, researchers began asking more nuanced questions: if we cannot measure everything at once, how many measurements are truly needed to describe a complex set of observations? Is a group of three measurements genuinely three distinct things, or can they be reduced to two, or even just one, if we are clever enough with our experimental setup?

A team of researchers has now mapped out the landscape of these questions, revealing that the answer depends entirely on how one defines "measurement." In a recent study, they examined three different ways scientists have tried to generalize the concept of incompatibility. One approach asks if a set of measurements can be simulated by a smaller number of measurements using classical logic and probability. Another looks at the geometric structure of which measurements can be paired together. A third considers whether having multiple copies of the quantum state being measured allows us to bypass the usual restrictions. For a long time, these different approaches were used in isolation, often leading to confusion about which definition was the most accurate or powerful. The researchers found that these are not just different ways of saying the same thing; they describe fundamentally different sets of physical possibilities.

The study establishes a strict hierarchy, showing that these concepts form a ladder of increasing power. At the bottom is the simplest form of compatibility, where measurements can be simulated by a single effective measurement. Moving up, the researchers showed that allowing for probabilistic choices—where an experimenter randomly decides which measurement to perform based on a coin flip—opens up new possibilities that deterministic choices cannot achieve. They proved that the set of measurements that can be simulated by a smaller number using random choices is strictly larger than the set that can be simulated using only fixed, pre-determined rules. This distinction is crucial because it shows that randomness is a genuine resource in quantum measurement, not just a mathematical convenience.

The researchers then investigated the shape of the space these measurements occupy. They discovered that the set of measurements that can be simulated by a smaller number is not "convex." In everyday terms, this means that if you take two different sets of measurements that are both simulable, and you mix them together, the resulting mixture might not be simulable anymore. This was a surprising finding, as many physical properties in quantum mechanics behave smoothly and predictably when mixed. To prove this, the team used a combination of computer simulations and rigorous error analysis on a specific set of three quantum measurements, demonstrating that while the individual sets fit the criteria, their mixture did not. This non-convexity implies that the rules governing these measurements are more complex and jagged than previously thought.

To make sense of this complexity, the team connected the dots between the different definitions. They showed that if you take the "convex hull" of the simulable measurements—essentially filling in the gaps to create a smooth, convex shape—you arrive exactly at the set of measurements defined by "compatibility structures." This mathematical bridge revealed that two seemingly different ways of classifying measurements are actually two sides of the same coin, provided one allows for mixing strategies. However, the hierarchy does not stop there. The researchers found that even this combined set is strictly smaller than the set of measurements that can be performed jointly if one has access to multiple copies of the quantum state. In other words, having two copies of a quantum state allows an experimenter to measure things that are impossible to measure with a single copy, even if one uses the most sophisticated mixing strategies available.

The study also provided a concrete limit for this power. By analyzing the behavior of these measurements on pure quantum states, the team derived a universal lower bound on how much noise a system can tolerate before it becomes measurable. They found that for any set of measurements, there is a specific threshold of visibility—a measure of how clear the signal is—below which the measurements can be performed jointly on multiple copies. This bound is tighter than previous estimates, offering a more precise tool for experimentalists to determine the capabilities of their devices.

The implications of this work extend beyond pure theory. In the realm of quantum technology, where devices are often treated as "black boxes" whose internal workings are unknown, being able to certify how many distinct measurements a device is truly performing is vital. The researchers showed that their hierarchy allows for better certification of these devices. By using the stricter definitions of compatibility, one can more accurately determine the minimum number of measurements a device must possess to produce a certain result. This is particularly important for verifying the security of quantum communication protocols, where the assumption that a device is performing a specific number of measurements is often the foundation of its security.

Ultimately, this paper resolves a period of confusion in the field by clarifying that there is no single "correct" way to define how many measurements are in a device. Instead, there is a spectrum of definitions, each with its own operational meaning and mathematical boundaries. The choice of which definition to use depends on the specific context and the resources available, such as whether one has access to multiple copies of a state or can use randomization. By laying out this strict hierarchy, the researchers have provided a clear framework for future experiments and theories, ensuring that when scientists discuss the "genuineness" of a measurement, they are speaking the same language. The work does not just solve a puzzle; it provides the map for navigating the complex terrain of quantum measurement, ensuring that the tools used to explore the quantum world are as precise as the phenomena they seek to describe.

Technical Summary: Strict Hierarchy between $n$ -wise Measurement Simulability, Compatibility Structures, and Multi-copy Compatibility

Problem Statement

Measurement incompatibility—the inability to jointly measure certain quantum observables—is a fundamental resource in quantum information. While standard incompatibility (joint measurability) is well-understood, recent literature has proposed various generalizations to quantify "how many" measurements are genuinely contained within a measurement assemblage (a set of $m$ measurements). These generalizations include measurement simulability, compatibility structures (or $n$ -wise compatibility), and multi-copy incompatibility.

Currently, these notions are used in isolation without a clear understanding of their mutual relationships. The field lacks a unified framework to determine whether these different definitions describe the same sets of measurements or distinct subsets. This ambiguity leads to a "scrambled" state-of-the-art where competing concepts are applied without awareness of their operational or mathematical differences. This paper aims to resolve this by establishing a strict hierarchy between these generalizations and clarifying their operational and geometric distinctions.

Methodology

The authors employ a combination of operational definitions, geometric analysis of measurement assemblage sets, and convex optimization techniques (specifically Semidefinite Programming, SDP).

Operational Definitions: The paper rigorously defines three main generalizations:
- Measurement Simulability ( $SIM_n$ ): Can $m$ measurements be simulated by $n$ measurements using classical pre- and post-processing? The authors distinguish between deterministic pre-processing ( $SIM_n^{Det}$ ) and probabilistic pre-processing ( $SIM_n$ ).
- Compatibility Structures ( $JM_n^{conv}$ ): Can the assemblage be decomposed into a convex combination of assemblages where subsets of size $n$ are jointly measurable? This is geometrically defined via compatibility hypergraphs.
- Multi-copy Compatibility ( $Copy_n$ ): Can the statistics of $m$ measurements be reproduced by performing a single joint measurement on $n$ copies of the input state?
Set Inclusion Analysis: The core methodology involves proving strict set inclusions between these definitions. The authors analyze the convexity properties of these sets and utilize numerical optimization (SDP) combined with $\epsilon$ -net grid approaches to establish rigorous bounds where analytical proofs are difficult.
Cloning Connections: For the multi-copy case, the authors utilize the connection between joint measurability and optimal quantum cloning (specifically Werner's cloning map) to derive universal bounds for pure input states.

Key Contributions and Results

1. Hierarchy of Set Inclusions

The primary contribution is the establishment of a strict hierarchy of set inclusions for measurement assemblages with $m$ measurements simulated by $n$ measurements ( $1 < n < m$ ):
$JM \subset SIM_n^{Det} \subset SIM_n \subset \text{Conv}(SIM_n) \equiv JM_n^{conv} \subset Copy_n \subset All_m$
Where:

$JM$ : Standard joint measurability.
$SIM_n^{Det}$ : $n$ -simulable with deterministic pre-processing.
$SIM_n$ : $n$ -simulable with general probabilistic pre-processing.
$\text{Conv}(SIM_n)$ : The convex hull of $n$ -simulable sets.
$JM_n^{conv}$ : The set of $n$ -wise compatible measurements (from compatibility structures).
$Copy_n$ : The set of $n$ -copy jointly measurable measurements.

2. Specific Results

Result 1 (Insufficiency of Deterministic Pre-processing): The set of $n$ -simulable measurements with probabilistic pre-processing ( $SIM_n$ ) is strictly larger than the set with deterministic pre-processing ( $SIM_n^{Det}$ ). The authors provide an explicit example of three qubit measurements (Pauli $\sigma_x, \sigma_z$ , and Hadamard) that can be simulated by two measurements using probabilistic pre-processing but not deterministically.
Result 2 (Non-convexity of $SIM_n$ ): The set of $n$ -simulable measurements is not convex. This is demonstrated by showing that a specific set of noisy Pauli measurements lies within the convex hull of 2-simulable measurements but is not itself 2-simulable. This implies that $SIM_n \subsetneq \text{Conv}(SIM_n)$ .
Result 3 (Correspondence with Compatibility Structures): The convex hull of the set of $n$ -simulable measurements coincides exactly with the set of $n$ -wise compatible measurements ( $JM_n^{conv}$ ). This links the operational notion of simulability (with shared randomness) to the geometric notion of compatibility structures.
Result 4 (Connection to Multi-copy): The set of $n$ -wise compatible measurements is strictly contained within the set of $n$ -copy jointly measurable measurements ( $JM_n^{conv} \subsetneq Copy_n$ ). This establishes multi-copy compatibility as the strongest (largest set) of the known generalizations.
Result 5 (Universal Lower Bound): A universal lower bound on the critical visibility for $n$ -copy joint measurability of any $m$ measurements on pure states is derived:
$\eta^* \geq \frac{n(d+m)}{m(d+n)}$
where $d$ is the dimension of the system. This extends previous bounds for standard joint measurability ( $n=1$ ).

Significance and Implications

The paper claims to provide a general framework for generalized measurement incompatibility, resolving the ambiguity in the field by ordering previously competing concepts.

Clarification of Concepts: The work demonstrates that these generalizations are not merely different operational interpretations of the same phenomenon but describe mathematically distinct subsets of measurements. For instance, the choice between using $n$ -simulability or $n$ -wise compatibility depends on whether one requires the simulation to be operationally implementable with exactly $n$ measurements (simulability) or allows for probabilistic mixing of strategies that might require more measurements in practice (convex hull/compatibility structures).
Refinement of Certification Protocols: The results have direct implications for semi-device-independent and device-independent certification of the number of measurements. Specifically, the authors note that approximating $n$ -simulability with $n$ -copy joint measurability (as done in prior work) can be refined by using $n$ -wise compatibility ( $JM_n^{conv}$ ). This provides tighter bounds on critical visibility for certifying genuine measurement resources while maintaining computational efficiency (via SDP).
Operational vs. Geometric Trade-offs: The paper highlights a trade-off: $n$ -simulability is operationally well-defined but non-convex and hard to characterize; $n$ -wise compatibility is geometrically clear and convex but may require operational resources (like noise-free measurements to simulate noisy ones) that seem counter-intuitive in a strict simulation context.

The authors conclude that their work guides future research by clarifying which generalization is appropriate for specific applications and by identifying open questions, such as the device-independent certification of $n$ -copy incompatibility and the existence of other operationally relevant generalizations.

Technical Summary: Strict Hierarchy between nnn-wise Measurement Simulability, Compatibility Structures, and Multi-copy Compatibility