相关论文: The Cyclic Cutwidth of $Q_n$

Clique-width is a well-studied graph parameter owing to its use in understanding algorithmic tractability: if the clique-width of a graph class ${\cal G}$ is bounded by a constant, a wide range of problems that are NP-complete in general…

The Rubik's Cube is perhaps the world's most famous and iconic puzzle, well-known to have a rich underlying mathematical structure (group theory). In this paper, we show that the Rubik's Cube also has a rich underlying algorithmic…

Small numbers of qubits are one of the primary constraints on the near-term deployment of advantageous quantum computing. To mitigate this constraint, techniques have been developed to break up a large quantum computation into smaller…

Quantum computing has recently emerged as a promising computing paradigm for many application domains. However, the size of quantum circuits that can be run with high fidelity is constrained by the limited quantity and quality of physical…

In quantum computing the decoherence time of the qubits determines the computation time available and this time is very limited when using current hardware. In this paper we minimize the execution time (the depth) for a class of circuits…

Classical shadow tomography is a sample-efficient technique for characterizing quantum systems and predicting many of their properties. Circuit cutting is a technique for dividing large quantum circuits into smaller fragments that can be…

In this paper, we address a particular variation of the Tur\'an problem for the hypercube. Alon, Krech and Szab\'o (2007) asked "In an n-dimensional hypercube, Qn, and for l < d < n, what is the size of a smallest set, S, of Q_l's so that…

Linear quasi-cyclic product codes over finite fields are investigated. Given the generating set in the form of a reduced Gr{\"o}bner basis of a quasi-cyclic component code and the generator polynomial of a second cyclic component code, an…

If $n$ is even, the $n$-dimensional hypercube can be decomposed into edge-disjoint cycles of length $2^i$ for every value of $i$ from $2$ to $n$.

Shallow quantum circuits feature not only computational advantages over their classical counterparts but also cutting-edge applications. Storing quantum information generated by shallow circuits is a fundamental question of both theoretical…

We study graph ordering problems with a min-max objective. A classical problem of this type is cutwidth, where given a graph we want to order its vertices such that the number of edges crossing any point is minimized. We give a $…

We introduce an invariant linked to some foundational questions in geometric measure theory and provide bounds on this invariant by decomposing an arbitrary cycle into uniformly rectifiable pieces. Our invariant measures the difficulty of…

Numerical evidence combined with Eguchi-Kawai reduction indicate that there are no finite volumes effects in the large N limit of QCD as long as the linear extent of the four-torus is bigger than a critical size. This is referred to as…

In this paper we present some quantitative results concerning symplectic barriers. In particular, we answer a question raised by Sackel, Song, Varolgunes, and Zhu regarding the symplectic size of the $2n$-dimensional Euclidean ball with a…

Given an undirected graph $G = (V,E)$, the cut polytope $\mathrm{CUT}(G)$ is defined as the convex hull of the incidence vectors of all cuts in $G$. The 1-skeleton of $\mathrm{CUT}(G)$ is a graph whose vertex set is the vertex set of the…

The interrelation between the cyclic structure of an ideal, i.e., a cyclic code over Galois field $GF(q)$, $q>2$, and its classes of proportional elements is considered. This relation is used in order to define the code's weight structure.…

Diagrammatic methods and Large $N_c$ QCD are used to argue that the nucleon as calculated in quenched QCD contains physics which can be ascribed to the pion cloud of the nucleon. In particular, it is argued that the physics corresponding to…

For a linear Hamming metric code of length n over a finite field, the number of distinct weights of its codewords is at most n. The codes achieving the equality in the above bound were called full weight spectrum codes. In this paper we…

Generalized bicycle (GB) codes is a class of quantum error-correcting codes constructed from a pair of binary circulant matrices. Unlike for other simple quantum code ans\"atze, unrestricted GB codes may have linear distance scaling. In…

We present an algorithm that computes a shortest non-contractible and a shortest non-separating cycle on an orientable combinatorial surface of bounded genus in O(n \log n) time, where n denotes the complexity of the surface. This solves a…