Forward-label compression preserves the canonical good space exactly
ProvedWeldedPath.Supplement.forward_label_goodnesscompressed-oraclesquantum-query-complexitywelded-trees
Let be a valid welded-tree instance, with and . Let be any set of structural vertices containing the canonical boundary , and let be an integer. Write for the canonical good-space projector, extended by the identity on the query register, and for the literal forward-label compression operator defined by the compressed oracle. Then
Thus forward-label compression maps every coherent good state with at most records into the canonical good space with at most records, with zero leakage. The query register may be arbitrarily superposed and entangled with the database. This is the forward-label part of Lemma 4.8; unlike approximate inverse-label compression, this exact statement needs no small-query or coefficient-stability budget.
Preamble
import Definitions.Def_WeldedPath_Supplement_projGood set_option autoImplicit false
Formal statement
namespace WeldedPath.Supplement
theorem forward_label_goodness {n l : ℕ} (G : WeldedInstance n)
(hG : G.IsValid) (hn : 16 ≤ n) (hl : 2 ≤ l) (hln : l ≤ n - 4)
(B : Finset ℕ) (hB : Vbd n l ⊆ B) (t : ℕ) :
((1 : Hil (QReg n × Db l G) →L[ℂ] Hil (QReg n × Db l G)) -
projGoodB l G B (t+1)).comp ((pCforLab l G).comp (projGoodB l G B t)) = 0 := by
sorry
end WeldedPath.Supplement
Source
Carolan, Childs, Coudron, Gilani, Miloschewsky, Podder, Algorithmic Wave-Particle Duality: Pathfinding in Welded Trees is Hard, https://arxiv.org/html/2611.05912v1, Section 4.2, Lemma 4.8 (forward-label compression part).