Quantum Low-Degree Test

• Quantum Low-Degree Test is a protocol that extends classical low-degree tests to certify near-maximally-entangled quantum states and consistent generalized Pauli measurements.
• It employs low-degree polynomial encodings in both X and Z bases and integrates twisted commutation tests to robustly validate quantum provers’ strategies.
• This method underlies key hardness results in quantum multiplayer games and advances quantum PCP theorems and self-testing within quantum interactive proofs.

A quantum low-degree test (QLDT) is a protocol—extending the classical low-degree test to the quantum regime—that robustly certifies whether quantum provers share a near-maximally-entangled state and implement measurement operations consistent with generalized Pauli operators, via nonlocal games involving low-degree polynomial encodings. QLDTs constitute central technical components in quantum analogues of probabilistically checkable proof (PCP) theorems for QMA, enable robust self-testing of multiqudit entanglement, and underlie hardness results for quantum multiplayer games (Natarajan et al., 2018, Ji et al., 2020).

1. Mathematical Foundations and Generalized Pauli Operators

The classical low-degree test verifies that responses are consistent with evaluations of a global low-degree polynomial. QLDTs operate in Hilbert spaces over finite fields, leveraging generalized Pauli operators over $\mathbb{F}_q$ for $q=p^t$ a prime power:

$X(a) = \sum_{j\in\F_q} |j+a\rangle\langle j|,\quad Z(b)=\sum_{j\in\F_q} \omega^{\operatorname{Tr}(b j)} |j\rangle\langle j|$

with $\omega=e^{2\pi i/p}$ and $\operatorname{Tr}$ the field trace $\F_q\to\F_p$. On $n$ qudits, joint Pauli operations $X(\vec{a}),Z(\vec{b})$ act by tensor product and satisfy the twisted commutation relation: $$X(a)Z(b) = \omega^{-\operatorname{Tr}(a b)} Z(b) X(a)$$ Certification of these relations is critical, as the maximally entangled state $|\text{EPR}_q\rangle^{\otimes n}$ is the unique $q=p^t$0–eigenstate of all $q=p^t$1 and $q=p^t$2 operators (Natarajan et al., 2018).

2. The Quantum Low-Degree Test Protocol

The quantum low-degree test (q-lowdeg) of Natarajan and Vidick (Natarajan et al., 2018) is designed for two non-communicating quantum provers and tests for adherence to ideal Pauli measurements and global entanglement structure using low-degree encodings. The protocol consists of three subtests:

• Low-degree test in the $q=p^t$3 basis: The verifier selects an affine plane $q=p^t$4 and a point $q=p^t$5; the prover measures all qudits in the $q=p^t$6 eigenbasis, encodes the outcome to an $q=p^t$7-variate polynomial $q=p^t$8 of degree $q=p^t$9, and returns restriction $X(a) = \sum_{j\in\F_q} |j+a\rangle\langle j|,\quad Z(b)=\sum_{j\in\F_q} \omega^{\operatorname{Tr}(b j)} |j\rangle\langle j|$0 or $X(a) = \sum_{j\in\F_q} |j+a\rangle\langle j|,\quad Z(b)=\sum_{j\in\F_q} \omega^{\operatorname{Tr}(b j)} |j\rangle\langle j|$1. Responses from both provers are checked on overlaps.
• Low-degree test in the $X(a) = \sum_{j\in\F_q} |j+a\rangle\langle j|,\quad Z(b)=\sum_{j\in\F_q} \omega^{\operatorname{Tr}(b j)} |j\rangle\langle j|$2 basis: Repeats the above with Pauli $X(a) = \sum_{j\in\F_q} |j+a\rangle\langle j|,\quad Z(b)=\sum_{j\in\F_q} \omega^{\operatorname{Tr}(b j)} |j\rangle\langle j|$3 basis measurements, polynomial encoding, and answer consistency checks.
• Twisted-commutation subtest: The verifier samples $X(a) = \sum_{j\in\F_q} |j+a\rangle\langle j|,\quad Z(b)=\sum_{j\in\F_q} \omega^{\operatorname{Tr}(b j)} |j\rangle\langle j|$4 and $X(a) = \sum_{j\in\F_q} |j+a\rangle\langle j|,\quad Z(b)=\sum_{j\in\F_q} \omega^{\operatorname{Tr}(b j)} |j\rangle\langle j|$5. For $X(a) = \sum_{j\in\F_q} |j+a\rangle\langle j|,\quad Z(b)=\sum_{j\in\F_q} \omega^{\operatorname{Tr}(b j)} |j\rangle\langle j|$6, a commutativity test is performed; otherwise, a magic square–type test enforces the twisted commutation $X(a) = \sum_{j\in\F_q} |j+a\rangle\langle j|,\quad Z(b)=\sum_{j\in\F_q} \omega^{\operatorname{Tr}(b j)} |j\rangle\langle j|$7.

