Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Even-Majorana Ising exchanges normalize logical Paulis

Statement

Assume a Majorana–Ising exchange interface as defined in Ising–Majorana exchange interface. Let γ1,…,γ2m be Majorana operators on the 2m-dimensional fermionic Fock space, with γj∗=γj, γj2=I, and γjγk=−γkγj for j≠k. On either fixed eigenspace of the total parity Π=imγ1γ2⋯γ2m, the adjacent Ising exchanges, up to their common physical scalar, are Uj=exp⁡(−πγjγj+1/4),1≤j<2m. For m≥2 they normalize the logical Pauli group on the m−1 encoded qubits. Their braid-only projective image is finite and is not dense in PU(2m−1).

Facts & Assumptions

Given: The Majorana relations, a fixed-parity sector, and the Pauli matrices.

[F1]

The phase-aware Pauli group is finite and is generated by the single qubit X,Z matrices and scalar phases; the Clifford normalizer consists of unitaries conjugating that group to itself. The Pauli matrices Phase aware n qubit pauli group Clifford normalizer

[F2]

PU(V) is a Hausdorff metric quotient of U(V) by scalar unitaries. Projective braid gate and operator metric

[F3]

The interface identifies the adjacent-pair channels with Q1(j)=(I−iγjγj+1)/2 and Qψ(j)=(I+iγjγj+1)/2, and the exchange with R1Q1(j)+RψQψ(j)=R1eiπ/4Uj for every adjacent pair. Ising–Majorana exchange interface

Proof

1.1givenalgebra

Reordering the 2m Majorana factors gives (γ1⋯γ2m)∗=(−1)mγ1⋯γ2m and (γ1⋯γ2m)2=(−1)mI. Therefore Π∗=Π and Π2=I. Also Πγj=−γjΠ for each j, so γ1 bijects the +1 and −1 eigenspaces; each has dimension 2m−1. Since each product γjγj+1 commutes with Π, every Uj, being a function of that product, preserves both parity sectors.

1.2givenF3algebra

Put Aj=iγjγj+1. Then Aj∗=Aj and Aj2=I, so Q1=(I−Aj)/2 and Qψ=(I+Aj)/2 are orthogonal complementary projections. The operator Uj=2−1/2(I−γjγj+1) has eigenvalues e−iπ/4 on Q1 and eiπ/4 on Qψ, whose ratio is i. By [F3], the channel exchange is therefore (R1eiπ/4)Uj; its common scalar has no effect on conjugation.

2.1givenstep 1.2algebra

Let c=s=2−1/2 and A=γjγj+1, so Uj=cI−sA and Uj∗=cI+sA. Multiplication using γjA=γj+1, Aγj=−γj+1, γj+1A=−γj, and Aγj+1=γj gives UjγjUj∗=γj+1 and Ujγj+1Uj∗=−γj. Every other γk commutes with A, so UjγkUj∗=γk.

2.2givenF3step 1.2algebra

For A=γjγj+1 and B=γj+1γj+2, the Majorana relations give A2=B2=−I and AB=−BA. Expanding with these identities gives UjUj+1Uj=−(A+B)/2=Uj+1UjUj+1. If ∣j−k∣≥2, then the two products γjγj+1 and γkγk+1 commute because moving their four distinct factors past each other contributes sign (−1)4=1; hence UjUk=UkUj. Thus the Uj satisfy the Artin braid relations. The common scalar in step 1.2 preserves these relations, since both sides of each relation have the same number of generators.

3.1F1step 1.1step 2.1algebra

For 1≤k<m define the even Majorana monomials Zˉk=iγ2k−1γ2k and Xˉk=∏ℓ=km−1(iγ2ℓγ2ℓ+1). Each bilinear is a Hermitian involution; the bilinears in a fixed Xˉk have disjoint supports and commute, so every Xˉk is also a Hermitian involution. All these even monomials commute with Π and preserve Hη. Their supports show that the Zˉj commute with one another, the Xˉk commute with one another, and Zˉj anticommutes with Xˉk exactly when j=k (their support intersection has odd size exactly in that case). The commuting involutions Zˉ1,…,Zˉm−1 have joint sign projections ∏k(I+ϵkZˉk)/2 whose sum is identity, so at least one joint eigenspace is nonzero. Applying products of the Xˉk flips each sign independently; hence all 2m−1 joint sign eigenspaces are nonzero and orthogonal. Their number equals dim⁡Hη=2m−1 from step 1.1, so each is one-dimensional. In this basis the Zˉk,Xˉk are the standard logical Pauli generators. To see they exhaust the restrictions of all even Majorana monomials, label γj by the jth standard vector of F22m. Even monomial labels form the 2m−1 dimensional even-sum subspace, and the all-ones parity label lies in it. The labels of the 2m−2 operators Zˉk,Xˉk are independent modulo the parity label: no combination uses coordinate 2m, while the successive coordinates 1,2,3,4,…,2m−1 force in turn the coefficients of Zˉ1,Xˉ1,Zˉ2,Xˉ2,…,Zˉm−1,Xˉm−1 to vanish. They therefore form a basis of the quotient of even labels by the parity label. Reordering and cancelling Majorana factors shows that monomials with the same label differ only by a scalar; on Hη the parity monomial is scalar. Thus every even Majorana monomial restricts to an element of the logical phase-aware Pauli group generated by the Zˉk,Xˉk. By step 2.1 each braid sends every Majorana to a signed Majorana, so it maps this finite Pauli group into itself; invertibility and finiteness make the image equal to the group. Hence each exchange normalizes the logical Pauli group.

4.1F1F2step 2.2step 3.1algebra∎

Conjugation gives a homomorphism from the projective Clifford group to the automorphism group of the phase-aware Pauli group. That Pauli group is finite, so its automorphism group is finite. The kernel consists of unitaries commuting with every logical Pauli; commuting with all logical Zk makes a unitary diagonal in the computational basis, and commuting with each logical Xk forces every diagonal entry to agree. Thus the kernel is scalar and the projective Clifford group is finite. For m≥2, PU(2m−1) is an infinite Hausdorff metric space by [F2]: the classes of diag⁡(1,eit,1,…,1) are distinct as t varies modulo 2π. A finite subgroup is closed in a metric space, so this braid subgroup is not dense.

Depends on

Used by

Dependency tree · two levels

24 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources