ترغب بنشر مسار تعليمي؟ اضغط هنا

On the descriptive power of Neural-Networks as constrained Tensor Networks with exponentially large bond dimension

81   0   0.0 ( 0 )
 نشر من قبل Mario Collura
 تاريخ النشر 2019
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

In many cases, Neural networks can be mapped into tensor networks with an exponentially large bond dimension. Here, we compare different sub-classes of neural network states, with their mapped tensor network counterpart for studying the ground state of short-range Hamiltonians. We show that when mapping a neural network, the resulting tensor network is highly constrained and thus the neural network states do in general not deliver the naive expected drastic improvement against the state-of-the-art tensor network methods. We explicitly show this result in two paradigmatic examples, the 1D ferromagnetic Ising model and the 2D antiferromagnetic Heisenberg model, addressing the lack of a detailed comparison of the expressiveness of these increasingly popular, variational ansatze.



قيم البحث

اقرأ أيضاً

Cluster expansions for the exponential of local operators are constructed using tensor networks. In contrast to other approaches, the cluster expansion does not break any spatial or internal symmetries and exhibits a very favourable prefactor to the error scaling versus bond dimension. This is illustrated by time evolving a matrix product state using very large time steps, and by constructing a novel robust algorithm for finding ground states of 2-dimensional Hamiltonians using projected entangled pair states as fixed points of 2-dimensional transfer matrices.
We characterize the variational power of quantum circuit tensor networks in the representation of physical many-body ground-states. Such tensor networks are formed by replacing the dense block unitaries and isometries in standard tensor networks by l ocal quantum circuits. We explore both quantum circuit matrix product states and the quantum circuit multi-scale entanglement renormalization ansatz, and introduce an adaptive method to optimize the resulting circuits to high fidelity with more than $10^4$ parameters. We benchmark their expressiveness against standard tensor networks, as well as other common circuit architectures, for both the energy and correlation functions of the 1D Heisenberg and Fermi-Hubbard models in the gapless regime. We find quantum circuit tensor networks to be substantially more expressive than other quantum circuits for these problems, and that they can even be more compact than standard tensor networks. Extrapolating to circuit depths which can no longer be emulated classically, this suggests a region of quantum advantage with respect to expressiveness in the representation of physical ground-states.
84 - Yichen Huang 2019
Suppose we would like to approximate all local properties of a quantum many-body state to accuracy $delta$. In one dimension, we prove that an area law for the Renyi entanglement entropy $R_alpha$ with index $alpha<1$ implies a matrix product state r epresentation with bond dimension $mathrm{poly}(1/delta)$. For (at most constant-fold degenerate) ground states of one-dimensional gapped Hamiltonians, it suffices that the bond dimension is almost linear in $1/delta$. In two dimensions, an area law for $R_alpha(alpha<1)$ implies a projected entangled pair state representation with bond dimension $e^{O(1/delta)}$. In the presence of logarithmic corrections to the area law, similar results are obtained in both one and two dimensions.
Power grids, road maps, and river streams are examples of infrastructural networks which are highly vulnerable to external perturbations. An abrupt local change of load (voltage, traffic density, or water level) might propagate in a cascading way and affect a significant fraction of the network. Almost discontinuous perturbations can be modeled by shock waves which can eventually interfere constructively and endanger the normal functionality of the infrastructure. We study their dynamics by solving the Burgers equation under random perturbations on several real and artificial directed graphs. Even for graphs with a narrow distribution of node properties (e.g., degree or betweenness), a steady state is reached exhibiting a heterogeneous load distribution, having a difference of one order of magnitude between the highest and average loads. Unexpectedly we find for the European power grid and for finite Watts-Strogatz networks a broad pronounced bimodal distribution for the loads. To identify the most vulnerable nodes, we introduce the concept of node-basin size, a purely topological property which we show to be strongly correlated to the average load of a node.
229 - M. G. A. van Dorp , F. Berger , 2011
We consider a chemical reaction network governed by mass action kinetics and composed of N different species which can reversibly form heterodimers. A fast iterative algorithm is introduced to compute the equilibrium concentrations of such networks. We show that the convergence is guaranteed by the Banach fixed point theorem. As a practical example, of relevance for a quantitative analysis of microarray data, we consider a reaction network formed by N~10^6 mutually hybridizing different mRNA sequences. We show that, despite the large number of species involved, the convergence to equilibrium is very rapid for most species. The origin of slow convergence for some specific subnetworks is discussed. This provides some insights for improving the performance of the algorithm.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا