Related papers: The maximal order property for quantum determinant…

Let $\mathcal{R}$ be a finite valuation ring of order $q^r$. In this paper we generalize and improve several well-known results, which were studied over finite fields $\mathbb{F}_q$ and finite cyclic rings $\mathbb{Z}/p^r\mathbb{Z}$, in the…

Recently there has been several works estimating the number of $n\times n$ matrices with elements from some finite sets $\mathcal X$ of arithmetic interest and of a given determinant. Typically such results are compared with the trivial…

In this paper we study orders over Cohen-Macaulay rings. We discuss desirable properties for these orders if they are to represent NCCRs of the base rings. While some definitions have been made, we discuss an alternate definition and the…

We present an explicit basis for orders of arbitrary level N>1 in definite rational quaternion algebras. These orders have applications to computations of spaces of elliptic and quaternionic modular forms.

In this paper, we extend the theory of minimal limit key polynomials of valuations on the polynomial ring $\kx$. We use the theory of cuts on ordered abelian groups to show that the previous results on bounded sets of key polynomials of…

By using methods of umbral nature, we discuss new rules concerning the operator ordering. We apply the technique of formal power series to take advantage from the wealth of properties of the exponential operators. The usefulness of the…

For an $n$-qubit system, a rational function on the space of mixed states which is invariant with respect to the action of the group of local symmetries may be viewed as a detailed measure of entanglement. We show that the field of all such…

Let $F_q$ be a field with $q$ elements, where $q$ is a power of a prime number $p\geq 5$. For any integer $m\geq 2$ and $a\in F_q^*$ such that the polynomial $x^m-a$ is irreducible in $F_q[x]$, we combine two different methods to construct…

In a conventional circuit for quantum machine learning, the quantum gates used to encode the input parameters and the variational parameters are constructed with a fixed order. The resulting output function, which can be expressed in the…

Simple, precise, and robust control is demanded for operating a large quantum information processor. However, existing routes to high-fidelity quantum control rely heavily on arbitrary waveform generators that are difficult to scale up.…

In this paper, we investigate the structure of highest weight modules over the quantum queer superalgebra $U_q(q(n))$. The key ingredients are the triangular decomposition of $U_q(q(n))$ and the classification of finite dimensional…

We investigate the nearly Gorenstein property of a local ring defined by the maximal minors of a specific $2 \times n$ matrix with entries in the formal power series ring $k[[X_1, X_2, \ldots , X_n]]$ over a field $k$. Our findings allow us…

In this work, we present a logical formalism for reasoning about quantum systems in finite dimension. Contrary to the usual approach in quantum logic, our formalism is based classical first-order logic, which allows us to use the tools of…

This paper presents a theorem which solves the problem of reduction of the determinant order by means of a transformation of it, into other determinant whose each element are a determinant of second order. This implies that, if the process…

We propose a mathematical framework that we call quantum, higher-order Fourier analysis. This generalizes the classical theory of higher-order Fourier analysis, which led to many advances in number theory and combinatorics. We define a…

This paper describes a quantum algorithm for finding the maximum among N items. The classical method for the same problem takes O(N) steps because we need to compare two numbers in one step. This algorithm takes O(sqrt(N)) steps by…

The development of tailored materials for specific applications is an active field of research in chemistry, material science and drug discovery. The number of possible molecules that can be obtained from a set of atomic species grow…

Quantum computing is powerful because unitary operators describing the time-evolution of a quantum system have exponential size in terms of the number of qubits present in the system. We develop a new "Singular value transformation"…

We study higher order determinantal varieties obtained by considering generic $m\times n$ ($m \le n$) matrices over rings of the form $F[t]/(t^k)$, and for some fixed $r$, setting the coefficients of powers of $t$ of all $r \times r$ minors…

We show that the set of Julia limiting directions of a transcendental-type $K$-quasiregular mapping $f:\mathbb{R}^n\to \mathbb{R}^n$ must contain a component of a certain size, depending on the dimension $n$, the maximal dilatation $K$, and…