Quantum Subspace Verification

• Quantum subspace verification is a framework that determines if a quantum state lies within a target subspace using methods like hypothesis testing and spectral gap analysis.
• It leverages local Pauli measurements and adaptive LOCC protocols to optimize sample complexity and practical certification under noise.
• The approach underpins error-correction, stabilizer code verification, and data hiding, linking theoretical guarantees with experimental feasibility.

Quantum subspace verification is the task of deciding whether a quantum state lies in a target subspace $V\subseteq H$, rather than verifying equality with a single target pure state. In the current literature, the target subspace may be a stabilizer code space, a genuinely entangled subspace, a symmetry sector, a computational subspace induced by an encoding, or a constraint-satisfying subspace. The subject has developed into a distinct framework that combines hypothesis testing, operator design, and restricted-measurement analysis, with particular emphasis on local Pauli measurements, adaptive LOCC protocols, and experimentally realistic certification of noisy mixed states (Zheng et al., 2024, Chen et al., 2024, Akibue et al., 1 Sep 2025).

1. Definition and statistical formulation

A standard formulation fixes a target subspace $\mathcal V\subseteq \mathcal H$ with projector

$\Pi := \sum_j |\psi_j\rangle\langle \psi_j|,$

where $\{|\psi_j\rangle\}_j$ is an orthonormal basis of $\mathcal V$. The verification problem is then posed as a binary distinction between a good case, in which every tested sample satisfies $\operatorname{Tr}[\Pi \sigma_i]=1$, and a bad case, in which every sample satisfies $\operatorname{Tr}[\Pi \sigma_i]\le 1-\epsilon$ for some tolerance $\epsilon>0$. Pure-state verification is recovered as the special case $\dim V=1$ (Zheng et al., 2024, Akibue et al., 1 Sep 2025).

A verification strategy is specified by a family of POVM test operators $M\in\mathcal M$, sampled with probabilities $\mathcal V\subseteq \mathcal H$0, and summarized by the verification operator

$\mathcal V\subseteq \mathcal H$1

The acceptance probability on $\mathcal V\subseteq \mathcal H$2 is $\mathcal V\subseteq \mathcal H$3. For a valid subspace verifier, perfect completeness requires

$\mathcal V\subseteq \mathcal H$4

equivalently $\mathcal V\subseteq \mathcal H$5. Soundness is governed by the restriction of $\mathcal V\subseteq \mathcal H$6 to the orthogonal complement,

$\mathcal V\subseteq \mathcal H$7

with worst-case bad-case acceptance

$\mathcal V\subseteq \mathcal H$8

Defining the spectral gap

$\mathcal V\subseteq \mathcal H$9

one obtains

$\Pi := \sum_j |\psi_j\rangle\langle \psi_j|,$0

Within this framework, maximizing $\Pi := \sum_j |\psi_j\rangle\langle \psi_j|,$1 minimizes the number of copies needed for confidence $\Pi := \sum_j |\psi_j\rangle\langle \psi_j|,$2 (Zheng et al., 2024).

A complementary formulation emphasizes subspace fidelity. For a projector $\Pi := \sum_j |\psi_j\rangle\langle \psi_j|,$3 onto $\Pi := \sum_j |\psi_j\rangle\langle \psi_j|,$4, the subspace fidelity is

$\Pi := \sum_j |\psi_j\rangle\langle \psi_j|,$5

In the hypothesis-testing version for quantum error-correction subspaces, the good device satisfies $\Pi := \sum_j |\psi_j\rangle\langle \psi_j|,$6 and the bad device satisfies $\Pi := \sum_j |\psi_j\rangle\langle \psi_j|,$7, where $\Pi := \sum_j |\psi_j\rangle\langle \psi_j|,$8. If

$\Pi := \sum_j |\psi_j\rangle\langle \psi_j|,$9

with $\{|\psi_j\rangle\}_j$0 and $\{|\psi_j\rangle\}_j$1 the two relevant spectral gaps outside the target subspace, then the required number of rounds is expressed through a Bernoulli KL divergence and scales as $\{|\psi_j\rangle\}_j$2 for small $\{|\psi_j\rangle\}_j$3. If the verification operator has maximum eigenvalue $\{|\psi_j\rangle\}_j$4, the sample complexity reverts to $\{|\psi_j\rangle\}_j$5, reflecting the loss of perfect acceptance for ideal code states (Chen et al., 2024).

