Related papers: The maximal order property for quantum determinant…
Machine learning is a fascinating and exciting field within computer science. Recently, this excitement has been transferred to the quantum information realm. Currently, all proposals for the quantum version of machine learning utilize the…
It is usually assumed that a quantum computation is performed by applying gates in a specific order. One can relax this assumption by allowing a control quantum system to switch the order in which the gates are applied. This provides a more…
The quantum $\alpha$-determinant is defined as a parametric deformation of the quantum determinant. We investigate the cyclic $\mathcal{U}_q(\mathfrak{sl}_2)$-submodules of the quantum matrix algebra $\mathcal{A}_q(\mathrm{Mat}_2)$…
Compiling a high-level quantum circuit down to a low-level description that can be executed on state-of-the-art quantum computers is a crucial part of the software stack for quantum computing. One step in compiling a quantum circuit to some…
An algorithm for factoring polynomials over finite fields is given by Berlekamp in 1967. The main tool was the matrix Q corresponding to each polynomial. This paper studies the degrees of polynomials over binary field that associated with…
We continue our study of exponent semigroups of rational matrices. Our main result is that the matricial dimension of a numerical semigroup is at most its multiplicity (the least generator), greatly improving upon the previous upper bound…
The study of the combinatorics of the modular group and of Coxeter's friezes naturally leads to the investigation of a matrix equation, sometimes referred to as the Conway-Coxeter equation. The solutions of size $n$ of this equation, called…
An ideal I in a polynomial ring S has linear powers if all the powers I^k of I have a linear free resolution. We show that the ideal of maximal minors of a sufficiently general matrix with linear entries has linear powers. The required…
The method is introduced for fast data processing by reducing the probability amplitudes of undesirable elements. The algorithm has a mathematical description and circuit implementation on a quantum processor. The idea is to make a quick…
A pivotal task in quantum metrology, and quantum parameter estimation in general, is to de- sign schemes that achieve the highest precision with given resources. Standard models of quantum metrology usually assume the dynamics is fixed, the…
A dimension group is a partially ordered countable group such that (1) every finite subset is contained in an ordered subgroup which is a finite direct power of Z and (2) the group has an order unit i.e. a positive element u such that every…
Quaternary code (QC) designs form an attractive class of nonregular factorial fractions. We develop a complementary set theory for characterizing optimal QC designs that are highly fractionated in the sense of accommodating a large number…
Let K be a field and let M_n(K) denote the space of n x n matrices with entries in K. Let M be a subspace of M_n(K) of dimension d with the property that there are elements in M with non-zero determinant. Given a basis of M, we define the…
In this paper, we establish some criteria to detect the presence of the maximal ideal $(x_1, \ldots, x_n)$ in the set of associated primes of powers of monomial ideals in the polynomial ring $K[x_1, \ldots, x_n]$. Furthermore, for each of…
Gradient-based optimization is a key ingredient of variational quantum algorithms, with applications ranging from quantum machine learning to quantum chemistry and simulation. The parameter-shift rule provides a hardware-friendly method for…
We study the set of monomial ideals in a polynomial ring as an ordered set, with the ordering given by reverse inclusion. We give a short proof of the fact that every antichain of monomial ideals is finite. Then we investigate ordinal…
The ideal I generated by the 2x2 quantum minors in the algebra A = O_q(M_{m,n}(k)) (the quantized coordinate algebra of mxn matrices) is investigated. Analogues of the First and Second Fundamental Theorems of Invariant Theory are proved. In…
It is known that quantum computers yield a speed-up for certain discrete problems. Here we want to know whether quantum computers are useful for continuous problems. We study the computation of the integral of functions from the classical…
We obtain an asymptotic upper bound for the product of the $p$-parts of the orders of certain composition factors of a finite group acting completely reducibly and faithfully on a finite vector space of order divisible by a prime $p$. An…
Given a square, nonsingular matrix of univariate polynomials $\mathbf{F}\in\mathbb{K}[x]^{n\times n}$ over a field $\mathbb{K}$, we give a deterministic algorithm for finding the determinant of $\mathbf{F}$. The complexity of the algorithm…