Related papers: Tensor-Network Population Annealing
The method of simulated annealing is adapted to the temperature-emissivity separation (TES) problem. A patch of surface at the bottom of the atmosphere is assumed to be a greybody emitter with spectral emissivity $\epsilon(k)$ describable…
A partially annealed mean-field spin-glass model with a locally embedded pattern is studied. The model consists of two dynamical variables, spins and interactions, that are in contact with thermal baths at temperatures T_S and T_J,…
We propose a tensor-network algorithm for discrete-time stochastic dynamics of a homogeneous system in the thermodynamic limit. We map a $d$-dimensional nonequilibrium Markov process to a $(d+1)$-dimensional infinite tensor network by using…
We perform an in-depth comparison of quantum annealing with several classical optimisation techniques, namely thermal annealing, Nelder-Mead, and gradient descent. We begin with a direct study of the 2D Ising model on a quantum annealer,…
We determine limiting equations for large asymmetric `spin glass' networks. The initial conditions are not assumed to be independent of the disordered connectivity: one of the main motivations for this is that allows one to understand how…
We study the application of emerging photonic and quantum computing architectures to solving the Traveling Salesman Problem (TSP), a well-known NP-hard optimization problem. We investigate several approaches: Simulated Annealing (SA),…
Although quantum annealing is usually considered as a method for locating the ground states of difficult spin-glass and optimization problems, its use in approximate optimization -- finding low- but not zero-energy states in a reasonably…
We propose the entanglement bipartitioning approach to design an optimal network structure of the tree-tensor-network (TTN) for quantum many-body systems. Given an exact ground-state wavefunction, we perform sequential bipartitioning of…
This paper presents a novel and efficient heuristic framework for approximating the solutions to the multiple traveling salesmen problem (m-TSP) and other variants on the TSP. The approach adopted in this paper is an extension of the…
We study the complexity of the Thouless-Anderson-Palmer (TAP) free energy for Ising spin glasses with a general mixed p-spin covariance, working with the generalized TAP functional of Chen, Panchenko, and Subag. We formulate three…
In this work, we consider the problem of finding a set of tours to a traveling salesperson problem (TSP) instance maximizing diversity, while satisfying a given cost constraint. This study aims to investigate the effectiveness of applying…
Tensor networks have demonstrated significant value for machine learning in a myriad of different applications. However, optimizing tensor networks using standard gradient descent has proven to be difficult in practice. Tensor networks…
We introduce a coarse-graining transformation for tensor networks that can be applied to study both the partition function of a classical statistical system and the Euclidean path integral of a quantum many-body system. The scheme is based…
Projected Entangled Pair States (PEPS) are a class of quantum many-body states that generalize Matrix Product States for one-dimensional systems to higher dimensions. In recent years, PEPS have advanced understanding of strongly correlated…
Squeezed states of spin systems are an important entangled resource for quantum technologies, particularly quantum metrology and sensing. Here we consider the generation of spin squeezed states by interacting the spins with a dissipative…
Latent manifolds provide a compact characterization of neural population activity and of shared co-variability across brain areas. Nonetheless, existing statistical tools for extracting neural manifolds face limitations in terms of…
We study an effective spin model derived perturbatively from random transverse-field Ising model on the pyrochlore lattice. The model consists of spin-configurations on the pyrochlore lattice, restricted to the spin-ice subspace, with spins…
Tensor networks have proven to be a valuable tool, for instance, in the classical simulation of (strongly correlated) quantum systems. As the size of the systems increases, contracting larger tensor networks becomes computationally…
Tensor Network (TN) Kernel Machines speed up model learning by representing parameters as low-rank TNs, reducing computation and memory use. However, most TN-based Kernel methods are deterministic and ignore parameter uncertainty. Further,…
Ising machines have the potential to realize fast and highly accurate solvers for combinatorial optimization problems. They are classified based on their internal algorithms. Examples include simulated-annealing-based Ising machines…