In this paper initial steps in an analysis of cyclic networks of quantum logic gates will be given. Cyclic networks are those in which the qubit lines are loops. In our investigations of cyclic networks of quantum gates we have studied one- and two-qubit systems plus two-qubit systems connected to another qubit on an acyclic line. The analysis includes classifying networks into groups, the dynamics of the qubits in the cyclic network, and the perturbation effects of an acyclic qubit acting on a cyclic network of quantum gates. This will be followed by a discussion on quantum algorithms and quantum information processing with cyclic networks of quantum gates. An implementation of a cyclic network quantum memory and quantum sensors via cyclic networks will also be discussed.
Automorphisms of quantum codes, when they exist, offer a pathway toward fault-tolerant gate implementation via qubit relabeling. Although useful, the conditions under which automorphisms appear in a given code remain poorly understood. In this paper, we develop an algebraic framework for systematically analyzing and engineering automorphisms in Generalized Bicycle (GB) codes. Central to our approach is the derivation of a three-space dependency between the polynomial ring space, the parity check matrix space, and the
F22ℓ qubit space, similar to the structure found in the study of classical cyclic codes. By expressing GB codes as a pair of cyclic submodules of
Rℓ2, where
Rℓ≅F2[x]/⟨xℓ−1⟩, we reduce the search for code automorphisms to a deterministic algebraic problem, deriving necessary and sufficient conditions for the existence of block-separable automorphisms built from cyclic shifts, ring automorphisms and block-swaps. We connect these conditions to the fold-transversal gate framework, providing explicit criteria for the existence of
H-,
S-, and
CX-type fold-transversal gates. We further discuss structured bases for logical operators in order to determine the logical action of a given automorphism. Finally, we introduce the Maximal Cube Root (MCR) code family, a family of GB codes constructed around the principle of maximizing automorphism flexibility and fold-CX gates. We demonstrate a collection of
k=2 MCR codes up to
d=13 generating the 2-qubit Clifford group via automorphism and fold-transversal gates, with stabilizer weight ranging from 8 to 16, and
k>2 MCR codes with a minimum of 20 distinct logical gates achievable from automorphisms. This serves as a first demonstration of inverse design: using these methods to build codes around a rich automorphism structure from the ground up.
Kauffman and Lomonaco initiated the idea that unitary solutions to Yang-Baxter equation are crucial tools in studying the relationship between quantum entanglement and topological entanglement. Hence we believe creating a more explicit formalism and more examples of those solutions is an important contribution to this field of study. Many well-known and well-studied four-by-four universal quantum logic gates in the literature are of a specific form, the so called eight-vertex form. In the first part of this paper, we provide explicit formulas in terms of matrix entries, which are the necessary and sufficient conditions for a four-by-four complex matrix, of the eight-vertex form, to be a unitary solution to Yang-Baxter equation. Hence, considering the conditions needed for
being entangling, we give the explicit description of universal quantum logic gates of such a specific form, in terms of matrix entries. In the second part of this paper, we create a family of examples of unitary solutions to Yang-Baxter equation of non-eight-vertex form, using a hint from the cyclic group.