相关论文: Instructive discussion of an effective block algor…

We present the barycentric Lagrange dual tree traversal (BLDTT) fast summation method for particle interactions. The scheme replaces well-separated particle-particle interactions by adaptively chosen particle-cluster, cluster-particle, and…

It has been argued by Grigoriev and Rubakov that one can simulate real time processes involving baryon number non-conservation at high temperature using real time evolution of classical equations, and summing over initial conditions with a…

A reliable and efficient computation of the entire single-particle spectrum of correlated molecules is an outstanding challenge in the field of quantum chemistry, with standard density functional theory approaches often giving an inadequate…

We present an efficient approach to the electron correlation problem that is well-suited for strongly interacting many-body systems, but requires only mean-field-like computational cost. %which is based on orbital optimization of electron…

We investigate the theoretical complexity of branch-and-bound (BB) and cutting plane (CP) algorithms for mixed-integer optimization. In particular, we study the relative efficiency of BB and CP, when both are based on the same family of…

This paper introduces an Enhanced Boolean version of the Correlation Matrix Memory (CMM), which is useful to work with binary memories. A novel Boolean Orthonormalization Process (BOP) is presented to convert a non-orthonormal Boolean…

HHL algorithm \cite{harrow} to solve linear system is a powerful and efficient quantum technique to deal with many matrix operations (such as matrix multiplication, powers and inversion). It inspires many applications in quantum machine…

A simple comparison between the exact and approximate correlation components U of the electron-electron repulsion energy of several states of few-electron harmonium atoms with varying confinement strengths provides a superior validation…

Kernel methods provide a principled way to perform non linear, nonparametric learning. They rely on solid functional analytic foundations and enjoy optimal statistical properties. However, at least in their basic form, they have limited…

Efficient block encoding of many-body Hamiltonians is a central requirement for quantum algorithms in scientific computing, particularly in the early fault-tolerant era. In this work, we introduce new explicit constructions for block…

Immersed boundary-lattice Boltzmann method (IB-LBM) has been widely used for simulation of particle-laden flows recently. However, it was limited to small-scale simulations with no more than O(103) particles. Here, we expand IB-LBM for…

Understanding the short-range nucleon-nucleon interaction is essential for the interpretation of correlation femtoscopy measurements in high-energy hadronic and nuclear collisions. We present an analytical treatment of the strong…

The DBSCAN method for spatial clustering has received significant attention due to its applicability in a variety of data analysis tasks. There are fast sequential algorithms for DBSCAN in Euclidean space that take $O(n\log n)$ work for two…

We describe an algorithm that computes the ground state energy and correlation functions for 2-local Hamiltonians in which interactions between qubits are weak compared to single-qubit terms. The running time of the algorithm is polynomial…

The construction of conformal blocks for the analysis of multipoint correlation functions with $N > 4$ local field insertions is an important open problem in higher dimensional conformal field theory. This is the first in a series of papers…

We utilize known exact analytic solutions of perfect fluid hydrodynamics to analytically calculate the polarization of baryons produced in heavy ion collisions. Assuming local thermodynamical equilibrium also for spin degrees of freedom,…

Cluster algorithms are developed for simulating quantum spin systems like the one- and two-dimensional Heisenberg ferro- and anti-ferromagnets. The corresponding two- and three-dimensional classical spin models with four-spin couplings are…

Cluster algorithms are developed for simulating quantum spin systems like the one- and two-dimensional Heisenberg ferro- and anti-ferromagnets. The corresponding two- and three-dimensional classical spin models with four-spin couplings are…

The role of 5-quark operators in extracting the nucleon excited state spectrum via correlation matrix techniques is explored. In particular, the coupling of meson-baryon operators to nucleon resonance states and scattering states is…

This paper introduces an algorithm designed to approximate quantum transformation matrix with a restricted number of gates by using the block decomposition technique. Addressing challenges posed by numerous gates in handling large qubit…