Corollary 3.2 — is an integer matrix
ProvedQMAPerfectCompleteness.Main.integer_acceptancep2o-batch-stoc27ap2o-gran-per-chapterp2o-plan-paperp2o-v1qmaquantum-complexity
Let be a verifier over with gates , counted literally in its gate list, and let be its acceptance operator as in Eq. (1). Then
The case is included. This gives the acceptance operator a known dyadic denominator of polynomial size.
Differences from the source: none.
Preamble
import Definitions.Def_QMAPerfectCompleteness_Main_Cyclic open Matrix
Formal statement
namespace QMAPerfectCompleteness.Main
/-- Corollary 3.2 (p. 7): for a verifier over `𝒢₂` with `g` gates `H ⊗ H`, the matrix `2^{2g} E`
has integer entries. -/
theorem integer_acceptance (V : Verifier gatesG2) :
∃ Z : Matrix V.Proof V.Proof ℤ,
((2 : ℂ) ^ (2 * hhCount V)) • V.acceptanceOperator = Z.map (Int.cast : ℤ → ℂ) := by sorry
end QMAPerfectCompleteness.Main
Source
Sabee Grewal, Dorian Rudolph, QMA has perfect completeness, STOC 2027 submission #490 (October 2026), p. 7, Corollary 3.2
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.