Algebraic correctness of the Gauss-phase circuit identity
OpenGL2QFT.Circuits.gamma_circuit_identityquantum-algorithmsquantum-circuitsrepresentation-theory
For any finite field represented by and any nontrivial multiplicative character (nonzero exponent label ), applying , , , , and in sequence to yields
Preamble
import Definitions.Def_GL2QFT_Circuits_Combinators open Classical open GL2QFT QAlgorithms QAlgorithms.Complexity
Formal statement
namespace GL2QFT namespace Circuits theorem gamma_circuit_identity (D : FieldData) (α : D.Lab) (hα : α ≠ 0) (c : Option D.Lab) : (phiFmult D * phiLog D * phiFplus D * phiExp D * phiFmult D) c (some α) = if c = some α then D.gauss α * FieldData.isqrt D.q else 0 := by sorry end Circuits end GL2QFT
Source
Bruinsma, Posta, Stokvis, Grinko, Ozols (2026), Quantum Fourier transform toolbox, arXiv:2608.28573, §6.4.1, Theorem 6.10 proof & Figure 12 (pp. 42–43), eq. (122)