相关论文: On computations with Double Schubert Automaton and…

This paper introduces and studies the stability of the strong domination number of a graph, denoted $\operatorname{st}_{\gamma_{st}}(G)$, defined as the minimum number of vertices whose removal changes the strong domination number…

We construct and evaluate group-equivariant neural networks for the prediction of the two-dimensional $Q$-tensor order parameter of nematic liquid crystals from synthetically generated microscopic textures. Seven architectures, equivariant…

With respect to the transversal gate group (an invariant of quantum codes), we demonstrate that non-additive codes can outperform stabilizer codes. We do this by constructing spin codes that correspond to permutation-invariant multiqubit…

We study 2-cocycle twists, or equivalently Zhang twists, of semigroup algebras over a field k. If the underlying semigroup is affine, that is abelian, cancellative and finitely generated, then Spec k[S] is an affine toric variety over k,…

Nonproduct n-qubit pure states with maximum dimensional stabilizer subgroups of the group of local unitary transformations are precisely the generalized n-qubit Greenberger-Horne-Zeilinger states and their local unitary equivalents, for n…

We observe that the expansion in the basis of Schubert cycles for $H^*(G/B)$ of the class of a Richardson variety stable under a spherical Levi subgroup is described by a theorem of Brion. Using this observation, along with a combinatorial…

We provide an equivalence between the category of affine, smooth group schemes over the ring of generalized dual numbers $k[I]$, and the category of extensions of the form $1 \rightarrow \text{Lie}(G, I) \rightarrow E \rightarrow G…

Given a hereditary family $\mathcal{G}$ of admissible graphs and a function $\lambda(G)$ that linearly depends on the statistics of order-$\kappa$ subgraphs in a graph $G$, we consider the extremal problem of determining…

We propose BQTRU, a non-commutative NTRU-like cryptosystem over quaternion algebras. This cryptosystem uses bivariate polynomials as the underling ring. The multiplication operation in our cryptosystem can be performed with high speed using…

In this paper, we investigate how quantum architectures affect the efficiency of the execution of the quantum Fourier transform (QFT) and linear transformations, which are essential parts of the stabilizer/Clifford group circuits. In…

For a regular ring R and an affine monoid M the homotheties of M act nilpotently on the Milnor unstable groups of R[M]. This strengthens the K_2 part of the main result of [G5] in two ways: the coefficient field of characteristic 0 is…

The compression of quantum circuits is a foundational challenge for near-term quantum computing, yet the principles governing circuit stability remain poorly understood. We investigate this problem through a large-scale numerical analysis…

We equip the categorified quantum group attached to a KLR algebra and an arbitrary choice of scalars with duality functor which is cyclic, that is, such that f=f^** for all 2-morphisms f. This is accomplished via a modified diagrammatic…

We study a closed differential form on the symmetric space of positive definite matrices, which is defined using the Pfaffian and is $\mathsf{GL}_{2n}(\mathbb{Z})$ invariant up to a sign. It gives rise to an infinite family of unstable…

We define two invariants for (semiprime right Goldie) algebras, one for algebras graded by arbitrary abelian groups, which is unchanged under twists by $2$-cocycles on the grading group, and one for $\mathbb Z$-graded or $\mathbb Z_{\ge…

Given a classical symmetric pair, $(G,K)$, with $\mathfrak g = Lie(G)$, we provide descriptions of the Hilbert series of the algebra of $K$-invariant vectors in the associated graded algebra of $\mathcal U(\mathfrak g)$ viewed as a…

We propose a systematic procedure for the construction of graphs associated with binary quantum stabilizer codes. The procedure is characterized by means of the following three step process. First, the stabilizer code is realized as a…

The theory of quantum algorithms promises unprecedented benefits of harnessing the laws of quantum mechanics for solving certain computational problems. A persistent obstacle to using such algorithms for solving a wide range of real-world…

In this expository article we present an overview of the current state-of-the-art in post-quantum group-based cryptography. We describe several families of groups that have been proposed as platforms, with special emphasis in polycyclic…

Composite quantum states can be classified by how they behave under local unitary transformations. Each quantum state has a stabilizer subgroup and a corresponding Lie algebra, the structure of which is a local unitary invariant. In this…