Quantum codes from finite geometry and combinatorial designs (Finite groups, vertex operator algebras and combinatorics)

祐一郎 藤原

A. R. P. Rau

The symmetry SU(2) and its geometric Bloch Sphere rendering have been successfully applied to the study of a single qubit (spin-1/2); however, the extension of such symmetries and geometries to multiple qubits—even just two—has been investigated far less, despite the centrality of such systems for quantum information processes. In the last two decades, two different approaches, with independent starting points and motivations, have been combined for this purpose. One approach has been to develop the unitary time evolution of two or more qubits in order to study quantum correlations; by exploiting the relevant Lie algebras and, especially, sub-algebras of the Hamiltonians involved, researchers have arrived at connections to finite projective geometries and combinatorial designs. Independently, geometers, by studying projective ring lines and associated finite geometries, have come to parallel conclusions. This review brings together the Lie-algebraic/group-representation perspective of quantum physics and the geometric–algebraic one, as well as their connections to complex quaternions. Altogether, this may be seen as further development of Felix Klein’s Erlangen Program for symmetries and geometries. In particular, the fifteen generators of the continuous SU(4) Lie group for two qubits can be placed in one-to-one correspondence with finite projective geometries, combinatorial Steiner designs, and finite quaternionic groups. The very different perspectives that we consider may provide further insight into quantum information problems. Extensions are considered for multiple qubits, as well as higher-spin or higher-dimensional qudits.

Fernando Hernando, Gary McGuire, Francisco Monserrat +1 more

Keke Liu, Shu Lin, Khaled Abdel-Ghaffar

Cyclic and quasi-cyclic algebraic LDPC codes constructed based on finite fields, finite geometries, and combinatorial designs can achieve excellent performance in terms of error rate, error floor and rate of decoding convergence with iterative decoding. However, the relatively high density of the parity-check matrix of an algebraic cyclic or quasi-cyclic LDPC code makes the hardware implementation complexity of the decoder quite large, which may be a critical issue in practical applications. This paper presents an effective reduced-complexity algorithm for decoding algebraic cyclic and quasi-cyclic LDPC codes based on the block cyclic structure and cyclic grouping of the rows of their parity-check matrices. The decoding of a code is carried out based on a single small submatrix of the parity-check matrix of the code in a revolving manner. The proposed decoding algorithm significantly reduces the hardware implementation complexity and the size of memory required to store information.

J. P. Marceaux, A. R. P. Rau

Chong-Yuan Xu, Ze-Chuan Liu, Yong Xu

Translation invariance underlies all algebraic constructions of topological codes with geometrical locality. It has remained an open question whether codes that generically break this invariance can still be topological and simultaneously possess geometrical locality. Resolving this question is important both fundamentally---deepening our understanding of topological phases---and practically, as relaxing translation invariance could vastly expand the design space and potentially reduce resource overhead in fault-tolerant architectures. Here we introduce space-group codes, in which crystallographic point-group operations enter the bulk stabilizer algebra; bivariate bicycle (BB) codes arise as the translation-only limit. The key insight is that the point-group orbit resolves topology and locality together: it yields a computable algebraic criterion for topological order and a folded geometry in which point-group operations become local. We identify space-group codes whose code parameters exceed the reported same-blocklength, same-check-weight BB benchmarks. In five parameter-matched neutral-atom comparisons, reflection codes reduce the optimized movement cost in every case, by up to $60\%$, while folded placements also enable lower-overhead multilayer superconducting layouts. Treating spatial operations as a code-design variable therefore opens a route to topological codes jointly optimized for information protection and hardware geometry.