Related papers: Optimal embedding of hypercube into cylinder
Current and near-term quantum hardware is constrained by limited qubit counts, circuit depth, and the high cost of repeated measurements. We address these challenges for solid state Hamiltonians by introducing a logarithmic-qubit encoding…
Integrated photonic circuits offer great promise for quantum technologies. However, due to the rapid propagation of light, many envisioned applications require efficient on-chip quantum memories with a programmable delay, compact footprint,…
The $n$-dimensional hypercube graph $Q_n$ has as vertices all subsets of $\{1, \ldots, n\}$, and an edge between any two sets that differ in a single element. The Ruskey-Savage conjecture states that every matching of the $n$-dimensional…
In this paper we study some cube packing problems. In particular we are interested in compact subsets of $\mathbb{R}^n,n\geq 2$, which contain boundaries of cubes with all side lengths in $(0,1)$. We show here that such sets must have lower…
Quantum algorithms to integrate nonlinear PDEs governing flow problems are challenging to discover but critical to enhancing the practical usefulness of quantum computing. We present here a near-optimal, robust, and end-to-end quantum…
It is shown that effective quantum-state and entanglement transfer can be obtained by inducing a coherent dynamics in quantum wires with homogeneous intrawire interactions. This goal is accomplished by tuning the coupling between the wire…
The sliding cubes model is a well-established theoretical framework that supports the analysis of reconfiguration algorithms for modular robots consisting of face-connected cubes. The best algorithm currently known for the reconfiguration…
Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems and communication systems as they have efficient encoding and decoding algorithms. In this paper, we settle an open problem…
Recently, it was shown that an infinite perfectly conducting (PEC) cylinder can be nearly perfectly cloaked from normally incident electromagnetic waves using a single-layer homogeneous dielectric cladding. Here we study the electromagnetic…
We prove that, for the binary erasure channel (BEC), the polar-coding paradigm gives rise to codes that not only approach the Shannon limit but do so under the best possible scaling of their block length as a~function of the gap to…
High-rate and large-distance quantum codes are expected to make fault-tolerant quantum computing more efficient, but most of them lack efficient fault-tolerant encoded-state preparation methods. We propose such a fault-tolerant encoder for…
A finite element program is presented to simulate the process of packing and coiling elastic wires in two- and three-dimensional confining cavities. The wire is represented by third order beam elements and embedded into a corotational…
We consider the problem of mapping a logical quantum circuit onto a given hardware with limited two-qubit connectivity. We model this problem as an integer linear program, using a network flow formulation with binary variables that includes…
Confinement in Quantum Chromodynamics (QCD), binding quarks and gluons into hadrons, is characterized by a linear potential and the Wilson loop area law. We develop an analytical framework in $\text{SU(3)}$ gauge theory, proposing a hybrid…
Quantum error correcting codes (QECCs) are the means of choice whenever quantum systems suffer errors, e.g., due to imperfect devices, environments, or faulty channels. By now, a plethora of families of codes is known, but there is no…
In traditional reversible data hiding (RDH) methods, researchers pay attention to enlarge the embedding capacity (EC) and to reduce the embedding distortion (ED). Recently, a completely novel RDH algorithm was developed to embed secret data…
Given a subgraph G of the hypercube Q_n, a coloring of the edges of Q_n such that every embedding of G contains an edge of every color is called a G-polychromatic coloring. The maximum number of colors with which it is possible to…
We identify gauge freedoms in quantum error correction (QEC) codes and introduce strategies for optimal control algorithms to find the gauges which allow the easiest experimental realization. Hereby, the optimal gauge depends on the…
Using transversality and a dimension reduction argument, a result of A. Bezdek and W. Kuperberg is applied to polycylinders $\mathbb{D}^2\times \mathbb{R}^n$, showing that the optimal packing density is $\pi/\sqrt{12}$ in any dimension.
We introduce two new classes of covering codes in graphs for every positive integer $r$. These new codes are called local $r$-identifying and local $r$-locating-dominating codes and they are derived from $r$-identifying and…