Related papers: Quantifier elimination for approximate Beals-Karta…
A number of engineering and scientific problems require representing and manipulating probability distributions over large alphabets, which we may think of as long vectors of reals summing to $1$. In some cases it is required to represent…
We present the first numerical solution to the next to leading order Balitsky-Kovchegov (BK) equation in coordinate space in the large-$N_\mathrm{c}$ limit. In addition to the dipole operator we also solve the evolution of the "conformal…
The capability of discretization of matrix elements in the problem of quadratic functional minimization with linear member built on matrix in N-dimensional configuration space with discrete coordinates is researched. It is shown, that…
Given a compact basic semi-algebraic set $K\subset R^n\times R^m$, a simple set $B$ (box or ellipsoid), and some semi-algebraic function $f$, we consider sets defined with quantifiers, of the form $R_f:=\{x\in B: \mbox{$f(x,y)\leq 0$ for…
We consider parametric families of partial differential equations--PDEs where the parameter $\kappa$ modifies only the (1,1) block of a saddle point matrix product of a discretization below. The main goal is to develop an algorithm that…
Abstraction layers are of paramount importance in software architecture, as they shield the higher-level formulation of payload computations from lower-level details. Since quantum computing (QC) introduces many such details that are often…
Estimating expectation values on near-term quantum computers often requires a prohibitively large number of measurements. One widely-used strategy to mitigate this problem has been to partition an operator's Pauli terms into sets of…
The Smith reduction is a basic tool when analyzing integer matrices up to equivalence, and the Kannan-Bachem (KB) algorithm is the first polynomial algorithm computing such a reduction. Using this algorithm in complicated situations where…
We consider the NP-hard problem of finding the closest rank-one binary tensor to a given binary tensor, which we refer to as the rank-one Boolean tensor factorization (BTF) problem. This optimization problem can be used to recover a planted…
We consider an automatic construction of locally optimal preconditioners for positive definite linear systems. To achieve this goal, we introduce a differentiable loss function that does not explicitly include the estimation of minimal…
An efficient integer factorization algorithm would reduce the security of all variants of the RSA cryptographic scheme to zero. Despite the passage of years, no method for efficiently factoring large semiprime numbers in a classical…
Addressing the interpretability problem of NMF on Boolean data, Boolean Matrix Factorization (BMF) uses Boolean algebra to decompose the input into low-rank Boolean factor matrices. These matrices are highly interpretable and very useful in…
Despite rapid progress in the development of quantum algorithms in quantum computing as well as numerical simulation methods in classical computing for atomic and molecular applications, no systematic and comprehensive electronic structure…
We use the factorization method to find the exact eigenvalues and eigenfunctions for a particle in a box with the delta function potential $V(x)=\lambda\delta(x-x_{0})$. We show that the presence of the potential results in the…
Feynman's prescription for a quantum simulator was to find a hamitonian for a system that could serve as a computer. P\'olya and Hilbert conjecture was to demonstrate Riemann's hypothesis through the spectral decomposition of hermitian…
Quantum Annealing (QA) can efficiently solve combinatorial optimization problems whose objective functions are represented by Quadratic Unconstrained Binary Optimization (QUBO) formulations. For broader applicability of QA, quadratization…
In this paper, we present several new linearizations of a quadratic binary optimization problem (QBOP), primarily using the method of aggregations. Although aggregations were studied in the past in the context of solving system of…
The Balitsky-Kovchegov (BK) evolution equation is an equation derived from perturbative Quantum Chromodynamics that allows one to evolve with collision energy the scattering amplitude of a pair of quark and antiquark off a hadron target,…
The Kalman decomposition for Linear Quantum Stochastic Systems in the real quadrature operator representation, that was derived indirectly in [1] by the authors, is derived here directly, using the "one-sided symplectic" SVD-like…
We treat the accurate simulation of the calcination reaction in particles, where the particles are large and, thus, the inner-particle processes must be resolved. Because these processes need to be described with coupled partial…