Related papers: Optimal embedding of hypercube into cylinder

We propose a fast, distance-preserving, binary embedding algorithm to transform a high-dimensional dataset $\mathcal{T}\subseteq\mathbb{R}^n$ into binary sequences in the cube $\{\pm 1\}^m$. When $\mathcal{T}$ consists of well-spread (i.e.,…

Due to the limitations of present-day quantum hardware, it is especially critical to design algorithms that make the best possible use of available resources. When simulating quantum many-body systems on a quantum computer, straightforward…

Symmetry-protected subradiance is known to guarantee high qubit storage times in free space. We show that in one-dimensional waveguides, this is also true, but that even longer qubit storage times can be identified by considering the…

Let $Q_d$ be the hypercube of dimension $d$ and let $H$ and $K$ be subsets of the vertex set $V(Q_d)$, called configurations in $Q_d$. We say that $K$ is an \emph{exact copy} of $H$ if there is an automorphism of $Q_d$ which sends $H$ onto…

We consider the problem of embedding a subset of $\mathbb{R}^n$ into a low-dimensional Hamming cube in an almost isometric way. We construct a simple, data-oblivious, and computationally efficient map that achieves this task with high…

We show that the cyclic lamplighter group $C_2 \bwr C_n$ embeds into Hilbert space with distortion ${\rm O}(\sqrt{\log n})$. This matches the lower bound proved by Lee, Naor and Peres in \cite{LeeNaoPer}, answering a question posed in that…

Quantum superdense coding protocols enhance channel capacity by using shared quantum entanglement between two users. The channel capacity can be as high as 2 when one uses entangled qubits. However, this limit can be surpassed by using…

Let $ex(Q_n, H)$ be the largest number of edges in a subgraph $G$ of a hypercube $Q_n$ such that there is no subgraph of $G$ isomorphic to $H$. We show that for any integer $k\geq 3$, $$ex(Q_n, C_{4k+2})= O(n^{\frac{5}{6} +…

A particularly simple description of separability of quantum states arises naturally in the setting of complex algebraic geometry, via the Segre embedding. This is a map describing how to take products of projective Hilbert spaces. In this…

We present an optimal O*(n^2) time algorithm for deciding if a metric space (X,d) on n points can be isometrically embedded into the plane endowed with the l_1-metric. It improves the O*(n^2 log^2 n) time algorithm of J. Edmonds (2008).…

In this paper we study quantum algorithms for NP-complete problems whose best classical algorithm is an exponential time application of dynamic programming. We introduce the path in the hypercube problem that models many of these dynamic…

This paper considers the problem of perfectly secure communication on a modified version of Wyner's wiretap channel II where both the main and wiretapper's channels have some erasures. A secret message is to be encoded into $n$ channel…

We provide the currently fastest randomized (1+epsilon)-approximation algorithm for the closest vector problem in the infinity norm. The running time of our method depends on the dimension n and the approximation guarantee epsilon by 2^O(n)…

We show that the cylinder Z^{2n}(1):= B^2(1)\times \mathbb{R}^{2(n-1)} embeds symplectically into B^4(R) \times \mathbb{R}^{2(n-2)} if R \geq \sqrt{3}.

Double circulant codes of length $2n$ over the semilocal ring $R = \mathbb{F}_q + u\mathbb{F}_q,\, u^2=u,$ are studied when $q$ is an odd prime power, and $-1$ is a square in $\mathbb{F}_q.$ Double negacirculant codes of length $2n$ are…

A practical and scalable, optimal detection algorithm is introduced for hierarchical Gray-coded $2^n$ QAM for application in software defined communications. The introduced optimal detection algorithm is based on successive interference…

A practical quantum computer requires quantum bit (qubit) operations with low error rates in extensible architectures. We study a packaging method that makes it possible to address hundreds of superconducting qubits by means of…

Linear codes with small hulls over finite fields have been extensively studied due to their practical applications in computational complexity and information protection. In this paper, we develop a general method to determine the exact…

We prove a version of Whitney's strong embedding theorem for isometric embeddings within the general setting of the Nash-Kuiper h-principle. More precisely, we show that any $n$-dimensional smooth compact manifold admits infinitely many…

Given pairwise distinct vertices $\{\alpha_i , \beta_i\}^k_{i=1}$ of the $n$-dimensional hypercube $Q_n$ such that the distance of $\alpha_i$ and $\beta_i$ is odd, are there paths $P_i$ between $\alpha_i$ and $\beta_i$ such that $\{V…