Bell-Matching Certification (BM-Cert) Overview

• Bell-Matching Certification (BM-Cert) is a protocol for verifying n-qubit GHZ states using disjoint Bell-basis measurements with an additional single-qubit X measurement when n is odd.
• It employs quasi-perfect matchings to strategically pair qubits, achieving perfect completeness and a spectral gap that scales as O(1/n), approaching ideal projector behavior as n increases.
• BM-Cert serves as a versatile template for certifying quantum resources, extending to channel verification and randomness certification, while improving copy complexity and operational optimality.

Bell-Matching Certification (BM-Cert) denotes, in its most concrete formulation, a single-copy verification protocol for the $n$-qubit Greenberger--Horne--Zeilinger state that uses only disjoint two-qubit Bell-basis measurements, together with one single-qubit $X$-basis measurement when $n$ is odd (Cha et al., 8 Jun 2026). Its defining feature is that a restricted measurement model nevertheless yields perfect completeness and a verification spectral gap

$\nu_{\mathrm{BM}}(n)=1-O(1/n),$

so the protocol becomes asymptotically close to the ideal projective verifier for $|G_n\rangle$ as $n$ grows (Cha et al., 8 Jun 2026). In related Bell-based certification literature, the same label is also used more broadly for a family of procedures that match observed Bell-type data to an ideal reference model and output certified guarantees about states, measurements, channels, or randomness (Paul et al., 26 May 2025).

1. Verification-theoretic setting

The target state in the GHZ instantiation of BM-Cert is

$$|G_n\rangle:=\frac{|0^n\rangle+|1^n\rangle}{\sqrt{2}},$$

which satisfies

$$X^{\otimes n}|G_n\rangle=|G_n\rangle,\qquad Z_iZ_j|G_n\rangle=|G_n\rangle\quad\forall i\neq j.$$

For a general randomized verification strategy with pass effects $E_s$ chosen with probabilities $p_s$, the verification operator is

$X$0

If $X$1, then the second eigenvalue is

$X$2

and the verification spectral gap is

$X$3

Perfect completeness means $X$4. A standard bound used in the BM-Cert analysis is

$X$5

so if $X$6, then $X$7 (Cha et al., 8 Jun 2026).

This places BM-Cert in the general verification framework in which the ideal projector

$X$8

is copy-optimal, with spectral gap $X$9, but is often experimentally unrealistic. BM-Cert is designed to approach that benchmark while remaining within a measurement model restricted to disjoint Bell measurements and, for odd $n$0, one additional single-qubit $n$1-measurement (Cha et al., 8 Jun 2026).

2. Protocol definition for GHZ certification

BM-Cert is built from quasi-perfect matchings on the qubit index set $n$2. If $n$3 is even, a quasi-perfect matching is a perfect matching; if $n$4 is odd, it is a near-perfect matching consisting of $n$5 disjoint pairs and one singleton. For a matching $n$6, the set of pairs is denoted $n$7, and for odd $n$8 the unique singleton is $n$9 (Cha et al., 8 Jun 2026).

On one copy of the state, BM-Cert samples a uniformly random quasi-perfect matching $\nu_{\mathrm{BM}}(n)=1-O(1/n),$0. For each $\nu_{\mathrm{BM}}(n)=1-O(1/n),$1, it performs a Bell-basis measurement, equivalently a joint measurement of the commuting observables

$\nu_{\mathrm{BM}}(n)=1-O(1/n),$2

with outcomes $\nu_{\mathrm{BM}}(n)=1-O(1/n),$3. If $\nu_{\mathrm{BM}}(n)=1-O(1/n),$4 is odd, it additionally measures $\nu_{\mathrm{BM}}(n)=1-O(1/n),$5 on the unmatched qubit $\nu_{\mathrm{BM}}(n)=1-O(1/n),$6, with outcome $\nu_{\mathrm{BM}}(n)=1-O(1/n),$7. Acceptance requires

$\nu_{\mathrm{BM}}(n)=1-O(1/n),$8

together with the global $\nu_{\mathrm{BM}}(n)=1-O(1/n),$9-parity condition

$|G_n\rangle$0

or

$|G_n\rangle$1

(Cha et al., 8 Jun 2026).

In operator form, for a pair $|G_n\rangle$2,

$|G_n\rangle$3

and the pass projector associated with $|G_n\rangle$4 is

$|G_n\rangle$5

The average verification operator is therefore

$|G_n\rangle$6

For every quasi-perfect matching $|G_n\rangle$7,

$|G_n\rangle$8

so BM-Cert has perfect completeness (Cha et al., 8 Jun 2026).

3. Spectral structure and near-projective behavior

The spectral analysis of BM-Cert is carried out in the GHZ basis

$|G_n\rangle$9

where $n$0, $n$1, and $n$2. These vectors satisfy

$n$3

