相关论文: Algebraic aspects of solving Ring-LWE, including r…

Quantum annealing is a heuristic algorithm that solves combinatorial optimization problems, and D-Wave Systems Inc. has developed hardware implementation of this algorithm. However, in general, we cannot embed all the logical variables of a…

Ritt-Wu's algorithm of characteristic sets is the most representative for triangularizing sets of multivariate polynomials. Pseudo-division is the main operation used in this algorithm. In this paper we present a new algorithmic scheme for…

This paper introduces a non-variational quantum algorithm designed to solve a wide range of combinatorial optimisation problems, including constrained and non-binary problems. The algorithm leverages an engineered interference process…

A new weak Galerkin (WG) finite element method for solving the biharmonic equation in two or three dimensional spaces by using polynomials of reduced order is introduced and analyzed. The WG method is on the use of weak functions and their…

We present a Baxterization of a two-colour generalization of the Birman--Wenzl--Murakami (BWM) algebra. Appropriately combining two RSOS-type representations of the ordinary BWM algebra, we construct representations of the two-colour…

Quantum machine learning with quantum kernels for classification problems is a growing area of research. Recently, quantum kernel alignment techniques that parameterise the kernel have been developed, allowing the kernel to be trained and…

Within the framework of complex system design, it is often necessary to solve mixed variable optimization problems, in which the objective and constraint functions can depend simultaneously on continuous and discrete variables.…

Calculation of Bayesian posteriors and model evidences typically requires numerical integration. Bayesian quadrature (BQ), a surrogate-model-based approach to numerical integration, is capable of superb sample efficiency, but its lack of…

A modified LAB algorithm is introduced in this paper. It builds upon the original LAB algorithm (Reddy et al. 2023), which is a socio-inspired algorithm that models competitive and learning behaviours within a group, establishing…

Sampling random variables following a Boltzmann distribution is an NP-hard problem involved in various applications such as training of \textit{Boltzmann machines}, a specific kind of neural network. Several attempts have been made to use a…

The demand for extracting rules from high dimensional real world data is increasing in various fields. However, the possible redundancy of such data sometimes makes it difficult to obtain a good generalization ability for novel samples. To…

Clustering is one of the most fundamental tools in data science and machine learning, and k-means clustering is one of the most common such methods. There is a variety of approximate algorithms for the k-means problem, but computing the…

Efficient methods for the simulation of quantum circuits on classic computers are crucial for their analysis due to the exponential growth of the problem size with the number of qubits. Here we study lumping methods based on bisimulation,…

We develop an improved stochastic formalism for the Bethe-Salpeter equation, based on an exact separation of the effective-interaction $W$ to two parts, $W=(W-v_W)+v_W$ where the latter is formally any translationally-invariant interaction…

We present a new semi-external algorithm that builds the Burrows--Wheeler transform variant of Bauer et al. (a.k.a., BCR BWT) in linear expected time. Our method uses compression techniques to reduce computational costs when the input is…

The Best-Worst Method (BWM) is a well-known Multi-Criteria Decision-Making (MCDM) method. This article deals with the multiplicative model of BWM. We first formulate an optimization model that is equivalent to the existing multiplicative…

Variational Quantum Algorithms are a vital part of quantum computing. It is a blend of quantum and classical methods for tackling tough problems in machine learning, chemistry, and combinatorial optimization. Yet as these algorithms scale…

Boolean Networks (BNs) are established models to qualitatively describe biological systems. The analysis of BNs might be infeasible for medium to large BNs due to the state-space explosion problem. We propose a novel reduction technique…

In this paper we propose an alternative to the coupling of Berkes, Liu and Wu [1] to obtain strong approximations for partial sums of dependent sequences. The main tool is a new Rosen-thal type inequality expressed in terms of the coupling…

In this article we want to demonstrate the effectiveness of the new D-Wave quantum annealer, D-Wave 2000Q, in dealing with real world problems. In particular, it is shown how the quantum annealing process is able to find global optima even…