2. Stabilizer-code subspaces and local-measurement protocols

The most developed concrete setting is the verification of stabilizer code spaces. For an $\{|\psi_j\rangle\}_j$6 stabilizer code, the code space is the $\{|\psi_j\rangle\}_j$7 eigenspace of a stabilizer group $\{|\psi_j\rangle\}_j$8, generated by $\{|\psi_j\rangle\}_j$9 independent stabilizer generators $\mathcal V$0. Verifying the stabilizer subspace is equivalent to certifying the logical qubits encoded by the code. The central practical constraint is that the protocols are required to use only local Pauli measurements, be non-adaptive, and work on mixed states (Zheng et al., 2024).

Two universal stabilizer strategies are immediate. Strategy I samples a non-identity stabilizer $\mathcal V$1 uniformly, measures it, and accepts on outcome $\mathcal V$2. Its verification operator is

$\mathcal V$3

with spectral gap

$\mathcal V$4

so that

$\mathcal V$5

This is near-global optimal in copy complexity but requires $\mathcal V$6 measurement settings. Strategy II samples a generator $\mathcal V$7 uniformly and uses

$\mathcal V$8

hence

$\mathcal V$9

It uses only $\operatorname{Tr}[\Pi \sigma_i]=1$0 settings but needs more copies (Zheng et al., 2024).

Additional code structure yields sharper protocols. For graph code subspaces, a derived graph $\operatorname{Tr}[\Pi \sigma_i]=1$1 on the generators is covered by independent sets $\operatorname{Tr}[\Pi \sigma_i]=1$2, giving

$\operatorname{Tr}[\Pi \sigma_i]=1$3

Since $\operatorname{Tr}[\Pi \sigma_i]=1$4, the coloring strategy uses no more and often fewer settings than generator-based verification. For CSS codes with $\operatorname{Tr}[\Pi \sigma_i]=1$5, the $\operatorname{Tr}[\Pi \sigma_i]=1$6- and $\operatorname{Tr}[\Pi \sigma_i]=1$7-checks factorize, and the XZ strategy chooses $\operatorname{Tr}[\Pi \sigma_i]=1$8 uniformly, measures $\operatorname{Tr}[\Pi \sigma_i]=1$9, and accepts iff all checks of that type return $\operatorname{Tr}[\Pi \sigma_i]\le 1-\epsilon$0. Its verification operator is

$\operatorname{Tr}[\Pi \sigma_i]\le 1-\epsilon$1

with

$\operatorname{Tr}[\Pi \sigma_i]\le 1-\epsilon$2

For dual-containing CSS codes with $\operatorname{Tr}[\Pi \sigma_i]\le 1-\epsilon$3, the XYZ strategy samples uniformly from $\operatorname{Tr}[\Pi \sigma_i]\le 1-\epsilon$4, achieves

$\operatorname{Tr}[\Pi \sigma_i]\le 1-\epsilon$5

and reduces the copy cost by $\operatorname{Tr}[\Pi \sigma_i]\le 1-\epsilon$6 relative to the XZ strategy (Zheng et al., 2024).

A closely related framework for error-correction benchmarking defines verification operators for stabilizer codes and QLDPC codes in terms of subspace fidelity rather than perfect-membership testing. For stabilizer codes, measuring all stabilizers gives $\operatorname{Tr}[\Pi \sigma_i]\le 1-\epsilon$7 with $\operatorname{Tr}[\Pi \sigma_i]\le 1-\epsilon$8, whereas measuring only generators gives $\operatorname{Tr}[\Pi \sigma_i]\le 1-\epsilon$9, $\epsilon>0$0, where $\epsilon>0$1. A chromatic construction based on the bit-wise commutativity graph $\epsilon>0$2 yields

$\epsilon>0$3

