Clean coherent simulation of the gadget oracle in six queries
ProvedQuantumBipartiteTesting.Bipartiteness.gadget_coherent_simulationFor every vertex count , every injective null-preserving binary encoding of signed source responses, and every injective null-preserving binary encoding of gadget responses, there is an input-independent finite unitary circuit with at most six source oracle calls that simulates one query to the packed adjacency oracle of the seven-vertex path gadget.
More precisely, there is a fixed injective clean embedding of the entire logical address and answer basis into the simulation basis such that, for every consistent signed colored graph and every complex logical state ,
Here is the encoded XOR oracle for the sorted packed neighbor list of the gadget, and consists of input-independent unitary gates interleaved with at most six encoded signed-source XOR queries. The equality includes every answer-register bit string, dummy addresses, arbitrary superpositions, and a clean return of the auxiliary registers.
This makes the constant-query coherent simulation in Lemma 3.16 explicit. Three source response registers are computed and then cleared by three further source calls.
import Definitions.Def_QuantumBipartiteTesting_Bipartiteness_Reduction
theorem QuantumBipartiteTesting.Bipartiteness.gadget_coherent_simulation : QuantumBipartiteTesting.Bipartiteness.CoherentSimulation 6 := by sorry