Related papers: Bounds in the Projective Unitary Group with Respec…
We study the size of the isometry group Isom(M, g) of Riemannian manifolds (M, g) as g varies. For M not admitting a circle action, we show that the order of Isom(M, g) can be universally bounded in terms of the bounds on Ricci curvature,…
Codebooks with small inner-product correlation have application in unitary space-time modulations, multiple description coding over erasure channels, direct spread code division multiple access communications, compressed sensing, and coding…
In this paper we introduce a projective invarinat measure on the special unitary group. It is directly related to transition probabilities. It has some interesting connection with convex geometry. Applications to approximation of quantum…
Let $\Gamma$ be a discrete group acting by isometries on a product $X=X_1\times X_2$ of Hadamard spaces. We further require that $X_1$, $X_2$ are locally compact and $\Gamma$ contains two elements projecting to a pair of independent rank…
We introduce a class of hybrid quantum circuits, with random unitaries and projective measurements, which host long-range order in the area law entanglement phase of the steady state. Our primary example is circuits with unitaries…
Volume estimates of metric balls in manifolds find diverse applications in information and coding theory. In this paper, some new results for the volume of a metric ball in unitary group are derived via various tools from random matrix…
We prove that $poly(t) \cdot n^{1/D}$-depth local random quantum circuits with two qudit nearest-neighbor gates on a $D$-dimensional lattice with n qudits are approximate $t$-designs in various measures. These include the "monomial"…
We present two new quantum union bounds for sequential projective measurements. These bounds estimate the disturbance accumulation and probability of outcomes when the measurements are performed sequentially. These results are based on a…
The Lipschitz geometry of segments of the infinite Hamming cube is studied. Tight estimates on the distortion necessary to embed the segments into spaces of continuous functions on countable compact metric spaces are given. As an…
We have generalized the well-known statement that the Clifford group is a unitary 3-design into symmetric cases by extending the notion of unitary design. Concretely, we have proven that a symmetric Clifford group is a symmetric unitary…
The density of a code is the fraction of the coding space covered by packing balls centered around the codewords. This paper investigates the density of codes in the complex Stiefel and Grassmann manifolds equipped with the chordal…
We derive simplified sphere-packing and Gilbert--Varshamov bounds for codes in the sum-rank metric, which can be computed more efficiently than previous ones. They give rise to asymptotic bounds that cover the asymptotic setting that has…
The Gilbert-Varshamov (GV) lower bound on the maximum cardinality of a q-ary code of length n with minimum Hamming distance at least d can be obtained by application of Turan's theorem to the graph with vertex set {0,1,..,q-1}^n in which…
The sum-rank metric can be seen as a generalization of both, the rank and the Hamming metric. It is well known that sum-rank metric codes outperform rank metric codes in terms of the required field size to construct maximum distance…
The Variational Quantum Eigensolver approach to the electronic structure problem on a quantum computer involves measurement of the Hamiltonian expectation value. Formally, quantum mechanics allows one to measure all mutually commuting or…
While phases and phase transitions are conventionally described by local order parameters in real space, we present a unified framework characterizing the phase transition through the geometry of configuration space defined by the…
Topological quantum computing promises intrinsic fault tolerance by encoding quantum information in non-Abelian anyons, where quantum gates are implemented via braiding. While braiding operations are robust against local perturbations, a…
In quantum mechanics, symmetry groups can be realized by projective, as well as by ordinary unitary, representations. For the permutation symmetry relevant to quantum statistics of N indistinguishable particles, the simplest properly…
In this article we present a unified treatment for obtaining bounds on the potential energy of codes in the general context of polynomial metric spaces (PM-spaces). The lower bounds we derive via the linear programming (LP) techniques of…
Generating functions for the size of a $r$-sphere, with respect to the Manhattan distance in an $n$-dimensional grid, are used to provide explicit formulas for the minimum and maximum size of an $r$-ball centered at a point of the grid.…