with $\epsilon>0$4. For CSS codes, including surface codes, toric codes, and hypergraph product codes, $\epsilon>0$5, so both the setting number and the sample complexity become independent of $\epsilon>0$6 up to constants. For generic QLDPC codes with local projector support size $\epsilon>0$7, the support graph has degree at most $\epsilon>0$8, which yields at most $\epsilon>0$9 measurement settings in the chromatic construction (Chen et al., 2024).

Subspace family	Measurement settings	Copy/sample complexity
Global optimum	1	$\dim V=1$0
Stabilizer code, full stabilizer group	$\dim V=1$1	$\dim V=1$2
Stabilizer code, generators	$\dim V=1$3	$\dim V=1$4
Graph code coloring	$\dim V=1$5	$\dim V=1$6
CSS code, XZ strategy	2	$\dim V=1$7
Dual-containing CSS code, XYZ strategy	3	$\dim V=1$8

These results establish a recurring pattern: additional algebraic structure decreases both the number of measurement settings and the required number of copies, and several local-measurement protocols approach the global optimum under realistic experimental constraints (Zheng et al., 2024, Chen et al., 2024).

3. Entangled subspaces and local-verifiability limits

Quantum subspace verification is not restricted to code spaces. A prominent example is the three-qubit GHZ-W genuinely entangled subspace

$\dim V=1$9

with

$M\in\mathcal M$0

For this target, efficient verification requires adaptive local measurements and one-way classical communication. The adaptive framework measures one qubit first, then chooses a conditional two-qubit test on the remaining pair. The general form is

$M\in\mathcal M$1

Two concrete protocols are given: an XZ strategy and a rotation strategy (Zheng et al., 2024).

The XZ strategy uses one $M\in\mathcal M$2-based adaptive test and three $M\in\mathcal M$3-based adaptive tests, one for each choice of first measured qubit. Its verification operator is

$M\in\mathcal M$4

Numerical optimization yields

$M\in\mathcal M$5

hence

$M\in\mathcal M$6

The rotation strategy exploits permutation symmetry and local phase rotations $M\in\mathcal M$7 and $M\in\mathcal M$8. Averaging over three qubit choices and six rotated variants produces a ten-test family with exact spectral gap

$M\in\mathcal M$9

maximized at

$\mathcal V\subseteq \mathcal H$00

The resulting sample complexity is

$\mathcal V\subseteq \mathcal H$01

This is significantly closer to the global optimum than the XZ strategy while remaining local and adaptive (Zheng et al., 2024).

The same work also identifies an intrinsic limitation of local subspace verification through a complete classification of two-dimensional two-qubit subspaces. Some are unverifiable by LOCC because their orthogonal complement contains only one product state. For such a subspace, the best possible local test has zero spectral gap,

$\mathcal V\subseteq \mathcal H$02

Other subspaces are verifiable with two tests, and perfectly verifiable subspaces admit a single local test operator. A common misconception is therefore that subspace verification simply generalizes state verification without changing locality properties. The classification shows that local certifiability can fail at the level of subspaces even when the constituent states are individually meaningful entanglement resources (Zheng et al., 2024).

4. Restricted measurements, visibility, and duality with data hiding

A more abstract line of work analyzes subspace verification through restricted-measurement distinguishability. For a measurement class $\mathcal V\subseteq \mathcal H$03 and nontrivial proper subspace $\mathcal V\subseteq \mathcal H$04, the central quantity is the $\mathcal V\subseteq \mathcal H$05-visibility

$\mathcal V\subseteq \mathcal H$06

which also admits the minimax form

$\mathcal V\subseteq \mathcal H$07

For universal strategies satisfying $\mathcal V\subseteq \mathcal H$08, the limiting quantity $\mathcal V\subseteq \mathcal H$09 is obtained as $\mathcal V\subseteq \mathcal H$10 when $\mathcal V\subseteq \mathcal H$11 is informationally complete. The operational content is that sample complexity for sequential measurements lies between a lower bound scaling like $\mathcal V\subseteq \mathcal H$12 and an upper bound scaling like $\mathcal V\subseteq \mathcal H$13, up to logarithms and constants (Akibue et al., 1 Sep 2025).