Hence each $n$4 is a simultaneous eigenvector of all operators appearing in $n$5 (Cha et al., 8 Jun 2026).

The corresponding eigenvalue of $n$6 is

$n$7

Thus, for $n$8, the eigenvalue is the probability that a random quasi-perfect matching avoids the cut determined by the subset $n$9. The entire soundness analysis reduces to bounding this cut-avoidance probability (Cha et al., 8 Jun 2026).

From the combinatorics of perfect and near-perfect matchings, the second eigenvalue is

$$|G_n\rangle:=\frac{|0^n\rangle+|1^n\rangle}{\sqrt{2}},$$0

and therefore

$$|G_n\rangle:=\frac{|0^n\rangle+|1^n\rangle}{\sqrt{2}},$$1

This is the precise sense in which BM-Cert is near-projective: the nontrivial spectrum on the orthogonal complement of $$|G_n\rangle:=\frac{|0^n\rangle+|1^n\rangle}{\sqrt{2}},$$2 collapses to $$|G_n\rangle:=\frac{|0^n\rangle+|1^n\rangle}{\sqrt{2}},$$3, so $$|G_n\rangle:=\frac{|0^n\rangle+|1^n\rangle}{\sqrt{2}},$$4 approaches the ideal projector asymptotically (Cha et al., 8 Jun 2026).

The same analysis yields the standard copy-complexity scaling

$$|G_n\rangle:=\frac{|0^n\rangle+|1^n\rangle}{\sqrt{2}},$$5

for certifying infidelity at least $$|G_n\rangle:=\frac{|0^n\rangle+|1^n\rangle}{\sqrt{2}},$$6 with significance level $$|G_n\rangle:=\frac{|0^n\rangle+|1^n\rangle}{\sqrt{2}},$$7. Since $$|G_n\rangle:=\frac{|0^n\rangle+|1^n\rangle}{\sqrt{2}},$$8, BM-Cert becomes asymptotically copy-optimal within its measurement model (Cha et al., 8 Jun 2026).

4. Optimality and comparison with local verification

BM-Cert is not only asymptotically close to the ideal projector; within the class of perfect-completeness Bell-matching strategies built from quasi-perfect matchings, Bell measurements on all matched pairs, one $$|G_n\rangle:=\frac{|0^n\rangle+|1^n\rangle}{\sqrt{2}},$$9-measurement on the singleton when $$X^{\otimes n}|G_n\rangle=|G_n\rangle,\qquad Z_iZ_j|G_n\rangle=|G_n\rangle\quad\forall i\neq j.$$0 is odd, and arbitrary classical post-processing of the resulting outcomes, it is optimal. The argument is operator-theoretic: for each fixed matching $$X^{\otimes n}|G_n\rangle=|G_n\rangle,\qquad Z_iZ_j|G_n\rangle=|G_n\rangle\quad\forall i\neq j.$$1, every outcome accepted by BM-Cert occurs with strictly positive probability on $$X^{\otimes n}|G_n\rangle=|G_n\rangle,\qquad Z_iZ_j|G_n\rangle=|G_n\rangle\quad\forall i\neq j.$$2, so any other perfect-completeness strategy using the same measurement must have pass effect $$X^{\otimes n}|G_n\rangle=|G_n\rangle,\qquad Z_iZ_j|G_n\rangle=|G_n\rangle\quad\forall i\neq j.$$3. Averaging then forces

$$X^{\otimes n}|G_n\rangle=|G_n\rangle,\qquad Z_iZ_j|G_n\rangle=|G_n\rangle\quad\forall i\neq j.$$4

and BM-Cert attains these minima (Cha et al., 8 Jun 2026).

A central comparison is with local Pauli GHZ verification, whose optimal spectral gap remains $$X^{\otimes n}|G_n\rangle=|G_n\rangle,\qquad Z_iZ_j|G_n\rangle=|G_n\rangle\quad\forall i\neq j.$$5. BM-Cert exceeds this for odd $$X^{\otimes n}|G_n\rangle=|G_n\rangle,\qquad Z_iZ_j|G_n\rangle=|G_n\rangle\quad\forall i\neq j.$$6 and even $$X^{\otimes n}|G_n\rangle=|G_n\rangle,\qquad Z_iZ_j|G_n\rangle=|G_n\rangle\quad\forall i\neq j.$$7, and the improvement grows with $$X^{\otimes n}|G_n\rangle=|G_n\rangle,\qquad Z_iZ_j|G_n\rangle=|G_n\rangle\quad\forall i\neq j.$$8 (Cha et al., 8 Jun 2026).

Measurement model	$$X^{\otimes n}|G_n\rangle=|G_n\rangle,\qquad Z_iZ_j|G_n\rangle=|G_n\rangle\quad\forall i\neq j.$$9	$E_s$0
Unrestricted projector	$E_s$1	$E_s$2
Optimal local Pauli (GHZ)	$E_s$3	$E_s$4
BM-Cert, even $E_s$5	$E_s$6	$E_s$7
BM-Cert, odd $E_s$8	$E_s$9	$p_s$0