The answers require only $X(a) = \sum_{j\in\F_q} |j+a\rangle\langle j|,\quad Z(b)=\sum_{j\in\F_q} \omega^{\operatorname{Tr}(b j)} |j\rangle\langle j|$8 bits in questions and $X(a) = \sum_{j\in\F_q} |j+a\rangle\langle j|,\quad Z(b)=\sum_{j\in\F_q} \omega^{\operatorname{Tr}(b j)} |j\rangle\langle j|$9 bits in responses, using compressed encodings via secondary composition and affine variable substitution (Natarajan et al., 2018). The protocol ensures completeness $\omega=e^{2\pi i/p}$0: honest provers sharing $\omega=e^{2\pi i/p}$1 always succeed.

3. Completeness, Soundness, and Robustness

The main technical soundness theorem [(Natarajan et al., 2018), Thm 3.6] guarantees that any two-prover strategy can succeed with probability $\omega=e^{2\pi i/p}$2 in the q-lowdeg test only if their shared state and measurements are close (under local isometries) to the ideal Pauli/EPR strategy, within a distance $\omega=e^{2\pi i/p}$3. This holds for all constant $\omega=e^{2\pi i/p}$4 and can be made arbitrarily small by taking $\omega=e^{2\pi i/p}$5.

Proof proceeds by showing that high success in X/Z low-degree tests and the commutation subtest yields approximate measurement operator families $\omega=e^{2\pi i/p}$6 satisfying:

• $\omega=e^{2\pi i/p}$7 (and similarly for $\omega=e^{2\pi i/p}$8)
• Twisted commutation up to phase: $\omega=e^{2\pi i/p}$9

A decomposition via ancillas, commuting operator "lifting", and tensor-product structure recursion yields isometries $\operatorname{Tr}$0 demonstrating that the overall physical strategy is close to the ideal model. The critical exponent in $\operatorname{Tr}$1 is universal and flows from composition with the underlying low-degree and commutation tests (Natarajan et al., 2018).

4. Quantum Soundness of the Low Individual Degree Test

An independent and less algebraically global approach is developed in the quantum low individual degree test (Q-LIDT) (Ji et al., 2020). Here, the focus is on polynomials of low individual degree, and the protocol defines three tests (axis-parallel lines, diagonal lines, and self-consistency), each checking that quantum provers' answers align either as evaluations of the same degree-$\operatorname{Tr}$2 polynomial or as consistent restrictions to lines.

Let $\operatorname{Tr}$3 denote the set of functions $\operatorname{Tr}$4 with $\operatorname{Tr}$5 for all $\operatorname{Tr}$6; the test's structure is tabulated below.

Subtest	Query/Answer Structure	Acceptance Condition
Axis-parallel lines	Send $\operatorname{Tr}$7 to one, $\operatorname{Tr}$8 to other	$\operatorname{Tr}$9
Self-consistency	Send $\F_q\to\F_p$0 to both	$\F_q\to\F_p$1
Diagonal lines	Send $\F_q\to\F_p$2 to one, $\F_q\to\F_p$3 to other	$\F_q\to\F_p$4

