相关论文: Aperiodic logarithmic signatures

We aim to establish a scalable scheme for characterising diagonal non-Clifford gates for single- and multi-qudit systems; \(d\) is a prime-power integer. By employing cyclic operators and a qudit T gate, we generalise the dihedral…

We describe a method, based on the theory of Macdonald-Koornwinder polynomials, for proving bounded Littlewood identities. Our approach provides an alternative to Macdonald's partial fraction technique and results in the first examples of…

We describe an equivalent formulation of algebraic weak factorisation systems, not involving monads and comonads, but involving double categories of morphisms equipped with a lifting operation satisfying lifting and factorisation axioms.

Building upon the rule-algebraic stochastic mechanics framework, we present new results on the relationship of stochastic rewriting systems described in terms of continuous-time Markov chains, their embedded discrete-time Markov chains and…

In this paper a three fuzzy vault schemes which integrated with discrete logarithmic encryption scheme are proposed. In the first scheme, the message m is encoded with discrete logarithmic encryption scheme using randomly generated identity…

The main aim of this paper is to classify the distinct multiplicative Lie algebra structures (up to isomorphism) on a given group. We also see that for a given group $G$, every homomorphism from the non-abelian exterior square $G \wedge G$…

We prove the existence of signed combinatorial interpretations for several large families of structure constants. These families include standard bases of symmetric and quasisymmetric polynomials, as well as various bases in Schubert…

We investigate randomized benchmarking in a general setting with quantum gates that form a representation, not necessarily an irreducible one, of a finite group. We derive an estimate for the average fidelity, to which experimental data may…

A novel algorithm for producing smooth nonlinearities on digital hardware is presented. The non-linearities are inherently quadratic and have both symmetrical and asymmetrical variants. The integer (and fixed point) implementation is highly…

Sometimes it is possible to embed an algebraic trapdoor into a block cipher. Building on previous research, in this paper we investigate an especially dangerous algebraic structure, which is called a hidden sum and which is related to some…

Stochastic Barrier Functions (SBFs) certify the safety of stochastic systems by formulating a functional optimization problem, which state-of-the-art methods solve using Sum-of-Squares (SoS) polynomials. This work focuses on polynomial SBFs…

Let G be a block matrix function with one diagonal block A being positive definite and the off diagonal blocks complex conjugates of each other. Conditions are obtained for G to be factorable (in particular, with zero partial indices) in…

With the development of Shor's algorithm, some nondeterministic polynomial (NP) time problems (e.g. prime factorization problems and discrete logarithm problems) may be solved in polynomial time. In recent years, although some homomorphic…

Here we study the automorphism groups of $1$-designs constructed from finite nonabelian simple groups by using two methods presented in Moori (Information Security, Coding Theory and Related Combinatorics, 2011). We obtain some general…

The BMR16 circuit garbling scheme introduces gadgets that allow for ciphertext-free modular addition, while the multiplication of private inputs modulo a prime p can be done with 2(p - 1) ciphertexts as described in Malkin, Pastro, and…

In this paper we propose a numerical scheme for partitioned systems of index 2 DAEs, such as those arising from nonholonomic mechanical problems and prove the order of a certain class of Runge-Kutta methods we call of Lobatto-type. The…

Path signatures are powerful nonparametric tools for time series analysis, shown to form a universal and characteristic feature map for Euclidean valued time series data. We lift the theory of path signatures to the setting of Lie group…

We introduce a family of rings of symmetric functions depending on an infinite sequence of parameters. A distinguished basis of such a ring is comprised by analogues of the Schur functions. The corresponding structure coefficients are…

One can develop the basic structure theory of linear algebraic groups (the root system, Bruhat decomposition, etc.) in a way that bypasses several major steps in the standard development, including the self-normalizing property of Borel…

In this paper, we introduce polynomial time algorithms that generate random $k$-noncrossing partitions and 2-regular, $k$-noncrossing partitions with uniform probability. A $k$-noncrossing partition does not contain any $k$ mutually…