Related papers: Optimal embedding of hypercube into cylinder
Encoding quantum information in a quantum error correction (QEC) code offers protection against decoherence and enhances the fidelity of qubits and gate operations. One of the fundamental challenges of QEC is to construct codes with…
Ruskey and Savage in 1993 asked whether every matching in a hypercube can be extended to a Hamiltonian cycle. A positive answer is known for perfect matchings, but the general case has been resolved only for matchings of linear size. In…
A dominating set on an $n $-dimensional hypercube is equivalent to a binary covering code of length $n $ and covering radius 1. It is still an open problem to determine the domination number $\gamma(Q_n)$ for $ n\geq10$ and $…
Motivated by the duplication-correcting problem for data storage in live DNA, we study the construction of constant-weight codes in $\ell_1$-metric. By using packings and group divisible designs in combinatorial design theory, we give…
Efficiently computing accurate representations of high-dimensional data is essential for data analysis and unsupervised learning. Dendrograms, also known as ultrametrics, are widely used representations that preserve hierarchical…
In Part I (physics/0405091), it was shown that it is possible to achieve efficient heating of cylindrical targets by electromagnetic beams with transverse dimensions that are several orders of magnitude greater than those of the cylinder.…
We present a numerical method for solving Weyl's embedding problem which consists of finding a global isometric embedding of a positively curved and positive-definite spherical 2-metric into the Euclidean three space. The method is based on…
Let $p$ be a prime number and $\varsigma$ and $m$ be a positive integers. Let $\mathcal{R} = \mathbb{F}_{2^m} + u\mathbb{F}_{2^m} + u^2\mathbb{F}_{2^m}$ ($u^3 = 0$). Cyclic codes of length $2^\varsigma$ over $\mathcal{R}$ are precisely the…
The notion of ideal embeddings was introduced in [B.-Y. Chen, {Strings of Riemannian invariants, inequalities, ideal immersions and their applications.} The Third Pacific Rim Geometry Conference (Seoul, 1996), 7-60, Int. Press, Cambridge,…
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…
We study embeddings of the unit sphere of complex Hilbert spaces of dimension a power $2^n$ into the corresponding groups of non-singular linear transformations. For the case of $n=1$, the sphere $S_2$ of qubits is identified with…
Quantum states can be used to encode the information contained in a direction, i.e., in a unit vector. We present the best encoding procedure when the quantum state is made up of $N$ spins (qubits). We find that the quality of this optimal…
We solve the general problem of visiting all the $2^k$ nodes of a $k$-dimensional hypercube by using a polygonal chain that has minimum link-length, and we show that this optimal value is given by $h(2,k):=3 \cdot 2^{k-2}$ if and only if $k…
The problem of electromagnetic scattering by cylinders is an old problem that has been studied in many configurations. The present publication provides a theoretical study on a not yet investigated general case: the set of finite metallic…
We introduce the Constraint-Enhanced Quantum Approximate Optimization Algorithm (CE-QAOA), a shallow, constraint-aware ansatz that operates inside the one-hot product space [n]^m, where m is the number of blocks and each block is…
We study the encoding complexity for quantum error correcting codes with large rate and distance. We prove that random Clifford circuits with $O(n \log^2 n)$ gates can be used to encode $k$ qubits in $n$ qubits with a distance $d$ provided…
We address the problems of constructing quantum convolutional codes (QCCs) and of encoding them. The first construction is a CSS-type construction which allows us to find QCCs of rate 2/4. The second construction yields a quantum…
We investigate practical short-blocklength coding for the semi-deterministic binary erasure wiretap channel (BE-WTC), where the main channel to the legitimate receiver is noiseless, and the eavesdropper's channel is a binary erasure channel…
A $\lambda$-fold $r$-packing (multiple radius-$r$ covering) in a Hamming metric space is a code $C$ such that the radius-$r$ balls centered in $C$ cover each vertex of the space by not more (not less, respectively) than $\lambda$ times. The…
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…