Related papers: The Cyclic Cutwidth of $Q_n$
We determine the set of side lengths of $d$-dimensional cubes with vertices in $\mathbb Z^n$ using Witt's cancellation theorem from the algebraic theory of quadratic forms.
We investigate additive cyclic codes over the alphabet $\mathbb{F}_{q}\mathbb{F}_{q^2}$, where $q$ is a prime power. First, its generator polynomials and minimal spanning set are determined. Then, examples of $\mathbb{F}_{q^2}$-additive…
In this short note, we show that cutting cycles of rods is fixed-parameter tractable by reducing the problem to computing a feedback vertex set in a mixed graph.
Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. Inspired by the recent work on binary cyclic codes published in…
Binary self-dual cyclic codes have been studied since the classical work of Sloane and Thompson published in IEEE Trans. Inf. Theory, vol. 29, 1983. Twenty five years later, an infinite family of binary self-dual cyclic codes with lengths…
In this paper and in its sequel [BKLV], we investigate the cone ${\rm Pseff}_n(C_d)$ of pseudoeffective $n$-cycles in the symmetric product $C_d$ of a smooth curve $C$. In the present paper, we study the convex-geometric properties of the…
We report on a technique for evaluating finite unitarity cut for one-loop amplitudes in gauge theories, and discuss its application to the cut-constructible part of six-gluon amplitude in QCD.
In this work, we study a class of generalized quasi-cyclic (GQC) codes called skew GQC codes. By the factorization theory of ideals, we give the Chinese Remainder Theorem over the skew polynomial ring, which leads to a canonical…
The spined cube $SQ_n$ is a variant of the hypercube $Q_n$, introduced by Zhou et al. in [Information Processing Letters 111 (2011) 561-567] as an interconnection network for parallel computing. A graph $\G$ is an $m$-Cayley graph if its…
A matrix is said to be {\it cyclic} if its characteristic polynomial is equal to its minimal polynomial. Cyclic matrices play an important role in some algorithms for matrix group computation, such as the Cyclic Meataxe developed by P. M.…
This article provides an introduction to surface code quantum computing. We first estimate the size and speed of a surface code quantum computer. We then introduce the concept of the stabilizer, using two qubits, and extend this concept to…
Circuit codes are constructed from induced cycles in the graph of the $n$ dimensional hypercube. They are both theoretically and practically important, as circuit codes can be used as error correcting codes. When constructing circuit codes,…
Quantum synchronizable error-correcting codes are special quantum error-correcting codes that are designed to correct both the effect of quantum noise on qubits and misalignment in block synchronization. It is known that in principle such a…
Constacyclic codes over finite fields are an important class of linear codes as they contain distance-optimal codes and linear codes with best known parameters. They are interesting in theory and practice, as they have the constacyclic…
We study n-qubit operation rules on (n+1)-sphere with the target to help developing a (photon or other technique) based programmable quantum computer. In the meanwhile, we derive the scaling limits (called reflecting Gaussian random fields…
An important question in the study of quasi-perfect codes is whether such codes can be constructed for all possible lengths $n$. In this paper, we address this question for specific values of $n$. First, we investigate the existence of…
Mapping a quantum algorithm to any practical large-scale quantum computer will require a sequence of compilations and optimizations. At the level of fault-tolerant encoding, one likely requirement of this process is the translation into a…
LDPC codes constructed from permutation matrices have recently attracted the interest of many researchers. A crucial point when dealing with such codes is trying to avoid cycles of short length in the associated Tanner graph, i.e. obtaining…
It is well understood that a two-dimensional grid of locally-interacting qubits is a promising platform for achieving fault tolerant quantum computing. However in the near-future, it may prove less challenging to develop lower dimensional…
Spin qubits have emerged as a leading platform for quantum information processing due to their long coherence times, small footprint, and compatibility with the existing semiconductor industry. We first provide an introduction to the…