Related papers: Quantum Margulis Codes
Categorical Quantum Mechanics, and graphical calculi in particular, has proven to be an intuitive and powerful way to reason about quantum computing. This work continues the exploration of graphical calculi, inside and outside of the…
We study Hamilton circuits of the Cayley graphs of the Weyl groupoids of the generalized quantum groups, or the quantum double of the Nichols algebras of diagonal-type, with finite root systems. We prove the existence of a Hamilton circuit…
Random walk algorithms are crucial for sampling and approximation problems in statistical physics and theoretical computer science. The mixing property is necessary for Markov chains to approach stationary distributions and is facilitated…
In this note, an intrinsic description of some families of linear codes with symmetries is given, showing that they can be described more generally as quasi group codes, that is, as linear codes allowing a group of permutation automorphisms…
Self-dual and complementary dual cyclic/abelian codes over finite fields form important classes of linear codes that have been extensively studied due to their rich algebraic structures and wide applications. In this paper, abelian codes…
Quantum computation offers the potential to solve fundamental yet otherwise intractable problems across a range of active fields of research. Recently, universal quantum-logic gate sets - the building blocks for a quantum computer - have…
We utilize the symmetry groups of regular tessellations on two-dimensional surfaces of different constant curvatures, including spheres, Euclidean planes and hyperbolic planes, to encode a qubit or qudit into the physical degrees of freedom…
Long quantum codes using projective Reed-Muller codes are constructed. Projective Reed-Muller codes are evaluation codes obtained by evaluating homogeneous polynomials at the projective space. We obtain asymmetric and symmetric quantum…
Dual canonical bases of the quantum general linear supergroup are constructed which are invariant under the multiplication of the quantum Berezinian. By setting the quantum Berezinian to identity, we obtain dual canonical bases of the…
We formally define homological quantum rotor codes which use multiple quantum rotors to encode logical information. These codes generalize homological or CSS quantum codes for qubits or qudits, as well as linear oscillator codes which…
In this paper, we construct the first families of asymmetric quantum convolutional codes (AQCC)'s. These new AQCC's are constructed by means of the CSS-type construction applied to suitable families of classical convolutional codes, which…
Hybrid codes simultaneously encode both quantum and classical information into physical qubits. We give several general results about hybrid codes, most notably that the quantum codes comprising a genuine hybrid code must be impure and that…
Based on cyclic simplex codes, a new construction of a family of 2-generator quasi-cyclic two-weight codes is given. New optimal binary quasi-cyclic [195, 8, 96], [210, 8, 104] and [240, 8, 120] codes, good QC ternary [195, 6, 126], [208,…
Matrix-product codes over finite fields are an important class of long linear codes by combining several commensurate shorter linear codes with a defining matrix over finite fields. The construction of matrix-product codes with certain…
We present an efficient quantum circuit for block encoding pairing Hamiltonian often studied in nuclear physics. Our block encoding scheme does not require mapping the creation and annihilation operators to the Pauli operators and…
Quantum algorithms are a promising framework for unfolding the causal configurations of multiloop Feynman diagrams, which is equivalent to querying the \textit{directed acyclic graph} (DAG) configurations of undirected graphs in graph…
We present a quantum error correcting code with dynamically generated logical qubits. When viewed as a subsystem code, the code has no logical qubits. Nevertheless, our measurement patterns generate logical qubits, allowing the code to act…
The similarity transformations of quantum orthogonal groups are developed and FRT theory is reformulated to the Cartesian basis. The quantum orthogonal Cayley-Klein groups are introduced as the algebra functions over an associative algebra…
The Poisson structures on two-dimensional Galilei group, classified in the author previous paper are quantized. The dual quantum Galilei Lie algebras are found.
In this paper a wide family of identifying codes over regular Cayley graphs of degree four which are built over finite Abelian groups is presented. Some of the codes in this construction are also perfect. The graphs considered include some…