Related papers: Memory efficient Fock-space recursion scheme for c…
Representing a strongly interacting multi-particle wave function in a finite product basis leads to errors. Simple rescaling of the contact interaction can preserve the low-lying energy spectrum and long-wavelength structure of wave…
One of the most efficient ways to produce unconditional simulations is with the kernel convolution using fast Fourier transform (FFT) [1]. However, when data is located on a surface, this approach is not efficient because data needs to be…
Recent success in developing increasingly general purpose agents based on sequence models has led to increased focus on the problem of deploying computationally limited agents within the vastly more complex real-world. A key challenge…
In this paper the numerical approximation of solutions of Liouville-Master Equations for time-dependent distribution functions of Piecewise Deterministic Processes with memory is considered. These equations are linear hyperbolic PDEs with…
Based on the standard many-fermion field theory, the authors construct models describing ultracold fermions in a 1D optical lattices by implementing a mode expansion of the fermionic field operator where modes, in addition to space…
We propose a distinct numerical approach to effectively solve the problem of partial diagonalization of the super-large-scale quantum electronic Hamiltonian matrices. The key ingredients of our scheme are the new method for arranging the…
We present a hybrid numerical approach to simulate quantum many body problems on two spatial dimensional quantum lattice models via the non-Abelian ab initio version of the density matrix renormalization group method on state-of-the-art…
A memristor is a nonlinear two-terminal electrical element that incorporates memory features and nanoscale properties, enabling us to design very high-density artificial neural networks. To enhance the memory property, we should use…
We study serving retrieval models, specifically late interaction models like ColBERT, to many concurrent users at once and under a small budget, in which the index may not fit in memory. We present ColBERT-serve, a novel serving system that…
In the paper, effective filtering for a type of slow-fast data assimilation systems in Hilbert spaces is considered. Firstly, the system is reduced to a system on a random invariant manifold. Secondly, nonlinear filtering of the origin…
Quantum simulators have made a remarkable progress towards exploring the dynamics of many-body systems, many of which offer a formidable challenge to both theoretical and numerical methods. While state-of-the-art quantum simulators are in…
We are interested in the simulation of open quantum systems governed by the Lindblad master equation in an infinite-dimensional Hilbert space. To simulate the solution of this equation, the standard approach involves two sequential…
Some advantages of the algebraic approach to many body physics, based on resolvent algebras, are illustrated by the simple example of non-interacting bosons which are confined in compact regions with soft boundaries. It is shown that the…
We apply the Tensor-Backflow method to investigate the Fermi-Hubbard model on two-dimensional lattices up to 256 sites, exploring various interaction strengths $U$, electron fillings $n$, next-nearest-neighbor hopping $t'$, and boundary…
We study, formally and experimentally, the trade-off in temporal and spatial overhead when managing contiguous blocks of memory using the explicit, dynamic and real-time heap management system Compact-fit (CF). The key property of CF is…
Compact representations of fermionic Hamiltonians are necessary to perform calculations on quantum computers that lack error-correction. A fermionic system is typically defined within a subspace of fixed particle number and spin while…
Computational imaging systems jointly design computation and hardware to retrieve information which is not traditionally accessible with standard imaging systems. Recently, critical aspects such as experimental design and image priors are…
Specialized function gradient computing hardware could greatly improve the performance of state-of-the-art optimization algorithms, e.g., based on gradient descent or conjugate gradient methods that are at the core of control, machine…
Dense associative memory, a fundamental instance of modern Hopfield networks, can store a large number of memory patterns as equilibrium states of recurrent networks. While the stationary-state storage capacity has been investigated, its…
We introduce the sparse modern Hopfield model as a sparse extension of the modern Hopfield model. Like its dense counterpart, the sparse modern Hopfield model equips a memory-retrieval dynamics whose one-step approximation corresponds to…