Modular Walsh Rigidity and Antipodal Obstructions for Flat Non-Clifford Hypergraph States

Hypergraph states prepared by diagonal non-Clifford phase circuits {Z, CZ, CCZ, CCCZ} correspond directly to Boolean functions of algebraic degree at most four, with the native Hadamard layer H^{\otimes n} mapping phases to the Walsh-Hadamard spectrum. Building on our Lean-certified antipodal necessity theorem (DOI: 10.6084/m9.figshare.34165260.v2) and modular Walsh rigidity at thresholds 8/15 and 1/2 (DOI: 10.6084/m9.figshare.34963642.v4), we establish: (1) an exact topological obstruction and SWAP/CNOT lower bound for rotation-symmetric {Z, CZ, CCZ} circuits on 1D rings, compared against 2D Grid and IBM Heavy-Hex routing; (2) an overflow-free uint8/uint16 modular flatness certification engine that achieves 4x memory reduction vs int32 (16x vs complex128) up to 28 qubits, 1.44x speedup at 32 qubits (13.67 s, 8 GB), and certifies 36 qubits (68.7 billion amplitudes, p=275) in 141.57 s using 128 GB RAM on a single 12-vCPU, 160 GB node where exact int32 (256 GB) runs out of memory and complex128 requires 1 TB; (3) a universal degree-4 counterexample fooling p=3 across all 2^n frequencies; and (4) an exact dimensional reduction theorem for 2-Renyi stabilizer entropy M_2, unified rotation-symmetric degree-4 flat states achieving 0.638n bits of magic, NISQ noisy X-basis flatness testing, and OpenQASM 3.0 circuits.

Authors

Publication Details

Journal
Figshare
Published
2026-11-19
DOI
https://doi.org/10.6084/m9.figshare.35068705
Primary Topic
Quantum Computing Algorithms and Architecture
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Modular Walsh Rigidity and Antipodal Obstructions for Flat Non-Clifford Hypergraph States

Valéria Gonzaga dos Santos, Filipe Vono, André Oliveira Naufel de TOLEDO
Figshare
Quantum Computing Algorithms and Architecture
preprint

Modular Walsh Rigidity and Antipodal Obstructions for Flat Non-Clifford Hypergraph States

Valéria Gonzaga dos Santos, Filipe Vono, André Oliveira Naufel de TOLEDO
preprint en

Abstract

Hypergraph states prepared by diagonal non-Clifford phase circuits {Z, CZ, CCZ, CCCZ} correspond directly to Boolean functions of algebraic degree at most four, with the native Hadamard layer H^{\otimes n} mapping phases to the Walsh-Hadamard spectrum. Building on our Lean-certified antipodal necessity theorem (DOI: 10.6084/m9.figshare.34165260.v2) and modular Walsh rigidity at thresholds 8/15 and 1/2 (DOI: 10.6084/m9.figshare.34963642.v4), we establish: (1) an exact topological obstruction and SWAP/CNOT lower bound for rotation-symmetric {Z, CZ, CCZ} circuits on 1D rings, compared against 2D Grid and IBM Heavy-Hex routing; (2) an overflow-free uint8/uint16 modular flatness certification engine that achieves 4x memory reduction vs int32 (16x vs complex128) up to 28 qubits, 1.44x speedup at 32 qubits (13.67 s, 8 GB), and certifies 36 qubits (68.7 billion amplitudes, p=275) in 141.57 s using 128 GB RAM on a single 12-vCPU, 160 GB node where exact int32 (256 GB) runs out of memory and complex128 requires 1 TB; (3) a universal degree-4 counterexample fooling p=3 across all 2^n frequencies; and (4) an exact dimensional reduction theorem for 2-Renyi stabilizer entropy M_2, unified rotation-symmetric degree-4 flat states achieving 0.638n bits of magic, NISQ noisy X-basis flatness testing, and OpenQASM 3.0 circuits.

Figshare
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon