Related papers: q-Peano Kernel and its Applications
The q-binomial coefficients are the polynomial cousins of the traditional binomial coefficients, and a number of identities for binomial coefficients can be translated into this polynomial setting. For instance, the familiar vanishing of…
We introduce the cross-composition framework for proving kernelization lower bounds. A classical problem L AND/OR-cross-composes into a parameterized problem Q if it is possible to efficiently construct an instance of Q with polynomially…
The main objective of this paper is to introduce the modified q-Genocchi polynomials and to define their generating function. In the paper, we show new relations, which are explicit formula, derivative formula, multiplication formula, and…
We give a purely complex geometric proof of the existence of the Bergman kernel expansion. Our method provides a sharper estimate, and in the case that the metrics are real analytic, we prove that the remainder decays faster than any…
We present a language extension for parallel quantum programming to (1) remove ambiguities concerning parallelism in current quantum programming languages and (2) facilitate space-time tradeoff investigations in quantum computing. While the…
Let $\lambda =\left( \lambda_{1},\lambda_{2},...,\lambda_{r}\right) $ be an integer partition, and $\left[p_{\lambda }\right] $ the $q$-analog of the symmetric power function $%p_{\lambda }$. This $q$-analogue has been defined as a special…
Nyquist-Shannon sampling theorem, instrumental in classical telecommunication technologies, is extended to quantum systems supporting a unitary representation of a finite group $G$. Two main ideas from the classical theory having natural…
Variants of the q-hypergeometric equation were introduced in our previous paper with Hatano. In this paper, we consider degenerations of the variant of the q-hypergeometric equation, which is a q-analogue of confluence of singularities in…
We show that a qubit can be used to substitute for an arbitrarily large number of classical bits. We consider a physical system S interacting locally with a classical field phi(x) as it travels directly from point A to point B. The field…
Due to recent technological advances, actual quantum devices are being constructed and used to perform computations. As a result, many classical problems are being restated so as to be solved on quantum computers. Some examples include…
The interest in $q$-analogs of codes and designs has been increased in the last few years as a consequence of their new application in error-correction for random network coding. There are many interesting theoretical, algebraic, and…
Recently, machine learning had a remarkable impact, from scientific to everyday-life applications. However, complex tasks often imply unfeasible energy and computational power consumption. Quantum computation might lower such requirements,…
We give an $n$-space generalized $q$-binomial theorem, and some new $q$ series identities that resemble the traditional $q$ series partition generating functions. These identities enumerate stepping stone weighted vector partitions.
The purpose of this paper is to construct q-Euler numbers and polynomials by using p-adic q-integral equations on Zp. Finally, we will give some interesting formulae related to these q-Euler numbers and polynomials.
This paper initiates the study of quantum computing within the constraints of using a polylogarithmic ($O(\log^k n), k\geq 1$) number of qubits and a polylogarithmic number of computation steps. The current research in the literature has…
Alternative partial Boolean structures, implicit in the discussion of classical representability of sets of quantum mechanical predictions, are characterized, with definite general conclusions on the equivalence of the approaches going back…
We consider quantum interpolation of polynomials. We imagine a quantum computer with black-box access to input/output pairs (x_i, f(x_i)), where f is a degree-d polynomial, and we wish to compute f(0). We give asymptotically tight quantum…
This research is aimed to give a determinantal definition for the $q$-Appell polynomials and show some classical properties as well as find some interesting properties of the mentioned polynomials in the light of the new definition.
Fractional calculus and q-deformed Lie algebras are closely related. Both concepts expand the scope of standard Lie algebras to describe generalized symmetries. A new class of fractional q-deformed Lie algebras is proposed, which for the…
The success of kernel-based learning methods depend on the choice of kernel. Recently, kernel learning methods have been proposed that use data to select the most appropriate kernel, usually by combining a set of base kernels. We introduce…