The same framework introduces the $\mathcal V\subseteq \mathcal H$14-distinguishability ratio $\mathcal V\subseteq \mathcal H$15 for quantum data hiding and proves a duality with subspace verification. For a subspace $\mathcal V\subseteq \mathcal H$16,

$\mathcal V\subseteq \mathcal H$17

More strongly, for informationally complete $\mathcal V\subseteq \mathcal H$18 and rank bound $\mathcal V\subseteq \mathcal H$19,

$\mathcal V\subseteq \mathcal H$20

Thus the hardest subspaces to verify and the most secure states for data hiding are the same extremal objects. This establishes a geometric correspondence between verification hardness and hiding security under restricted measurements (Akibue et al., 1 Sep 2025).

The theory yields explicit protocols and bounds. Under non-adaptive single-qudit local measurements on $\mathcal V\subseteq \mathcal H$21,

$\mathcal V\subseteq \mathcal H$22

implying

$\mathcal V\subseteq \mathcal H$23

samples for arbitrary $\mathcal V\subseteq \mathcal H$24. For the symmetric subspace $\mathcal V\subseteq \mathcal H$25,

$\mathcal V\subseteq \mathcal H$26

The associated protocol applies Haar-random local unitaries, measures in the computational basis, and accepts iff all outcomes are equal, implementing

$\mathcal V\subseteq \mathcal H$27

For qubits this gives $\mathcal V\subseteq \mathcal H$28. Under PPT measurements,

$\mathcal V\subseteq \mathcal H$29

so any multipartite pure state can be verified with constant sample complexity independent of $\mathcal V\subseteq \mathcal H$30 and $\mathcal V\subseteq \mathcal H$31, and the universal PPT strategy

$\mathcal V\subseteq \mathcal H$32

achieves $\mathcal V\subseteq \mathcal H$33, with $\mathcal V\subseteq \mathcal H$34 proved optimal. For 4-design POVMs,

$\mathcal V\subseteq \mathcal H$35

again implying $\mathcal V\subseteq \mathcal H$36-type sample complexity. Stabilizer POVMs give analogous $\mathcal V\subseteq \mathcal H$37 protocols (Akibue et al., 1 Sep 2025).

5. Verification as correction, mitigation, and reduced-space control

In several applications, subspace verification is not only a certification primitive but also the front end of correction or mitigation. Quantum subspace correction constructs stabilizer-like operators for a constraint-satisfying subspace and then uses syndrome extraction to detect and repair violations. For Independent Set on a graph $\mathcal V\subseteq \mathcal H$38, each edge $\mathcal V\subseteq \mathcal H$39 has local legality subspace

$\mathcal V\subseteq \mathcal H$40

with stabilizer

$\mathcal V\subseteq \mathcal H$41

More generally, for a Boolean constraint $\mathcal V\subseteq \mathcal H$42, the stabilizer-like operator is

$\mathcal V\subseteq \mathcal H$43

and ancilla-assisted syndrome extraction is implemented by

$\mathcal V\subseteq \mathcal H$44

The operational loop is explicit: measure syndromes, infer violations, apply recovery, and repeat until the target subspace is reached. In the Independent Set example, the violating region is reset locally, and the protocol becomes a quantum analogue of partial rejection sampling, yielding exact uniform or weighted independent-set distributions when it terminates (Pawlak et al., 2023).

In near-term fermionic simulation, the relevant target is a stabilizer-symmetric computational subspace defined by the fermion-to-qubit encoding together with optional conserved spin-parity symmetries. The projector is written as

$\mathcal V\subseteq \mathcal H$45

Symmetry verification and post-selection discard shots whose propagated noise anticommutes with at least one stabilizer, while Subspace Noise Tailoring applies probabilistic error cancellation only to the undetectable errors. If $\mathcal V\subseteq \mathcal H$46 denotes the undetectable errors at layer $\mathcal V\subseteq \mathcal H$47, the restricted inverse noise map is

$\mathcal V\subseteq \mathcal H$48

The residual bias scales as

$\mathcal V\subseteq \mathcal H$49

while the method preserves the low cost of subspace filtering. The efficacy depends strongly on the encoding: local encodings such as LE, PA, and HX provide many local stabilizers and large detectable-noise fractions, unlike JW, whose global stabilizer is less suitable for scalable parity-check verification (Papič et al., 14 Mar 2025).

