相关论文: Candidate One-Way Functions and One-Way Permutatio…
In solving $q$-difference equations, and in the definition of $q$-special functions, we encounter formal power series in which the $n$th coefficient is of size $q^{-\binom{n}{2}}$ with $q\in(0,1)$ fixed. To make sense of these formal…
This paper presents how to make use of the advantage of round-off error effect in some research areas. The float-point operation complies with the reproduce theorem without the external random perturbation. The computation uncertainty…
The ability to implement the Quantum Fourier Transform (QFT) efficiently on a quantum computer facilitates the advantages offered by a variety of fundamental quantum algorithms, such as those for integer factoring, computing discrete…
Quantum machine learning (QML) seeks to exploit the intrinsic properties of quantum mechanical systems, including superposition, coherence, and quantum entanglement for classical data processing. However, due to the exponential growth of…
In this work we establish some new interleavers based on permutation functions. The inverses of these interleavers are known over a finite field $\mathbb{F}_q$. For the first time M\"{o}bius and R\'edei functions are used to give new…
We investigate a generalization of stacks that we call $\mathcal{C}$-machines. We show how this viewpoint rapidly leads to functional equations for the classes of permutations that $\mathcal{C}$-machines generate, and how these systems of…
The matrix functions can be defined by Cauchy's integral formula and can be approximated by the linear combination of inverses of shifted matrices using a quadrature formula. In this paper, we show a concrete construction of a framework to…
The coinvariant algebra is a quotient of the polynomial ring $\mathbb{Q}[x_1,\ldots,x_n]$ whose algebraic properties are governed by the combinatorics of permutations of length $n$. A word $w = w_1 \dots w_n$ over the positive integers is…
We define a nonlinear Fourier transform which maps sequences of contractive $n \times n$ matrices to $SU(2n)$-valued functions on the circle $\mathbb{T}$. We characterize the image of finitely supported sequences and square-summable…
Driven by the interest of reasoning about probabilistic programming languages, we set out to study a notion of unicity of normal forms for them. To provide a tractable proof method for it, we define a property of distribution confluence…
Using the tool of quantum characteristic functions of n-mode states in the boson Fock space {\Gamma}(C_n) we construct a semigroup of quantum information channels. This leads to a special class of one-parameter semigroups of such channels.…
Quantum neural networks (QNNs) are an analog of classical neural networks in the world of quantum computing, which are represented by a unitary matrix with trainable parameters. Inspired by the universal approximation property of classical…
MiniQCrypt is a world where quantum-secure one-way functions exist, and quantum communication is possible. We construct an oblivious transfer (OT) protocol in MiniQCrypt that achieves simulation-security in the plain model against malicious…
A problem based on the Extended Euclidean Algorithm applied to a class of polynomials with many factors is presented and believed to be hard. If so, it is a one-way function well suited for applications in digital signicatures.
In this paper, we investigate the behavior of monomials in the $q$-characters of the fundamental modules over a quantum affine algebra of untwisted type C. As a result, we give simple closed formulae for the $q$-characters of the…
The $q$-analogue of the binomial coefficient, known as a $q$-binomial coefficient, is typically denoted $\left[{n \atop k}\right]_q$. These polynomials are important combinatorial objects, often appearing in generating functions related to…
For an integer partition $ \lambda$ of $n$ and an $n \times n$ matrix $A$, consider the expansion of the immanant $\text{Imm}^{\lambda}(A)$ as a sum indexed by permutations $\sigma$ of order $n$, with coefficients given by the irreducible…
An $n$-ary operation $Q:S^n\to S$ is called an $n$-ary quasigroup of order $|S|$ if in the equation $x_0=Q(x_1,...,x_n)$ knowledge of any $n$ elements of $x_0,...,x_n$ uniquely specifies the remaining one. An $n$-ary quasigroup $Q$ is…
We construct a new class of operators that act on symmetric functions with two deformation parameters $q$ and $t$. Our combinatorial construction associates each operator with a specific lattice path, whose steps alternate between moving up…
We provide a non-interactive quantum bit commitment scheme which has statistically-hiding and computationally-binding properties from any quantum one-way function. Our protocol is basically a parallel composition of the previous…