相关论文: Tensor network non-zero testing

Tensor network decompositions offer an efficient description of certain many-body states of a lattice system and are the basis of a wealth of numerical simulation algorithms. In a recent paper [arXiv:0907.2994v1] we discussed how to…

We present a novel neural network algorithm, the Tensor Switching (TS) network, which generalizes the Rectified Linear Unit (ReLU) nonlinearity to tensor-valued hidden units. The TS network copies its entire input vector to different…

We apply tensor networks to counting statistics for the stochastic particle transport in an out-of-equilibrium diffusive system. This system is composed of a one-dimensional channel in contact with two particle reservoirs at the ends. Two…

We study the decomposability and the subdifferential of the tensor nuclear norm. Both concepts are well understood and widely applied in matrices but remain unclear for higher-order tensors. We show that the tensor nuclear norm admits a…

Diffusion-driven instability is a fundamental mechanism underlying pattern formation in spatially extended systems. In almost all existing works, diffusion across the links of the underlying network is modeled through scalar weights,…

A generalized covariant method of analysis applicable to frames for which time is not orthogonal to space, such as spacetime around a star possessing angular momentum or on a rotating disk, is presented. Important aspects of such an…

We study the two-dimensional square lattice Ising ferromagnet and antiferromagnet with a magnetic field by using tensor network method. Focusing on the role of guage fixing, we present the partition function in terms of a tensor network.…

Symmetry-protected topological (SPT) phases exhibit nontrivial order if symmetry is respected but are adiabatically connected to the trivial product phase if symmetry is not respected. However, unlike the symmetry-breaking phase, there is…

Understanding dissipation in 2D quantum many-body systems is a remarkably difficult open challenge. Here we show how numerical simulations for this problem are possible by means of a tensor network algorithm that approximates steady-states…

Tensor Network methods have been established as a powerful technique for simulating low dimensional strongly-correlated systems for over two decades. Employing the formalism of Matrix Product States, we investigate the phase diagram of the…

There has been increasing interest in methodologies that incorporate physics priors into neural network architectures to enhance their modeling capabilities. A family of these methodologies that has gained traction are Hamiltonian neural…

In this paper we generalize the 1-bit matrix completion problem to higher order tensors. We prove that when $r=O(1)$ a bounded rank-$r$, order-$d$ tensor $T$ in $\mathbb{R}^{N} \times \mathbb{R}^{N} \times \cdots \times \mathbb{R}^{N}$ can…

Non-Hermitian quantum systems with explicit time dependence are of ever-increasing importance. There are only a handful of models that have been analytically studied in this context. Here, a PT-symmetric non-Hermitian $N$-level Landau-Zener…

This paper divide some complexity class by using fixpoint and fixpointless area of Decidable Universal Turing Machine (UTM). Decidable Deterministic Turing Machine (DTM) have fixpointless combinator that add no extra resources (like…

Random projection (RP) have recently emerged as popular techniques in the machine learning community for their ability in reducing the dimension of very high-dimensional tensors. Following the work in [30], we consider a tensorized random…

We solve high-dimensional steady-state Fokker-Planck equations on the whole space by applying tensor neural networks. The tensor networks are a linear combination of tensor products of one-dimensional feedforward networks or a linear…

It is worth knowing that a particular tensor class belongs to $P$-tensor which ensures the compactness to solve tensor complementarity problem (TCP). In this study, we propose a new class of tensor, Nekrasov $Z$ tensor, in the context of…

Quantum computers are expected to enable fast solving of large-scale combinatorial optimization problems. However, their limitations in fidelity and the number of qubits prevent them from handling real-world problems. Recently, a…

We study \emph{multiplicity equivalence} testing of automata over partially commutative monoids (pc monoids) and show efficient algorithms in special cases, exploiting the structure of the underlying non-commutation graph of the monoid.…

Tensor network states are expected to be good representations of a large class of interesting quantum many-body wave functions. In higher dimensions, their utility is however severely limited by the difficulty of contracting the tensor…