A Graph-Theoretic Approach to Quantum Measurement Incompatibility

TL;DR

This work develops a graph-theoretic framework linking quantum measurement incompatibility to anti-commutativity graphs, showing that the incompatibility robust­ness η(G) is a graph invariant determined by the pattern of (anti-)commutation. It derives analytic bounds in terms of the Lovász number, clique number, and fractional chromatic number, and proves tight asymptotics for line-graph observables, including cycles, Johnson graphs, hypercubes, rook’s graphs, and paths. A key bridge is established between measurement incompatibility and spectral graph theory via line graphs, with exact formulas tied to graph energies and skew-energies and conditions tied to weighing/Hadamard-type matrices. The paper then extends the framework to degree-k Majorana observables, showing that merged Johnson graphs J(n,k,L) yield asymptotically tight bounds via the Lovász number, providing insights for partial fermionic tomography and electronic-structure estimation. Overall, the results offer scalable analytic tools for quantifying incompatibility resources in large families of binary quantum observables and reveal deep connections to classical combinatorial objects.

Abstract

Measurement incompatibility--the impossibility of jointly measuring certain quantum observables--is a fundamental resource for quantum information processing. We develop a graph-theoretic framework for quantifying this resource for large families of binary measurements, including Pauli observables on multi-qubit systems and $k$-body Majorana observables on $n$-mode fermionic systems. To each set of observables we associate an anti-commutativity graph, whose vertices represent observables and whose edges indicate pairs that anti-commute. In this representation, the incompatibility robustness--the minimal amount of classical noise required to render the set jointly measurable--becomes a graph invariant. We derive general bounds on this invariant in terms of the Lovász number, clique number, and fractional chromatic number, and show that the Lovász number yields the correct asymptotic scaling for $k$-body Majorana observables. For line graphs $L(G)$, which naturally arise in the characterisation of exactly solvable spin models, we obtain spectral bounds on the robustness expressed through the energy and skew-energy of the underlying graph $G$. These bounds become tight for highly symmetric graphs, leading to closed formulas for several graph families. Finally, we identify structural conditions under which the robustness is determined by a simple function of the graph's maximum degree and the number of vertices and edges, and show that such extremal cases occur only when combinatorial structures such as Hadamard, conference or weighing matrices exist.

Figures (7)

• Figure 1: Example of a six-vertex anti-commutativity graph realised by quadratic and quartic Majorana monomials. Observables anti-commute if and only if they share one or three common Majorana operators from the set $\{\Gamma_j\,|\,j=1,\ldots,11\}$.
• Figure 2: Example illustrating that Prop. \ref{['prop:subgraph']} can yield a tighter bound than Thm. \ref{['thm:lovasz']} via an induced subgraph. Left: the paw graph $G$ on $V=\{1,2,3,4\}$ has $\vartheta(G)=2$, therefore Thm. \ref{['thm:lovasz']} gives $\eta(G)\le 1/\sqrt{2}$. Right: the induced subgraph $G[S]$ for $S=\{1,2,3\}$ is $K_3$ with $\vartheta(G[S])=1$. Therefore, Prop. \ref{['prop:subgraph']} yields $\eta(G)\le 1/\sqrt{3}$, which is tight.
• Figure 3: Examples of $a\!:\!b$--colourings for the cycle graph $C_5$. Left: a $3\!:\!1$ colouring partitions the vertices into three commuting sets (red, blue, green). Right: a fractional $5\!:\!2$ colouring assigns two of five colours (red, blue, green, yellow, pink) to each vertex, with each colour defining a commuting set. A parent POVM implemented by measuring one of the $a$ commuting classes at random jointly measures $\{\mathsf{M}_v^\eta\,|v\in V\}$ with $\eta\in\{1/3,2/5\}$.
• Figure 4: The complete graph $K_5$ (left) and its line graph $L(K_5)$ (right) which is the Johnson graph $J(5,2)$. Each edge $\{u,v\}$ of $K_5$ corresponds to a vertex $\{u,v\}$ of $L(K_5)$; two such vertices are adjacent in $L(K_5)$ if and only if the corresponding edges in $K_5$ are incident.
• Figure 5: The 3-cube $Q_3$ (left) and its line graph $L(Q_3)$ (right).

Theorems & Definitions (78)

• Definition 1
• Proposition 1
• Proposition 2
• proof
• Corollary 1
• proof
• Theorem 1
• proof
• Corollary 2
• proof