A further operational use appears in contextual-subspace VQE for the Kagome Heisenberg model. There the reduced Hilbert space is defined by a commuting set $\mathcal V\subseteq \mathcal H$50 of exact or approximate stabilizers, with projector

$\mathcal V\subseteq \mathcal H$51

followed by Clifford rotation, projection, and partial trace: $\mathcal V\subseteq \mathcal H$52 Approximate stabilizers are ranked by a weighted commutation score $\mathcal V\subseteq \mathcal H$53, and DMRG wavefunctions are used to bias the stabilizer choice toward the desired low-energy sector. The reduced 5-qubit Hamiltonian deliberately retains a $\mathcal V\subseteq \mathcal H$54 symmetry $\mathcal V\subseteq \mathcal H$55, enabling hardware symmetry verification by post-selecting on the $\mathcal V\subseteq \mathcal H$56 eigensector of $\mathcal V\subseteq \mathcal H$57. The reported mitigation stack REM+SV+ZNE reduces the final error ratio from about $\mathcal V\subseteq \mathcal H$58 to $\mathcal V\subseteq \mathcal H$59, which suggests that retaining a verifiable symmetry sector can materially improve reduced-space computations (Weaving et al., 14 Jun 2025).

6. Formal extensions and neighboring verification paradigms

Subspace verification also appears as a logical primitive in quantum program verification. In measurement-based verification of quantum Markov chains, earlier subspace-based temporal logic is treated as a special case of a broader measurement-based linear-time temporal logic. A subspace proposition corresponds to a projection $\mathcal V\subseteq \mathcal H$60 onto $\mathcal V\subseteq \mathcal H$61, with

$\mathcal V\subseteq \mathcal H$62

The quantum Markov chain model $\mathcal V\subseteq \mathcal H$63 is then analyzed through spectral properties of the super-operator matrix

$\mathcal V\subseteq \mathcal H$64

and approximate verification is reduced to $\mathcal V\subseteq \mathcal H$65-regular model checking via periodic stability and symbolic neighborhoods of the asymptotic cycle. This line of work does not implement subspace verification as a laboratory certification protocol; rather, it embeds subspace membership into a temporal-logic semantics for quantum dynamics (Guan et al., 2024).

A distinct but related generalization lifts symmetry verification from states to channels. Symmetric channel verification assumes a known symmetry operator $\mathcal V\subseteq \mathcal H$66 commuting with the ideal channel and inserts coherent symmetry-sector tests around the noisy implementation. With symmetry projectors $\mathcal V\subseteq \mathcal H$67, the phase-tagging operator is

$\mathcal V\subseteq \mathcal H$68

and the detection supermap becomes

$\mathcal V\subseteq \mathcal H$69

This can be interpreted as a channel-level analogue of subspace or symmetry verification, because it enforces the symmetry-preserving block structure of the ideal channel rather than the symmetry of a specific input state. At the same time, it is not a generic replacement for quantum subspace verification: it requires known channel symmetries, targets only symmetry-breaking noise, and in the virtual implementation purifies expectation values rather than directly output states. In Clifford-only settings under Pauli symmetry, the corresponding detection and correction criteria are proved optimal for the analyzed Hamiltonian-simulation scenario (Tsubouchi et al., 17 Mar 2025).

Taken together, these developments define quantum subspace verification as a family of verification tasks rather than a single protocol. The common core is the certification of membership in a known subspace or sector under restricted measurements. The main divergences concern what is being verified—states, code spaces, entangled subspaces, constraint subspaces, computational subspaces, temporal trajectories, or symmetric channels—and what follows from successful verification: statistical acceptance, fidelity bounds, rejection of bad shots, local recovery, reduced-space simulation, or channel purification. The strongest current results are concentrated in structured settings, especially stabilizer and CSS code spaces, whereas entangled-subspace verification and local-verifiability obstructions indicate that no comparably uniform local theory exists for arbitrary target subspaces (Zheng et al., 2024, Zheng et al., 2024, Akibue et al., 1 Sep 2025).