The main result establishes quantum soundness under robust error bounds: If a (possibly entangled) quantum strategy passes all subtests with high probability, then there exist projective measurements $\F_q\to\F_p$5 (each $\F_q\to\F_p$6) such that outcomes are consistent with a single global low-degree polynomial with error probability $\F_q\to\F_p$7: $\F_q\to\F_p$8 for sampling parameter $\F_q\to\F_p$9. This ensures that any good quantum strategy is operationally close to an ideal honest strategy (Ji et al., 2020). Key technical ingredients include refined self-improvement via SDP/orthogonalization and commutation analysis using the diagonal-lines test.

5. PCPs of Proximity, Nonlocal Games, and QMA Hardness

The quantum low-degree test is a building block in the reduction from QMA-hard interactive proofs to logarithmic-communication nonlocal games. Leveraging Reed–Muller encoding, answer compression via affine-variable substitution, and benign PCP-of-proximity (PCPP) tools, the Natarajan–Vidick framework enables the following construction:

1. Testing encoded Pauli observables: The test certifies correct encoding of the provers' state (via CSS codes) and correct evaluation of linear observables using PCP-of-proximity verifiers with $n$0 queries.
2. Energy testing for Y-free Hamiltonians: Verification protocols sample Pauli terms and test expectations efficiently using the low-degree and sum-test mechanisms.
3. Gap amplification and QMA-hardness: Via tensor product gap amplification (Ahlswede–Winter Chernoff bounds) and random Hamiltonian term sampling, the value of the resulting nonlocal game is shown QMA-hard to approximate, establishing a randomized reduction from QMA to games quantum PCP (Natarajan et al., 2018).

A consequence is a deterministic reduction from the games quantum PCP conjecture to a suitable formulation of the Hamiltonian quantum PCP conjecture.

6. Technical Innovations and Soundness Proof Architecture

Several technical novelties distinguish recent quantum low-degree test proofs. Among these:

• Self-improvement via SDP and orthogonalization: Imperfect (sub-)measurements are mapped to projective ones with bounded error by pushing inconsistencies to "missing" projectors, employing a semidefinite program and complementary slackness.
• Pasting lemma: High-dimensional consistency is bootstrapped inductively. One constructs, from slice-wise low-degree measurements in $n$1 variables, a global low-degree measurement in $n$2 variables with error that increases only polynomially in $n$3 and $n$4.
• Distance measures for sub-measurements: Fine-grained metrics such as consistency distance ($n$5) and root-mean-square distance ($n$6) enable rigorous control over deviations from ideal strategies (Ji et al., 2020).
• Commutation analysis: The diagonal-lines test, paired with expansion properties on the hypercube, ensures that slice measurements nearly commute, crucial for the correct gluing of local strategies in the inductive soundness argument.

These methods resolve prior soundness gaps—most importantly, the so-called "consolidation bug"—thus sustaining major recent results such as $n$7 (Ji et al., 2020).

7. Impact and Outlook in Quantum Complexity

The quantum low-degree test bridges algebraic property testing, PCP, and self-testing in quantum interactive proof systems. Its robust certification of provers' quantum behavior is foundational for:

• Constant-gap interactive proofs for QMA through nonlocal games with efficient communication.
• Self-testing of maximally entangled states of arbitrary dimension and their measurement observables.
• Theoretical hardness results for multiplayer entangled games.
• Underpinning major developments in the landscape of quantum complexity and nonlocal proof systems, notably the fully quantum PCP theorems and $n$8.

A plausible implication is that further refinements or extensions of the quantum low-degree test may have downstream consequences for both the classification of quantum complexity classes and the design of robust quantum cryptographic protocols.