Related papers: Dynamical Cavity Method for Hypergraphs and its Ap…
Consider the following "local" cut-detection problem in a directed graph: We are given a starting vertex $s$ and need to detect whether there is a cut with at most $k$ edges crossing the cut such that the side of the cut containing $s$ has…
Using the cavity method and diagrammatic methods, we model the dynamics of batch learning of restricted sets of examples. Simulations of the Green's function and the cavity activation distributions support the theory well. The learning…
The effective approach to quantum dynamics allows a reformulation of the Dirac quantization procedure for constrained systems in terms of an infinite-dimensional constrained system of classical type. For semiclassical approximations, the…
We show that a quantum computer operating with a small number of qubits can simulate the dynamical localization of classical chaos in a system described by the quantum sawtooth map model. The dynamics of the system is computed efficiently…
Non-equilibrium dynamics induced by rapid changes of external parameters is relevant for a wide range of scenarios across many domains of physics. For waves in spatially periodic systems, quenches will alter the bandstructure and generate…
An emerging way of tackling the dimensionality issues arising in the modeling of a multivariate process is to assume that the inherent data structure can be captured by a graph. Nevertheless, though state-of-the-art graph-based methods have…
Achieving precise preparation of quantum many-body states is crucial for the practical implementation of quantum computation and quantum simulation. However, the inherent challenges posed by unavoidable excitations at critical points during…
The $K$-core of a graph is the unique maximum subgraph within which each vertex connects to $K$ or more other vertices. The optimal $K$-core attack problem asks to delete the minimum number of vertices from the $K$-core to induce its…
In order to illustrate the adaptation of traditional continuum numerical techniques to the study of complex network systems, we use the equation-free framework to analyze a dynamically evolving multigraph. This approach is based on coupling…
Vacancy diffusion and clustering processes in body-centered-cubic (bcc) Fe are studied using the kinetic activation-relaxation technique (k-ART), an off-lattice kinetic Monte Carlo method with on-the-fly catalog building capabilities. For…
We present a quantum averaging theory (QAT) for analytically modeling unitary gate dynamics in driven quantum systems beyond the rotating-wave approximation. QAT addresses the simultaneous presence of distinct timescales by generating a…
The paper is continuation of [6] where we have discussed some classical and quantization problems of rigid bodies of infinitesimal size moving in Riemannian spaces. Strictly speaking, we have considered oscillatory dynamical models on…
Coordination graph is a promising approach to model agent collaboration in multi-agent reinforcement learning. It conducts a graph-based value factorization and induces explicit coordination among agents to complete complicated tasks.…
Data generation is a fundamental research problem in data management due to its diverse use cases, ranging from testing database engines to data-specific applications. However, real-world entities often involve complex interactions that…
Kinetic approaches, i.e., methods based on the lattice Boltzmann equations, have long been recognized as an appealing alternative for solving incompressible Navier-Stokes equations in computational fluid dynamics. However, such approaches…
Non-convex optimization plays a key role in a growing number of machine learning applications. This motivates the identification of specialized structure that enables sharper theoretical analysis. One such identified structure is…
In this paper we detail a classical algorithmic approach to the k-satisfiability (k-SAT) problem that is inspired by the quantum amplitude amplification algorithm. This work falls under the emerging field of quantum-inspired classical…
We investigate the non-equilibrium behavior of a fully-connected (or all-to-all coupled) Bose-Hubbard model after a Mott to superfluid quench, in the limit of large boson densities and for an arbitrary number $V$ of lattice sites, with…
This paper introduces complex dynamics methods to study dynamical quantum phase transitions in the one- and two-dimensional quantum 3-state Potts model. The quench involves switching off an infinite transverse field. The time-dependent…
We describe a general approach for maximum a posteriori (MAP) inference in a class of discrete-continuous factor graphs commonly encountered in robotics applications. While there are openly available tools providing flexible and easy-to-use…