Related papers: Quantum $A_r$ Q-system solutions as q-multinomial …
Quantum processes with indefinite causal structure emerge when we wonder which are the most general evolutions, allowed by quantum theory, of a set of local systems which are not assumed to be in any particular causal order. These processes…
As a particular one parameter deformation of the quantum determinant, we introduce a quantum $\alpha$-determinant and study the $\mathcal{U}_q(\mathfrak{gl}_n)$-cyclic module generated by it: We show that the multiplicity of each…
We propose a new formalism of quantum subsystems which allows to unify the existing and new methods of reduced description of quantum systems. The main mathematical ingredients are completely positive maps and correlation functions. In this…
As in classical reversible computing, Quantum Arithmetic is typically seen as a set of tools that process binary data encoded into a quantum register to set the value of another quantum register. This article presents another approach to…
The multinomial coefficient and their recurrence relations from the generalized quantum deformed algebras are examined. Moreover, the $\mathcal{R}(p,q)-$ deformed multinomial probability distribution and the negative $\mathcal{R}(p,q)-$…
It is recently conjectured in quantum information processing that phase-shift errors occur with high probability than qubit-flip errors, hence the former is more disturbing to quantum information than the later one. This leads us to…
In this work we define an universal arithmetical algorithm, by means of the standard quantum mechanical formalism, called universal qm-arithmetical algorithm. By universal qm-arithmetical algorithm any decidable arithmetical formula…
Let $X_r$ be a finite type Dynkin diagram, and $\ell$ be a positive integer greater than or equal to two. The $Y$-system of type $X_r$ with level $\ell$ is a system of algebraic relations, whose solutions have been proved to have…
Modular pairs of some second order q-difference equations are considered. These equations may be interpreted as a quantum mechanics of a sort of hyperelliptic pendulum. It is shown the quantization of a spectrum may be provided by the…
Using the theory of functions of several complex variables, we prove that if an analytic function in several variables satisfies a system of $q$-partial differential equations, then, it can be expanded in terms of the product of the…
Quantum computers require quantum arithmetic. We provide an explicit construction of quantum networks effecting basic arithmetic operations: from addition to modular exponentiation. Quantum modular exponentiation seems to be the most…
This article surveys quantum computational complexity, with a focus on three fundamental notions: polynomial-time quantum computations, the efficient verification of quantum proofs, and quantum interactive proof systems. Properties of…
Representations of quantum computations are almost always based on a tensor product $\otimes$-structure. This coincides with what we are able to execute in our experiments, as well as what we observe in Nature, but it makes certain familiar…
We introduce bivariate versions of the continuous q-Hermite polynomials. We obtain algebraic properties for them (generating function, explicit expressions in terms of the univariate ones, backward difference equations and recurrence…
A C# package is presented that allows a user for an input quantum circuit to generate a set of multivariate polynomials over the finite field Z_2 whose total number of solutions in Z_2 determines the output of the quantum computation…
This survey article is concerned with the modeling of the kinematical structure of quantum systems in an algebraic framework which eliminates certain conceptual and computational difficulties of the conventional approaches. Relying on the…
A physical system is determined by a finite set of initial conditions and "laws" represented by equations. The system is computable if we can solve the equations in all instances using a "finite body of mathematical knowledge". In this…
Let $r$ be a prime power and $q=r^m$. For $0\le i\le m-1$, let $f_i\in \mathbb{F}_r[x]$ be $q$-linearized and $a_i\in \mathbb{F}_q$. Assume that $z\in \mathbb{\bar{F}}_r$ satisfies the equation $\sum_{i=0}^{m-1}a_if_i(z)^{r^i}=0$, where…
Shor's algorithm for factoring in polynomial time on a quantum computer\cite{Shor} gives an enormous advantage over all known classical factoring algorithm. We demonstrate how to factor products of large prime numbers using a compiled…
Quantum computing promises to speed up some of the most challenging problems in science and engineering. Quantum algorithms have been proposed showing theoretical advantages in applications ranging from chemistry to logistics optimization.…