相关论文: The Computational Complexity of Rules for the Char…

Online Arabic cursive character recognition is still a big challenge due to the existing complexities including Arabic cursive script styles, writing speed, writer mood and so forth. Due to these unavoidable constraints, the accuracy of…

An algorithm for image processing is proposed. The proposed algorithm, which can be viewed as a quantum-classical hybrid algorithm, can transform a low-resolution bitonal image of a character from the set of alphanumeric characters (A-Z,…

We outline refined versions of two major quantum algorithms for performing principal component analysis and solving linear equations. Our methods are exponentially faster than their classical counterparts and even previous quantum…

The character table of the symmetric group $S_n$, of permutations of $n$ objects, is of fundamental interest in theoretical physics, combinatorics as well as computational complexity theory. We investigate the implications of an identity,…

With the development of low order scaling methods for performing Kohn-Sham Density Functional Theory, it is now possible to perform fully quantum mechanical calculations of systems containing tens of thousands of atoms. However, with an…

A fundamental problem in computer science is to find all the common zeroes of $m$ quadratic polynomials in $n$ unknowns over $\mathbb{F}_2$. The cryptanalysis of several modern ciphers reduces to this problem. Up to now, the best complexity…

A Maple code is presented for algebraic collective model (ACM) calculations. The ACM is an algebraic version of the Bohr model of the atomic nucleus, in which all required matrix elements are derived by exploiting the model's SU(1,1) x…

We present two algorithms for the computation of the Kalman form of a linear control system. The first one is based on the technique developed by Keller-Gehrig for the computation of the characteristic polynomial. The cost is a logarithmic…

We address the question of computing one selected term of an algebraic power series. In characteristic zero, the best algorithm currently known for computing the $N$th coefficient of an algebraic series uses differential equations and has…

For an arbitrary infinite field k of characteristic p > 0, we describe the structure of a block of the algebraic monoid M_n(k) (all n x n matrices over k), or, equivalently, a block of the Schur algebra S(n,p), whose simple modules are…

One of the main features of eigenvalue matrix models is that the averages of characters are again characters, what can be considered as a far-going generalization of the Fourier transform property of Gaussian exponential. This is true for…

In mathematical aspect, we introduce quantum algorithm and the mathematical structure of quantum computer. Quantum algorithm is expressed by linear algebra on a finite dimensional complex inner product space. The mathematical formulations…

Quantum computers can execute algorithms that sometimes dramatically outperform classical computation. Undoubtedly the best-known example of this is Shor's discovery of an efficient quantum algorithm for factoring integers, whereas the same…

We develop an algorithm for computing the weight distribution of a linear $[n,k]$ code over a finite field $\mathbb{F}_q$. We represent the codes by their characteristic vector with respect to a given generator matrix and a special type of…

Quantum computers can execute algorithms that dramatically outperform classical computation. As the best-known example, Shor discovered an efficient quantum algorithm for factoring integers, whereas factoring appears to be difficult for…

Algencan is a well established safeguarded Augmented Lagrangian algorithm introduced in [R. Andreani, E. G. Birgin, J. M. Mart\'{\i}nez and M. L. Schuverdt, On Augmented Lagrangian methods with general lower-level constraints, SIAM Journal…

We study an array of graphene nano sheets that form a two-dimensional S = 1/2 Kagome spin lattice used for quantum computation. The edge states of the graphene nano sheets are used to form quantum dots to confine electrons and perform the…

Quantum algorithms are sequences of abstract operations, performed on non-existent computers. They are in obvious need of categorical semantics. We present some steps in this direction, following earlier contributions of Abramsky, Coecke…

We consider the Grothendieck polynomials appearing in the K-theory of Grassmannians, which are analogs of Schur polynomials. This paper aims to establish a version of the Murnaghan-Nakayama rule for Grothendieck polynomials of the…

Recently, there has been a surge of interest for quantum computation for its ability to exponentially speed up algorithms, including machine learning algorithms. However, Tang suggested that the exponential speed up can also be done on a…