Related papers: Noncommutative Spherical Codes
We consider a problem of the consistent deformation of physical system introducing a new features, but preserving its fundamental properties. In particular, we study how to implement the noncommutativity of space-time without violation of…
We show that non-round boundary points of the numerical range of an unbounded operator (i.e. points where the boundary has infinite curvature) are contained in the spectrum of the operator. Moreover, we show that non-round boundary points,…
We combine the coordinate method and Erlangen program in the framework of noncommutative geometry through an investigation of symmetries of noncommutative coordinate algebras. As the model we use the coherent states construction and the…
By considering (non-relativistic) quantum mechanics as it is done in practice in particular in condensed-matter physics, it is argued that a deterministic, unitary time evolution within a chosen Hilbert space always has a limited scope,…
Specifying a computational problem requires fixing encodings for input and output: encoding graphs as adjacency matrices, characters as integers, integers as bit strings, and vice versa. For such discrete data, the actual encoding is…
Noncommutative geometry, in its many incarnations, appears at the crossroad of various researches in theoretical and mathematical physics: from models of quantum space-time (with or without breaking of Lorentz symmetry) to loop gravity and…
Inspired by a recently formulated conjecture by Bannai et al. we investigate spherical codes which admit exactly three different distances and are spherical 5-designs. Computing and analyzing distance distributions we provide new proof of…
We describe the multiplier algebra of the noncommutative Schwartz space. This multiplier algebra can be seen as the largest ${}^*$-algebra of unbounded operators on a separable Hilbert space with the classical Schwartz space of rapidly…
We provide a new upper bound for sampling numbers $(g_n)_{n\in \mathbb{N}}$ associated to the compact embedding of a separable reproducing kernel Hilbert space into the space of square integrable functions. There are universal constants…
We derive upper and lower bounds on the sum of distances of a spherical code of size $N$ in $n$ dimensions when $N\sim n^\alpha, 0<\alpha\le 2.$ The bounds are derived by specializing recent general, universal bounds on energy of spherical…
Let C: {0,1}^n -> {0,1}^m be a code encoding an n-bit string into an m-bit string. Such a code is called a (q, c, e) smooth code if there exists a decoding algorithm which while decoding any bit of the input, makes at most q probes on the…
We apply the generalized sphere-packing bound to two classes of subblock-constrained codes. A la Fazeli et al. (2015), we made use of automorphism to significantly reduce the number of variables in the associated linear programming problem.…
In recent years, the traditional notion of symmetry in quantum theory was expanded to so-called generalised or categorical symmetries, which, unlike ordinary group symmetries, may be non-invertible. This appears to be at odds with Wigner's…
Symmetries in discrete constraint satisfaction problems have been explored and exploited in the last years, but symmetries in continuous constraint problems have not received the same attention. Here we focus on permutations of the…
A Delaunay cell decomposition of a surface with constant curvature gives rise to a circle pattern, consisting of the circles which are circumscribed to the facets. We treat the problem whether there exists a Delaunay cell decomposition for…
Using the Riemann Hypothesis over finite fields and bounds for the size of spherical codes, we give explicit upper bounds, of polynomial size with respect to the size of the field, for the number of geometric isomorphism classes of…
In the paper, some geometric properties of the plane interception curve defined by a nonlinear ordinary differential equation are discussed. Its parametric representation is used to find the limits of some triangle elements associated with…
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree polynomials on the Euclidean sphere or on the Hamming cube. We prove lower…
This is a comprehensive review on fault-tolerant topological quantum computation with the surface codes. The basic concepts and useful tools underlying fault-tolerant quantum computation, such as universal quantum computation, stabilizer…
In this paper we introduce the notion of a spherical knot mosaic where a knot is represented by tiling the surface of a topological 2-sphere with 11 canonical knot mosaic tiles and show this gives rise to several novel knot (and link)…