Transversal non-Clifford gates on qLDPC codes breaking the $\sqrt{N}$ distance barrier and quantum-inspired geometry with $\mathbb{Z}_2$ systolic freedom (2507.15056v1)
Abstract: Historically, a $\sqrt{N}log{1/2}(N)$ distance barrier for quantum low-density parity-check (LDPC) codes with $N$ qubits persisted for nearly two decades, until the recent discovery of the fibre-bundle code. An open question is whether such a distance barrier can be broken while preserving the ability to perform transversal non-Clifford gates. In this direction, another long-standing distance barrier of $N{1/3}$ for LDPC stabilizer codes -- present since the discovery of the 3D color code -- was only recently overcome by a construction achieving an $\Omega(\sqrt{N})$ distance (arXiv:2501.19375). The present work further breaks the $\sqrt{N}$ distance barrier by taking a homological product of three good qLDPC codes, combined with the Freedman-Hastings code-to-manifold mapping and the triple cup product to implement transversal CCZ gates. The resulting code achieves an $\Omega(N{2/3})$ distance (a linear $X$-distance of $\Theta(N)$) and a dimension of $\Theta(N{2/3})$, which enables fault-tolerant preparation of $\Theta(N{1/3})$ independent logical CCZ magic states in a single shot, without distillation (`magic state fountain'). This new quantum code also inspires the discovery of a family of exotic $3q$-dimensional manifolds $\mathcal{M}$, which exhibit both a power-law $\mathbb{Z}_2$-($q$, $2q$)-systolic freedom and $\Theta(vol(\mathcal{M}))$ triple intersection points of $2q$-dimensional submanifolds.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.