Related papers: Candidate One-Way Functions and One-Way Permutatio…

Quantum walks with one-dimensional translational symmetry are important for quantum algorithms, where the speed-up of the diffusion speed can be reached if long-range couplings are added. Our work studies a scheme of a ring under the strong…

A binary matrix satisfies the consecutive ones property (COP) if its columns can be permuted such that the ones in each row of the resulting matrix are consecutive. Equivalently, a family of sets F = {Q_1,..,Q_m}, where Q_i is subset of R…

In [arXiv 0811.3913] the authors introduced the notion of quasi-polynomial function as being a mapping f: X^n -> X defined and valued on a bounded chain X and which can be factorized as f(x_1,...,x_n)=p(phi(x_1),...,phi(x_n)), where p is a…

Chung and Graham define quasirandom subsets of $\mathbb{Z}_n$ to be those with any one of a large collection of equivalent random-like properties. We weaken their definition and call a subset of $\mathbb{Z}_n$ $\epsilon$-balanced if its…

We show that the complicated *-structure characterizing for positive q the U_qso(N)-covariant differential calculus on the non-commutative manifold R_q^N boils down to similarity transformations involving the ribbon element of a central…

This paper introduces and analyzes symmetric and anti-symmetric quantum binary functions. Generally, such functions uniquely convert a given computational basis state into a different basis state, but with either a plus or a minus sign.…

In this paper we study the variation diminishing kernel as a part of the $q$-calculus. We introduce the $q$-Macdonald function a newborne in the family of the $q$-special functions which play a central role in this study.

We show that some problems in information security can be solved without using one-way functions. The latter are usually regarded as a central concept of cryptography, but the very existence of one-way functions depends on difficult…

We introduce three one-parameter semigroups of operators and determine their spectra. Two of them are fractional integrals associated with the Askey-Wilson operator. We also study these families as families of positive linear approximation…

A skew-morphism of a finite group $G$ is a permutation $\s$ on $G$ fixing the identity element, and for which there exists an integer function $\pi$ on $G$ such that $\s(xy)=\s(x)\s^{\pi(x)}(y)$ for all $x,y\in G$. It has been known that…

We define a new basis of the algebra of quasi-symmetric functions by lifting the cycle-index polynomials of symmetric groups to noncommutative polynomials with coefficients in the algebra of free quasi-symmetric functions, and then…

In the paper we develop a method for constructing quantum algorithms for computing Boolean functions by quantum ordered read-once branching programs (quantum OBDDs). Our method is based on fingerprinting technique and representation of…

We study relations between the two-parameter $\U_q(sl(n))$-invariant deformation quantization on $sl^*(n)$ and the reflection equation algebra. The latter is described by a quantum permutation on $\End(\C^n)$ given explicitly. The…

We say that a function is rare-case hard against a given class of algorithms (the adversary) if all algorithms in the class can compute the function only on an $o(1)$-fraction of instances of size $n$ for large enough $n$. Starting from any…

Let $A_q$ be a $q$-letter alphabet and $w$ be a right infinite word on this alphabet. A subword of $w$ is a block of consecutive letters of $w$. The subword complexity function of $w$ assigns to each positive integer $n$ the number $f_w(n)$…

It has been proved that almost all $n$-bit Boolean functions have exact classical query complexity $n$. However, the situation seemed to be very different when we deal with exact quantum query complexity. In this paper, we prove that almost…

This review provides a gentle introduction to one-way quantum computing in distributed architectures. One-way quantum computation shows significant promise as a computational model for distributed systems, particularly those architectures…

Quantum computing enables quantum neural networks (QNNs) to have great potentials to surpass artificial neural networks (ANNs). The powerful generalization of neural networks is attributed to nonlinear activation functions. Although various…

In this paper the notion of quantum finite one-counter automata (QF1CA) is introduced. Introduction of the notion is similar to that of the 2-way quantum finite state automata by A.Kondacs and J.Watrous. The well-formedness conditions for…

Let $\mathbb{F}_q$ be a finite field of odd characteristic. We study R\'edei functions that induce permutations over $\mathbb{P}^1(\mathbb{F}_q)$ whose cycle decomposition contains only cycles of length $1$ and $j$, for an integer $j\geq…