相关论文: On computations with Double Schubert Automaton and…
It has long been envisioned that the strength of the barcode invariant of filtered cellular complexes could be increased using cohomology operations. Leveraging recent advances in the computation of Steenrod squares, we introduce a new…
For a linearly ordered group $G$ let us define a subset $A\subseteq G$ to be a \emph{shift-set} if for any $x,y,z\in A$ with $y < x$ we get $x\cdot y^{-1}\cdot z\in A$. We describe the natural partial order and solutions of equations on the…
Let $K$ be a complete non-trivially valued non-Archimedean field. Given an algebraic group over $K$ on which every regular function is constant, any rigid analytic function is shown to be constant too. It follows that an algebraic group…
We consider two quantum cryptographic schemes relying on encoding the key into qudits, i.e. quantum states in a d-dimensional Hilbert space. The first cryptosystem uses two mutually unbiased bases (thereby extending the BB84 scheme), while…
We introduce a notion of stable spherical variety which includes the spherical varieties under a reductive group $G$ and their flat equivariant degenerations. Given any projective space $\bP$ where $G$ acts linearly, we construct a moduli…
We adapt Grayson's model of higher algebraic $K$-theory using binary acyclic complexes to the setting of stable $\infty$-categories. As an application, we prove that the $K$-theory of stable $\infty$-categories preserves infinite products.
Many quantum algorithms can be represented in a form of a classical circuit positioned between quantum Fourier transformations. Motivated by the search for new quantum algorithms, we turn to circuits where the latter transformation is…
We discuss the construction of $n$-qubit pure states with maximum bipartite entanglement across all possible choices of $k$ vs $n-k$ bi-partitioning, which implies that the Von Neumann entropy of every $k$-qubit reduced density matrix…
Consider a finite dimensional real vector space and a finite group acting unitarily on it. We study the general problem of constructing Euclidean stable embeddings of the quotient space of orbits. Our embedding is based on subsets of sorted…
The quantum Fourier transform (QFT) has emerged as the primary tool in quantum algorithms which achieve exponential advantage over classical computation and lies at the heart of the solution to the abelian hidden subgroup problem, of which…
We present a bijective algorithm with which an arbitrary permutation decomposes canonically into elementary blocks which we call families, which are sets with a specified number of ascents and descents. We show that families, arranged in an…
The stability of Bernstein's characterization of Gaussian distributions is extended to vectors by utilizing characteristic functions. Stability is used to develop a soft doubling argument that establishes the optimality of Gaussian vectors…
The problem of discriminating between many quantum channels with certainty is analyzed under the assumption of prior knowledge of algebraic relations among possible channels. It is shown, by explicit construction of a novel family of…
Quantum simulations of non-Abelian gauge theories require efficient mappings onto quantum computers and practical state preparation and measurement procedures. A truncation of the Hilbert space of non-Abelian lattice gauge theories with…
A graph $X$ is said to be unstable if the direct product $X \times K_2$ (also called the canonical double cover of $X$) has automorphisms that do not come from automorphisms of its factors $X$ and $K_2$. It is nontrivially unstable if it is…
For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…
A graph $X$ is said to be "unstable" if the direct product $X \times K_2$ (also called the canonical double cover of $X$) has automorphisms that do not come from automorphisms of its factors $X$ and $K_2$. It is "nontrivially unstable" if…
In a 1937 paper B.H. Neumann constructed an uncountable family of $2$-generated groups. We prove that all of his groups are permutation stable by analyzing the structure of their invariant random subgroups.
We consider the stability of high-order Scott-Vogelius elements for 2D non-Newtonian incompressible flow problems. For elements of degree 4 or higher, we construct a right-inverse of the divergence operator that is stable uniformly in the…
We extend the construction of multiplicative representations for a free group G introduced by Kuhn and Steger (Isr. J., (144) 2004) in such a way that the new class Mult(G) so defined is stable under taking the finite direct sum, under…