Related papers: Bounds in the Projective Unitary Group with Respec…

We prove that for any constant $K>0$ there exists a separable group equipped with a complete bi-invariant metric bounded by $K$, isometric to the Urysohn sphere of diameter $K$, that is of `almost-universal disposition'. It is thus an…

We introduce twisted unitary $t$-groups, a generalization of unitary $t$-groups under a twisting by an irreducible representation. We then apply representation theoretic methods to the Knill-Laflamme error correction conditions to show that…

Many homogeneous, four-dimensional space-time geometries can be considered within real projective geometry, which yields a mathematically well-defined framework for their deformations and limits without the appearance of singularities.…

The weighted-Hamming metric generalizes the Hamming metric by assigning different weights to blocks of coordinates. It is well-suited for applications such as coding over independent parallel channels, each of which has a different level of…

We use the Gelfand-Tsetlin pattern to construct an effective Hamiltonian, completely integrable action of a torus T on an open dense subset of a coadjoint orbit of the unitary group. We then identify a proper Hamiltonian T-manifold centered…

Using the numerical modular bootstrap, we constrain the space of 1+1d CFTs with a finite non-invertible global symmetry described by a fusion category $\mathcal{C}$. We derive universal and rigorous upper bounds on the lightest…

We study covering problems in Hamming and Grassmann spaces through a unified coding-theoretic and information-theoretic framework. Viewing covering as a form of quantization in general metric spaces, we introduce the notion of the average…

Many quantum information protocols require the implementation of random unitaries. Because it takes exponential resources to produce Haar-random unitaries drawn from the full $n$-qubit group, one often resorts to $t$-designs. Unitary…

We prove the existence of a quantum isometry groups for new classes of metric spaces: (i) geodesic metrics for compact connected Riemannian manifolds (possibly with boundary) and (ii) metric spaces admitting a uniformly distributed…

We establish Euclidean-type lower bounds for the codimension-1 Hausdorff measure of sets that separate points in doubling and linearly locally contractible metric manifolds. This gives a quantitative topological isoperimetric inequality in…

Let $G\curvearrowright M$ be an isometric action of a Lie Group on a complete orientable Riemannian manifold. We disintegrate absolutely continuous measures with respect to the volume measure of $M$ along the principal orbits of…

Mott physics - the interplay between itinerancy and localization of electrons - is undergoing a paradigm shift from the binary "bandwidth - filling" tuning framework to an intertwining of geometric, topological, and fractionalized degrees…

We survey problems and results from combinatorial geometry in normed spaces, concentrating on problems that involve distances. These include various properties of unit-distance graphs, minimum-distance graphs, diameter graphs, as well as…

Let $E$ be a smooth bundle with fiber an $n$-dimensional real projective space $\mathbb{R}P^n$. We show that, if every fiber carries a positively curved pointwise strongly $1/4$-pinched Riemannian metric that varies continuously with…

Product measures of dimension $n$ are known to be concentrated in Hamming distance: for any set $S$ in the product space of probability $\epsilon$, a random point in the space, with probability $1-\delta$, has a neighbor in $S$ that is…

We investigate the amount of noise required to turn a universal quantum gate set into one that can be efficiently modelled classically. This question is useful for providing upper bounds on fault tolerant thresholds, and for understanding…

In this paper, we study the distribution of the minimal distance (in the Hamming metric) of a random linear code of dimension $k$ in $\mathbb{F}_q^n$. We provide quantitative estimates showing that the distribution function of the minimal…

Simulating physical systems on near-term quantum computers often requires preparing states within constrained subspaces, like those with fixed particle number or spin. We use Lie algebraic techniques to prove that hardware-efficient gates…

We employ signed measures that are positive definite up to certain degrees to establish Levenshtein-type upper bounds on the cardinality of codes with given minimum and maximum distances, and universal lower bounds on the potential energy…

In this paper we obtain some bounds on communication complexity of Gap Hamming Distance problem ($\mathsf{GHD}^n_{L, U}$): Alice and Bob are given binary string of length $n$ and they are guaranteed that Hamming distance between their…