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

A one-way quantum computer works by only performing a sequence of one-qubit measurements on a particular entangled multi-qubit state, the cluster state. No non-local operations are required in the process of computation. Any quantum logic…

Tsallis' q-Fourier transform is not generally one-to-one. It is shown here that, if we eliminate the requirement that $q$ be fixed, and let it instead "float", a simple extension of the $F_q-$definition, this procedure restores the…

This paper realizes of two families of combinatorial symmetric functions via the complex character theory of the finite general linear group $\mathrm{GL}_{n}(\mathbb{F}_{q})$: chromatic quasisymmetric functions and vertical strip LLT…

Quantum field theories with purely virtual particles, or fakeons, require suitable modifications in one-loop integrals. We provide the expressions for the modified scalar integrals in the case of the bubble, triangle and box diagrams. The…

We provide a classification of compact quantum groups, which can be obtained by the Woronowicz construction, when the arrays used in the twisted determinant condition are extensions of functions on permutations. General properties of such…

I continue the investigation of a q-analogue of the convolution on the line started in a joint work with Koornwinder and based on a formal definition due to Kempf and Majid. Two different ways of approximating functions by means of the…

The existence of one-way functions is one of the most fundamental assumptions in classical cryptography. In the quantum world, on the other hand, there are evidences that some cryptographic primitives can exist even if one-way functions do…

Let S_n be the nth symmetric group. Given a set of permutations Pi we denote by S_n(Pi) the set of permutations in S_n which avoid Pi in the sense of pattern avoidance. Consider the generating function Q_n(Pi) = sum_pi F_{Des pi} where the…

We investigate the problem of cryptanalysis as a problem belonging to the class NP. A class of problems UF is defined for which the time constructing any feasible solution is polynomial. The properties of the problems of NP, which may be…

A single-qubit circuit can approximate any bounded complex function stored in the degrees of freedom defining its quantum gates. The single-qubit approximant presented in this work is operated through a series of gates that take as their…

Quantum computing promises to exploit the laws of quantum mechanics for processing information in ways fundamentally different from today's classical computers, leading to unprecedented efficiency. One-way quantum computation, sometimes…

We define a counting function that is related to the binomial coefficients. An explicit formula for this function is proved. In some particular cases, simpler explicit formuls are derived. We also derive a formula for the number of…

Reversible computation is one of the most promising emerging technologies of the future. The usage of reversible circuits in computing devices can lead to a significantly lower power consumption. In this paper we study reversible logic…

We define a one-parameter family of two-sided coideals in U_q(gl(n)) and study the corresponding algebras of infinitesimally right invariant functions on the quantum unitary group U_q(n). The Plancherel decomposition of these algebras with…

We present a simplified exposition of some pieces of [Gily\'en, Su, Low, and Wiebe, STOC'19, arXiv:1806.01838], which introduced a quantum singular value transformation (QSVT) framework for applying polynomial functions to block-encoded…

We offer a new proof that a certain q-analogue of multinomial coeffi- cients furnishes a q-counting of the set of permutations of an associated multiset of positive integers, according to the number of inversions in such arrangements. Our…

We present a set of N-dimensional functions, based on generalized SU(N)-symmetric coherent states, that represent finite-dimensional Wigner functions, Q-functions, and P-functions. We then show the fundamental properties of these functions…

We introduce and analyze a novel quantum machine learning model motivated by convolutional neural networks. Our quantum convolutional neural network (QCNN) makes use of only $O(\log(N))$ variational parameters for input sizes of $N$ qubits,…

This paper studies the important problem of quantum classification of Boolean functions from a entirely novel perspective. Typically, quantum classification algorithms allow us to classify functions with a probability of $1.0$, if we are…

We present new algorithms to compute fundamental properties of a Boolean function given in truth-table form. Specifically, we give an O(N^2.322 log N) algorithm for block sensitivity, an O(N^1.585 log N) algorithm for `tree decomposition,'…