相关论文: Candidate One-Way Functions and One-Way Permutatio…

q-Neumann function of integer order N_n(x,q) is obtained and some of its properties are given. q-Psi function which is used in deriving N_n(x,q) is also introduced and some of its properties are presented.

We show, in a formal way, how a class of complex quasiprobability distribution functions may be introduced by using the fractional Fourier transform. This leads to the Fresnel transform of a characteristic function instead of the usual…

For the quantum integer $[n]_q = 1+q+...+q^{n-1}$ there is a natural polynomial multiplication $*_q$ such that $[m]_q *_q [n]_q = [mn]_q$. This multiplication leads to the functional equation $f_{mn}(q) = f_m(q)f_n(q^m),$ defined on a given…

In this paper we define a new concept of quasi-convolution for analytic functions normalized by $f(0)=0$ and $f^\prime(0)=1$ in the unit disk $E=\{z\in \mathbb{C}\colon |z|<1\}$. We apply this new approach to study the closure properties of…

The Cartan-Maurer equations for any $q$-group of the $A_{n-1}, B_n, C_n, D_n$ series are given in a convenient form, which allows their direct computation and clarifies their connection with the $q=1$ case. These equations, defining the…

In this paper, we propose OneQ, the first optimizing compilation framework for one-way quantum computation towards realistic photonic quantum architectures. Unlike previous compilation efforts for solid-state qubit technologies, our…

The 1/N expansion in quantum field theory is formulated within an algebraic framework. For a scalar field taking values in the $N$ by $N$ hermitian matrices, we rigorously construct the gauge invariant interacting quantum field operators in…

The algebra of so-called shifted symmetric functions on partitions has the property that for all elements a certain generating series, called the $q$-bracket, is a quasimodular form. More generally, if a graded algebra $A$ of functions on…

Quantum neural networks (QNN) hold immense potential for the future of quantum machine learning (QML). However, QNN security and robustness remain largely unexplored. In this work, we proposed novel Trojan attacks based on the quantum…

Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical ``black box'' function drawn from some set of such black box functions, we investigate a more general quantum query model…

We study the deterministic query complexity of Boolean functions on slices of the hypercube. The $k^{th}$ slice $\binom{[n]}{k}$ of the hypercube $\{0,1\}^n$ is the set of all $n$-bit strings with Hamming weight $k$. We show that there…

We present methods for implementing arbitrary permutations of qubits under interaction constraints. Our protocols make use of previous methods for rapidly reversing the order of qubits along a path. Given nearest-neighbor interactions on a…

Polynomial functions on the group of units Q_n of the ring Z_{2^n} are considered. A finite set of reduced polynomials RP_n in Z[x] that induces the polynomial functions on Q_n is determined. Each polynomial function on Q_n is induced by a…

The existence of one-way functions is arguably the most important problem in computer theory. The article discusses and refines a number of concepts relevant to this problem. For instance, it gives the first combinatorial complete owf,…

Hardcore functions have been used as a technical tool to construct secure cryptographic systems; however, little is known on their quantum counterpart, called quantum hardcore functions. With a new insight into fundamental properties of…

The conventional Quantum Fourier Transform, with exponential speedup compared to the classical Fast Fourier Transform, has played an important role in quantum computation as a vital part of many quantum algorithms (most prominently, the…

We examine combinatorial counting functions with two parameters, $n$ and $q$. For fixed $q$, these functions are (quasi-)polynomial in $n$. As $q$ varies, the degree of this polynomial is itself polynomial in $q$, as are the leading…

Quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given in a black box and the aim is to compute function value for arbitrary input using as few queries as possible. We concentrate on quantum…

The next bit test was introduced by Blum and Micali and proved by Yao to be a universal test for cryptographic pseudorandom generators. On the other hand, no universal test for the cryptographic one-wayness of functions (or permutations) is…

In 2003, Leonid A. Levin presented the idea of a combinatorial complete one-way function and a sketch of the proof that Tiling represents such a function. In this paper, we present two new one-way functions based on semi-Thue string…