Related papers: RSK and Quantum Symmetric Functions: A Combinatori…
A quantum algorithm for general combinatorial search that uses the underlying structure of the search space to increase the probability of finding a solution is presented. This algorithm shows how coherent quantum systems can be matched to…
We explore the near-term intersection of quantum computing with the transport sector. To support near-term integration, we introduce a framework for assessing the suitability of transport optimization problems for obtaining potential…
A quantum algorithm for combinatorial search is presented that provides a simple framework for utilizing search heuristics. The algorithm is evaluated in a new case that is an unstructured version of the graph coloring problem. It performs…
In this paper, we study rational functions of $q$-Racah type and a multivariate extension, using representation theory of $\mathcal U_q(\mathfrak{sl}_2)$. Eigenfunctions of twisted primitive elements in $\mathcal U_q(\mathfrak{su}_2)$ can…
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.…
We introduce and study several combinatorial properties of a class of symmetric polynomials from the point of view of integrable vertex models in finite lattice. We introduce the $L$-operator related with the $U_q(sl_2)$ $R$-matrix, and…
The radial basis function (RBF) method is used for the numerical solution of the Poisson problem in high dimension. The approximate solution can be found by solving a large system of linear equations. Here we investigate the extent to which…
We consider an operator of Bernstein for symmetric functions, and give an explicit formula for its action on an arbitrary Schur function. This formula is given in a remarkably simple form when written in terms of some notation based on the…
In this paper, we focus on the links between Boolean function theory and quantum computing. In particular, we study the notion of what we call fully-balanced functions and analyse the Fourier--Hadamard and Walsh supports of those functions…
In this paper, we introduce a method for multivariate function approximation using function evaluations, Chebyshev polynomials, and tensor-based compression techniques via the Tucker format. We develop novel randomized techniques to…
We introduce a q-weighted version of the Robinson-Schensted (column insertion) algorithm which is closely connected to q-Whittaker functions (or Macdonald polynomials with t=0) and reduces to the usual Robinson-Schensted algorithm when q=0.…
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…
Stochastic realization of the wave function in quantum mechanics, with the inclusion of soliton representation of extended particles, is discussed. The concept of Stochastic Qubits is used for quantum computing modeling.
We show that some of the main structural constants for symmetric functions (Littlewood-Richardson coefficients, Kronecker coefficients, plethysm coefficients, and the Kostka--Foulkes polynomials) share symmetries related to the operations…
Stochastic variance reduction algorithms have recently become popular for minimizing the average of a large, but finite number of loss functions. The present paper proposes a Riemannian stochastic quasi-Newton algorithm with variance…
We consider the $q$th root number function for the symmetric group. Our aim is to develop an asymptotic formula for the multiplicities of the $q$th root number function as $q$ tends to $\infty$. We use character theory, number theory and…
This paper surveys our recent research on quantum information processing by nuclear magnetic resonance (NMR) spectroscopy. We begin with a geometric introduction to the NMR of an ensemble of indistinguishable spins, and then show how this…
We introduce an insertion algorithm on Kohnert's combinatorial model for Demazure characters, generalizing Robinson--Schensted--Knuth insertion on tableaux. Our new insertion yields an explicit, nonnegative formula expressing the product 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…
What might a combinatorial interpretation of the Kronecker coefficients even look like? We introduce a class of combinatorial objects called bitableaux, which we believe are a natural candidate, and we formulate a purely combinatorial…