Related papers: A q-weighted version of the Robinson-Schensted alg…
Without large quantum computers to empirically evaluate performance, theoretical frameworks such as the quantum statistical query (QSQ) are a primary tool to study quantum algorithms for learning classical functions and search for quantum…
Discovering which tables in large, heterogeneous repositories can be joined and by what transformations is a central challenge in data integration and data discovery. Traditional join discovery methods are largely designed for equi-joins,…
We present the details of a new factorized approach to semi-inclusive deep-inelastic scattering which treats QED and QCD radiation on equal footing, and provides a systematically improvable approximation to the extraction of transverse…
Quantum signal processing (QSP) is a methodology for constructing polynomial transformations of a linear operator encoded in a unitary. Applied to an encoding of a state $\rho$, QSP enables the evaluation of nonlinear functions of the form…
The Stochastic Weighted Particle Method (SWPM) of Rjasanow and Wagner is a generalization of the Direct Simulation Monte Carlo method for computing the probability density function of the velocities of a system of interacting particles for…
We give a Littlewood-Richardson type rule for expanding the product of a row-strict quasisymmetric Schur function and a symmetric Schur function in terms of row-strict quasisymmetric Schur functions. This expansion follows from several new…
Solving a quadratic nonlinear system of equations (QNSE) is a fundamental, but important, task in nonlinear science. We propose an efficient quantum algorithm for solving $n$-dimensional QNSE. Our algorithm embeds QNSE into a…
In semi-supervised learning, student-teacher distribution matching has been successful in improving performance of models using unlabeled data in conjunction with few labeled samples. In this paper, we aim to replicate that success in the…
By means of the Ehrhart theory of inside-out polytopes we establish a general counting theory for nonattacking placements of chess pieces with unbounded straight-line moves, such as the queen, on a polygonal convex board. The number of ways…
Robots find extensive applications in industry. In recent years, the influence of robots has also increased rapidly in domestic scenarios. The Q-learning algorithm aims to maximise the reward for reaching the goal. This paper proposes a…
A new Chase-type soft-decision decoding algorithm for Reed-Solomon codes is proposed, referred to as tree-based Chase-type algorithm}. The proposed tree-based Chase-type algorithm takes the set of all vectors as the set of testing patterns,…
Since classical machine learning has become a powerful tool for developing data-driven algorithms, quantum machine learning is expected to similarly impact the development of quantum algorithms. The literature reflects a mutually beneficial…
A simple protocol which takes advantage of the inherent random times of detections in single photon counting modules is presented for random active basis choices when using entanglement-based protocols for Quantum Key Distribution (QKD). It…
We consider the task of aligning two sets of points in high dimension, which has many applications in natural language processing and computer vision. As an example, it was recently shown that it is possible to infer a bilingual lexicon,…
Barely set-valued tableaux are a variant of Young tableaux in which one box contains two numbers as its entry. It has recently been discovered that there are product formulas enumerating certain classes of barely set-valued tableaux. We…
In this paper, we consider distributed algorithms for solving the empirical risk minimization problem under the master/worker communication model. We develop a distributed asynchronous quasi-Newton algorithm that can achieve superlinear…
We develop a fundamental framework for the quantum mechanics of stochastic systems (QMSS), showing that classical discrete stochastic processes emerge naturally as perturbations of the quantum harmonic oscillator (QHO). By constructing…
This paper presents a quantum algorithm for solving the fractional Poisson equation \((-\Delta)^s u = f\) with \(s \in (0,1)\) on bounded domains. The proposed approach combines rational approximation techniques with quantum linear system…
We consider the sequence $( Q_n )_{n=1}^{\infty}$ of semi-meander polynomials which are used in the enumeration of semi-meandric systems (a family of diagrams related to the classical stamp-folding problem). We show that for a fixed natural…
We survey old and new results about optimal algorithms for summation of finite sequences and for integration of functions from Hoelder or Sobolev spaces. First we discuss optimal deterministic and randomized algorithms. Then we add a new…