Related papers: Quantum $A_r$ Q-system solutions as q-multinomial …
The theory of q-analogs develops many combinatorial formulas for finite vector spaces over a finite field with q elements--all in analogy with formulas for finite sets (which are the special case of q=1). A direct-sum decomposition of a…
A new basis for the polynomial ring of infinitely many variables is constructed which consists of products of Schur functions and Q-functions. The transition matrix from the natural Schur function basis is investigated.
Quantum computation has suggested new forms of quantum logic, called quantum computational logics. The basic semantic idea is the following: the meaning of a sentence is identified with a quregister, a system of qubits, representing a…
The purpose of this paper is to present an addition formula for so-called $q$-disk polynomials, using some quantum group theory. This result is a $q$-analogue of a result which was proved around 1970 by ${\breve{\text S}}$apiro [S] and…
We present a multivariable generalization of the digital binomial theorem from which a q-analog is derived as a special case.
Fermionic formulae originate in the Bethe ansatz in solvable lattice models. They are specific expressions of some q-polynomials as sums of products of q-binomial coefficients. We consider the fermionic formulae associated with general…
We consider the cluster algebra associated to the $Q$-system for $A_r$ as a tool for relating $Q$-system solutions to all possible sets of initial data. We show that the conserved quantities of the $Q$-system are partition functions for…
Classical programming languages cannot model essential elements of complex systems such as true random number generation. This paper develops a formal programming language called the lambda-q calculus that addresses the fundamental…
Transformation formulas for four-parameter refinements of the q-trinomial coefficients are proven. The iterative nature of these transformations allows for the easy derivation of several infinite series of q-trinomial identities, and can be…
Recently, it has been presented some algorithms and physical models which give prospects for construction of quantum computers capable to solve systems of linear equations. The common feature which is shared in these works is the use of…
The Heisenberg equations of motion for a quantum particle of mass $m$ are deduced from the infinitesimal qr-number equations of motion for the particle. The infinitesimal qr-number equations, and hence the standard quantum mechanical…
We study Schur Q-polynomials evaluated on a geometric progression, or equivalently q-enumeration of marked shifted tableaux, seeking explicit formulas that remain regular at q=1. We obtain several such expressions as multiple basic…
The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are unitary topological modular functors. They underlie the Jones polynomial and arise in Witten-Chern-Simons…
We describe explicit algorithms for factoring q-difference operators and solving q-difference equations. These are well known results, presented in a "concrete" form. ----- Nous decrivons des algorithmes explicites pour la factorisation…
We provide a sufficient condition for solvability of a system of real quadratic equations $p_i(x)=y_i$, $i=1, \ldots, m$, where $p_i: {\mathbb R}^n \longrightarrow {\mathbb R}$ are quadratic forms. By solving a positive semidefinite…
We describe quantum theories for massless (p,q)-forms living on Kaehler spaces. In particular we consider four different types of quantum theories: two types involve gauge symmetries and two types are simpler theories without gauge…
Using the theory of functions of several variables and $q$-calculus, we prove an expansion theorem for the analytic function in several variables which satisfies a system of $q$-partial differential equations. Some curious applications of…
It is shown that there is an absolute constant $C$ such that any rational $\frac bq\in]0, 1[, (b, q)=1$, admits a representation as a finite sum $\frac bq=\sum_\alpha\frac {b_\alpha}{q_\alpha}$ where $\sum_\alpha\sum_ia_i(\frac…
Using an algebraic framework we solve a problem posed in [5] and [7] about the axiomatizability of a quantum computational type logic related to fuzzy logic. A Hilbert-style calculus is developed obtaining an algebraic strong completeness…
A formulation of quaternionic quantum mechanics ($\mathbb{H}$QM) is presented in terms of a real Hilbert space. Using a physically motivated scalar product, we prove the spectral theorem and obtain a novel quaternionic Fourier series. After…