This comparison isolates the protocol’s main structural claim: allowing only disjoint two-qubit entangling measurements already changes the asymptotic verification landscape. Local product-measurement protocols remain bounded away from projective verification, whereas BM-Cert approaches it (Cha et al., 8 Jun 2026).

5. Broader uses of BM-Cert as a Bell-based certification template

Beyond the GHZ verification protocol, related work uses BM-Cert as a general Bell-based certification architecture in which one observes Bell-type correlations $p_s$1, matches them to an ideal reference model, and outputs certified guarantees about states, measurements, or randomness. In the chained-Bell self-testing setting, the proposed BM-Cert workflow takes the chained functional

$p_s$2

as a matching score; a sum-of-squares decomposition supplies witness operators $p_s$3, a dimension-independent quantum bound

$p_s$4

explicit robustness bounds $p_s$5 and $p_s$6 for state and observables, and analytic min-entropy formulas for one-bit and two-bit device-independent randomness, including the special odd-$p_s$7 setting with $p_s$8 bits (Paul et al., 26 May 2025).

In a different direction, Bell-theorem-based channel certification has been explicitly interpreted as a BM-Cert framework for the building blocks of quantum computers. There the ideal object is a target channel $p_s$9, encoded by its input and output Choi states, and the central certification bound is

$X$00

which converts Bell-certified input and output state fidelities into a device-independent channel fidelity, with an accompanying diamond-norm estimate

$X$01

This extends Bell matching from static resources to coherent operations such as identity channels, transmission lines, and controlled-unitary gates (Sekatski et al., 2018).

Semi-quantum and measurement-device-independent variants interpret BM-Cert as simultaneous matching between entangled sources and Bell-type measurements. One construction uses a bounded-dimensional semi-quantum game whose optimal score

$X$02

certifies, up to local unitaries, a target pure two-qubit entangled state and Bell-state projectors; a dual entanglement-swapping formulation certifies an entangled projector and Bell-state sources from the same score value (Zhang et al., 2019). Closely related device-independent certification of Bell-state measurements defines a deterministic BSM fidelity

$X$03

and lower-bounds it by

$X$04

while partial and probabilistic Bell measurements are handled through conditional branch fidelities and a certified success parameter $X$05 (Bancal et al., 2018).

6. Generalizations, limitations, and open directions

The GHZ protocol leaves several open problems. The complete analysis assumes arbitrary pairings on the complete interaction graph; restricted connectivity graphs require new combinatorial estimates of cut-avoidance probabilities. The model is single-copy and excludes collective or memory-assisted verification, so its relation to more general two-local or memory-enabled strategies remains unresolved. It is also unknown whether BM-Cert is optimal among all perfect-completeness verification protocols limited only by at-most-two-local measurements, rather than by the more specific Bell-matching structure (Cha et al., 8 Jun 2026).

Related BM-Cert-style developments indicate several directions for expansion. ROCN Bell inequalities provide explicit, analytically solvable self-tests for entire families of Clifford or Majorana generators, with the quantum bound $X$06 and a constructive symmetric-spanning design of coefficient matrices in arbitrary even dimension (Konderak et al., 2 Dec 2025). A companion line of work shows that elegant-like Bell inequalities can certify Clifford/Majorana structures while requiring an enlarged notion of self-testing equivalence that includes a partial-transposition symmetry beyond local isometries and complex conjugation (Michalski et al., 21 Nov 2025). Sequential Bell tests extend Bell-based certification from observables to measurement instruments by bounding the number of POVM elements used in degeneracy-breaking measurements through trade-offs between successive CHSH violations (Pearce-Crump, 2023).

Other extensions shift the certified object from state fidelity to randomness or network structure. Device-independent Shannon-entropy certification uses NPA-constrained optimization to lower-bound

$X$07

from Bell-inequality violations, and shows that the most useful Bell inequality depends strongly on the noise regime; $X$08 dominates at low noise, while CHSH becomes preferable at higher noise (Okuła et al., 8 May 2025). Broadcast Bell scenarios provide DI and semi-DI entanglement certification through Bell or steering violations after one subsystem is broadcast, yielding Werner-state certification essentially across the full entangled range and activation of hidden nonlocality and steering (Boghiu et al., 2021).

Taken together, these developments suggest two coexisting meanings of BM-Cert. In the narrow sense, it is the near-projective GHZ verifier based on disjoint Bell measurements. In the broader sense, it denotes a Bell-matching paradigm: choose a Bell or semi-quantum statistic, match the observed data to an ideal reference model, and extract certified guarantees about the underlying quantum resource. The GHZ protocol is the most explicit realization of that paradigm to date, and its asymptotically projective behavior makes it a reference point for future Bell-based certification schemes (Cha et al., 8 Jun 2026).