Adjacent Gaussian gates are exactly special-unitary parity blocks, with common phases separated
OpenQAlgorithms.Papers.Independent.Intakethird100.P77.nearestNeighbour_gaussianIdentificationFix an existing adjacent pair of wires in increasing order in the Jordan–Wigner representation. Let be the set of operators , with , real antisymmetric , and all coefficients outside the four Majoranas of that pair equal to zero. Then
All operators are embedded on the specified pair and act as identity elsewhere. The two parity bases are ordered and . This gives the exact local identification while retaining the scalar phase needed for general allowable matchgates.
Source correction. The unrestricted equal-determinant assertion on p.11 omits the common scalar phase; the trace-free quadratics themselves generate determinant-one blocks.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P77
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakethird100.P77
open QAlgorithms
open QAlgorithms.Complexity (Str)
open QAlgorithms.Papers.Independent.Advance50.P19 (Major CARSystem)
open QAlgorithms.Papers.Independent.Information100.P32 (Op)
open scoped BigOperators Matrix ComplexConjugate
attribute [local instance] Classical.propDecidable Classical.decEq
/-- PDF pp.10--11 local identification, with the scalar-phase omission
corrected: trace-free quadratics give exactly determinant-one parity blocks;
general equal-determinant blocks are these times a common unit scalar. -/
theorem nearestNeighbour_gaussianIdentification {n : ℕ} (w : Fin 2 ↪ Fin n)
(hadjacent : (w 0).val + 1 = (w 1).val) (U : Op (Qubits n)) :
((∃ h : Matrix (Major n) (Major n) ℝ,
Skew h ∧ SupportedOnPair w h ∧ U = gaussianOperation (jordanWigner n) h) ↔
∃ A B : Matrix.unitaryGroup Bool ℂ,
Matrix.det (A : Matrix Bool Bool ℂ) = 1 ∧
Matrix.det (B : Matrix Bool Bool ℂ) = 1 ∧
U = embedOp (parityGate A B) w) ∧
((∃ A B : Matrix.unitaryGroup Bool ℂ,
Matrix.det (A : Matrix Bool Bool ℂ) = Matrix.det (B : Matrix Bool Bool ℂ) ∧
U = embedOp (parityGate A B) w) ↔
∃ (z : ℂ) (h : Matrix (Major n) (Major n) ℝ),
‖z‖ = 1 ∧ Skew h ∧ SupportedOnPair w h ∧
U = z • gaussianOperation (jordanWigner n) h) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P77
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , every injection satisfying , and every complex matrix indexed by -bit strings, the following two equivalences hold. To specify them, let and , where , , and , with Boolean indices ordered false, true. For a real matrix , set . The conditions on below are and whenever either or lies outside . For two Boolean-indexed matrices , define on two-bit strings by setting its entry to zero when , to when both parities are false, and to when both are true. Its embedding has entry if and agree on every wire outside the image of , and zero otherwise. First, there exists an satisfying the stated conditions with if and only if there exist unitary matrices , each of determinant , with . Second, there exist unitary matrices with and if and only if there exist with and an satisfying the stated conditions with . Such an injection cannot exist when .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.