Efficient Verification of Entangled Measurements with Local States

Technical Summary: Efficient Verification of Entangled Measurements with Local States

Problem Statement
Quantum measurement devices serve as the critical interface between quantum systems and classical decision-making, enabling tasks such as quantum teleportation, dense coding, and fault-tolerant computation. However, measurement hardware is inherently noisy, and unverified devices can invalidate experimental outcomes. While full detector tomography exists, it is computationally intensive and time-consuming. Existing verification frameworks for quantum states (QSV) and processes do not directly apply to measurement verification (QMV) because a faulty measurement is described by a Positive Operator-Valued Measure (POVM) where elements are jointly constrained by the completeness relation ($\sum M_\theta = 1$). This allows an adversary to redistribute probability among outcomes, making the worst-case passing probability distinct from standard state verification. Furthermore, verifying entangled measurements often requires preparing highly entangled test states, which is experimentally challenging. This work addresses the need for an efficient QMV framework that relies solely on local state preparations.

Methodology
The authors propose a general framework for QMV based on local product states. The core methodology involves:

1. Formulation of QMV: The task is defined as distinguishing between a "Good" case (the device implements the target von Neumann measurement $P$) and a "Bad" case (the device implements a faulty POVM $M$ with measurement fidelity $F(P, M) \le 1 - \varepsilon$). A protocol $S$ samples local test states $\rho_x$ and defines an "accept set" of outcomes $P(\rho_x)$. The device passes a round if the observed outcome falls within this set. The goal is to minimize the single-round worst-case passing probability $P(S, \varepsilon)$ for bad devices.
2. Symmetry Reduction: The paper introduces two symmetry conditions for the target measurement $P$:
   • Local Transitivity: A finite group $G$ acts transitively on the measurement outcomes via local unitary representations.
   • Irreducibility: The stabilizer of a single outcome acts irreducibly on the corresponding basis state and its orthogonal complement.
     Under these conditions, the authors prove that the constrained QMV optimization problem reduces to a Quantum State Verification (QSV) problem for a single representative basis state. Specifically, the design of an efficient local QMV protocol is equivalent to optimizing a homogeneous verification operator for one representative state.
3. Homogeneous Protocols: The framework focuses on constructing "homogeneous" protocols where the verification operator for each outcome $\theta$ takes the form $\Omega_\theta = |\psi_\theta\rangle\langle\psi_\theta| + \beta(1 - |\psi_\theta\rangle\langle\psi_\theta|)$. This structure allows for closed-form expressions of success probabilities and sample complexities.

Key Contributions and Results
The paper applies this framework to four representative classes of measurements, deriving explicit local protocols, verification operators, and sample complexities:

• Generalized Bell Measurements (GBM): For $d$-dimensional qudits (where $d$ is prime), the GBM is shown to be locally transitive and irreducible. The optimal local protocol achieves a sample complexity of $N \approx \frac{d+1}{d} \frac{1}{\varepsilon} \ln \frac{1}{\delta}$. The locality constraint incurs only a constant factor penalty of $(d+1)/d$ compared to the unconstrained optimal protocol. For two qubits ($d=2$), this factor is $3/2$.
• Single-Parameter Measurements on Two Qubits: A family of measurements interpolating between product basis measurements and the Bell measurement is analyzed. The authors construct a symmetric local protocol with a constant success probability factor, yielding a sample complexity of $N \approx \frac{3}{2} \frac{1}{\varepsilon} \ln \frac{1}{\delta}$, matching the Bell measurement scaling.
• Elegant Joint Measurements (EJM): For this partially entangled measurement with tetrahedral marginals, the authors derive a protocol where the parameter $\beta$ depends on the entanglement parameter $\kappa$. The sample complexity varies from $2 \cdot \frac{1}{\varepsilon} \ln \frac{1}{\delta}$ (original EJM) to $\frac{3}{2} \cdot \frac{1}{\varepsilon} \ln \frac{1}{\delta}$ (maximally entangled endpoint).
• Stabilizer State Induced Measurements: For measurements on $n$ qudits induced by stabilizer bases, the framework provides a local protocol with sample complexity scaling as $N \approx \frac{d^n - 1}{d^n - d^{n-1}} \frac{1}{\varepsilon} \ln \frac{1}{\delta}$.

Significance and Claims
The paper claims to establish a "remaining piece of quantum verification theory" alongside state, process, and subspace verification. Its primary significance lies in demonstrating that for a broad class of entangled measurements, locality constraints do not fundamentally degrade verification efficiency; they only introduce a constant factor penalty relative to globally optimal (but experimentally infeasible) protocols.

Key technical achievements include:

• Reducing the complex optimization over faulty POVMs to the well-understood problem of optimizing the second largest eigenvalue of a single verification operator.
• Achieving a sample complexity scaling of $O(1/\varepsilon)$, which is quadratically better than the $O(1/\varepsilon^2)$ scaling of direct fidelity estimation.
• Showing that homogeneous QMV protocols allow for the direct estimation of measurement fidelity from observed passing frequencies, rather than just providing bounds.

The authors note that while the current framework assumes ideal test state preparation and independent and identically distributed (i.i.d.) device behavior, the derived protocols provide a foundational step toward robust verification on practical quantum platforms. Future work is identified as extending these symmetry reduction methods to non-transitive or non-irreducible measurements and incorporating realistic noise models.