Related papers: Noncommutative Spherical Codes
This paper provides a semidefinite programming hierarchy based on state polynomial optimization to determine the existence of quantum codes with given parameters. The hierarchy is complete, in the sense that a $(\!(n, K, {\delta})\!)_2$…
We improve the previously best known upper bounds on the sizes of $\theta$-spherical codes for every $\theta<\theta^*\approx 62.997^{\circ}$ at least by a factor of $0.4325$, in sufficiently high dimensions. Furthermore, for sphere packing…
An important topic in quantum information is the theory of error correction codes. Practical situations often involve quantum systems with states in an infinite dimensional Hilbert space, for example coherent states. Motivated by these…
The quest to reveal the physical essence of the infinitely many symmetries and conservation laws that are intrinsic to integrable systems has historically posed a significant challenge at the confluence of physics and mathematics. This…
It is often said that the transition from quantum to classical worlds is caused by decoherence originated from an interaction between a system of interest and its surrounding environment. Here we establish a computational quantum-classical…
In order to resolve the measurement problem of Quantum Mechanics, non-unitary time evolution has been derived from the unitarity of standard quantum formalism. New wave functions of free and non-free quantum systems follow from Schroedinger…
We continue our study, initiated in our earlier paper, of Riemann surfaces with constant curvature and isolated conic singularities. Using the machinery developed in that earlier paper of extended configuration families of simple divisors,…
We show that the Euclidean Snyder non-commutative space implies infinitely many different physical predictions. The distinct frameworks are specified by generalized uncertainty relations underlying deformed Heisenberg algebras. Considering…
Our experience shows that dealing with noncommutative objects one should not imitate the classical commutative mathematics, but follow "the way it is" starting with basics. In this paper we consider mainly two such problems: noncommutative…
A theorem of H\"ubner states that non-round boundary points of the numerical range of a linear operator, i.e. points where the boundary has infinite curvature, are contained in the spectrum of the operator. In this note, answering a…
Since the beginning of the quest of hypercomplex numbers in the late eighteenth century, many hypercomplex number systems have been proposed but none of them succeeded in extending the concept of complex numbers to higher dimensions. This…
We introduce the concepts of complex Grassmannian codes and designs. Let G(m,n) denote the set of m-dimensional subspaces of C^n: then a code is a finite subset of G(m,n) in which few distances occur, while a design is a finite subset of…
Intersecting codes are linear codes where every two nonzero codewords have non-trivially intersecting support. In this article we expand on the theory of this family of codes, by showing that nondegenerate intersecting codes correspond to…
We study a class of spherically symmetric Stephani cosmological models in the presence of a self-interacting scalar field in both classical and quantum domains. We discuss the construction of `canonical' wave packets resulting from the…
A celebrated result of Beck shows that for any set of $N$ points on $\mathbb{S}^d$ there always exists a spherical cap $B \subset \mathbb{S}^d$ such that number of points in the cap deviates from the expected value $\sigma(B) \cdot N$ by at…
Given a closed oriented manifold or more generally a group homology class, we introduce the spherical Plateau problem, which is a variational problem corresponding to a topological invariant called the spherical volume. In principle, its…
We give one more proof of the first linear programming bound for binary codes, following the line of work initiated by Friedman and Tillich. The new argument is somewhat similar to previous proofs, but we believe it to be both simpler and…
We recover the first linear programming bound of McEliece, Rodemich, Rumsey, and Welch for binary error-correcting codes and designs via a covering argument. It is possible to show, interpreting the following notions appropriately, that if…
The sphere packing bound, in the form given by Shannon, Gallager and Berlekamp, was recently extended to classical-quantum channels, and it was shown that this creates a natural setting for combining probabilistic approaches with some…
The sphere packing bound, in the form given by Shannon, Gallager and Berlekamp, was recently extended to classical-quantum channels, and it was shown that this creates a natural setting for combining probabilistic approaches with some…