Reflected entropy in random tensor networks III: triway cuts

• URL: http://arxiv.org/abs/2409.17218v2
• Date: Tue, 12 Nov 2024 11:56:42 GMT
• Title: Reflected entropy in random tensor networks III: triway cuts
• Abstract summary: We prove that the integer R'enyi reflected entropies are determined by minimal triway cuts through the network. A natural extrapolation away from integer R'enyi parameters, suggested by the triway cut problem, implies the holographic conjecture $S_R=2EW$. This sheds light on the gap between the existence of tripartite entanglement in holographic states and the bipartite entanglement structure motivated by bit-threads.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: For general random tensor network states at large bond dimension, we prove that the integer R\'enyi reflected entropies (away from phase transitions) are determined by minimal triway cuts through the network. This generalizes the minimal cut description of bipartite entanglement for these states. A natural extrapolation away from integer R\'enyi parameters, suggested by the triway cut problem, implies the holographic conjecture $S_R=2EW$, where $S_R$ is the reflected entropy and $EW$ is the entanglement wedge cross-section. Minimal triway cuts can be formulated as integer programs which cannot be relaxed to find a dual maximal flow/bit-thread description. This sheds light on the gap between the existence of tripartite entanglement in holographic states and the bipartite entanglement structure motivated by bit-threads. In particular, we prove that the Markov gap that measures tripartite entanglement is lower bounded by the integrality gap of the integer program that computes the triway cut.

Related papers

• Restricted Eigenvalues Beyond Gaussian Width: Threshold Occupancy under Heavy Tails [47.36630149538994]
  For isotropic sub-Gaussian measurements, the benchmark sample size is $1+w(A)2$, where $w(A)$ is the Gaussian width of the normalized descent cone.<n>We give an explicit and systematic negative answer to the general question as formulated there: the proposed law fails in its full dimension-free, arbitrary-set form.<n>Under isotropy, a distribution-free fallback governed by affine dimension times squared enclosing radius is sharp on this family.
  arXiv  Detail & Related papers  (2026-09-03T08:05:05Z)
• High-Dimensional Nonparametric Change-Point Detection via Low-Rank Degree-Three Density Projection [2.1991623402625606]
  Distributional changes can be invisible to means and covariances yet appear in skewness, asymmetric interactions, or other third-order structure.<n>We develop a nonparametric change-point method that retains every degree-at-most-three coefficient of a density while avoiding direct density estimation.
  arXiv  Detail & Related papers  (2026-08-16T01:21:55Z)
• Non-asymptotic Tail Bounds for the Kostlan--Shub--Smale Field: Tensor PCA and Spherical $k$-Spin Complexity [0.6627152091494143]
  This paper builds a hierarchy of explicit, non-asymptotic tail bounds for the supremum of the Kostlan--Shub--Smale random field on the sphere.<n>It applies it to two problems: Spiked PCA and the landscape of the spherical $k$-spin model.
  arXiv  Detail & Related papers  (2026-06-16T08:27:25Z)
• Multi-entropy in random tensor networks [2.7233225545211375]
  We study the evaluation of Rényi multi-entropies $S(q)_n$ in Random Network (RTN) states in the large bond-dimension limit.<n>For the case of Rényi index $n=2$ and arbitrary number of parties $q$, we prove that multi-entropies are determined by minimal multiway cuts through the network.
  arXiv  Detail & Related papers  (2026-06-03T05:30:41Z)
• Regularized Online RLHF with Generalized Bilinear Preferences [68.44113000390544]
  We consider the problem of contextual online RLHF with general preferences.<n>We adopt the Generalized Bilinear Preference Model to capture preferences via low-rank, skew-symmetric matrices.<n>We prove that the dual gap of the greedy policy is bounded by the square of the estimation error.
  arXiv  Detail & Related papers  (2026-02-26T15:27:53Z)
• Restriction-Based Certificate of Bipartite Schmidt Rank in Hypergraph States [0.0]
  Bipartite entanglement in qubit hypergraph states is investigated.<n>Schmidt rank across the cut can be computed as the real rank of a phase-cleaned cross-cut sign matrix.<n>We show that submatrices residual-free bilinear cores yield an exponential Schmidt-rank lower bound in terms of the $mathbbF$-rank of an exposed core matrix.
  arXiv  Detail & Related papers  (2026-02-24T15:34:39Z)
• Tensor Decomposition Networks for Fast Machine Learning Interatomic Potential Computations [63.945006006152035]
  tensor decomposition networks (TDNs) achieve competitive performance with dramatic speedup in computations.<n>We evaluate TDNs on PubChemQCR, a newly curated molecular relaxation dataset containing 105 million DFT-calculated snapshots.
  arXiv  Detail & Related papers  (2025-07-01T18:46:27Z)
• Flat Channels to Infinity in Neural Loss Landscapes [44.23346534792001]
  Loss landscapes of neural networks contain minima and saddle points that may be connected in flat regions or appear in isolation.<n>We identify and characterize a special structure in the loss landscape: channels along which the loss decreases extremely slowly.<n>The emergence of gated linear units at the end of the channels highlights a surprising aspect of the computational capabilities of fully connected layers.
  arXiv  Detail & Related papers  (2025-06-17T20:04:15Z)
• Depth-Bounds for Neural Networks via the Braid Arrangement [5.127394801557798]
  We prove a non-constant lower bound of $Omega(loglog d)$ hidden layers required to represent the maximum of $d$ numbers. We show that a rank-3 maxout layer followed by a rank-2 maxout layer is sufficient to represent the maximum of 7 numbers.
  arXiv  Detail & Related papers  (2025-02-13T13:37:52Z)
• Pseudorandom and Pseudoentangled States from Subset States [49.74460522523316]
  A subset state with respect to $S$, a subset of the computational basis, is [ frac1sqrt|S|sum_iin S |irangle. We show that for any fixed subset size $|S|=s$ such that $s = 2n/omega(mathrmpoly(n))$ and $s=omega(mathrmpoly(n))$, a random subset state is information-theoretically indistinguishable from a Haar random state even provided
  arXiv  Detail & Related papers  (2023-12-23T15:52:46Z)
• Rigorous derivation of the Efimov effect in a simple model [68.8204255655161]
  We consider a system of three identical bosons in $mathbbR3$ with two-body zero-range interactions and a three-body hard-core repulsion of a given radius $a>0$.
  arXiv  Detail & Related papers  (2023-06-21T10:11:28Z)
• Reduced Contraction Costs of Corner-Transfer Methods for PEPS [0.0]
  We propose a pair of approximations that allows the leading order computational cost of contracting an infinite projected entangled-pair state to be reduced. The improvement in computational cost enables us to perform large bond dimension calculations, extending its potential to solve challenging problems.
  arXiv  Detail & Related papers  (2023-06-14T02:54:12Z)
• Discreteness of asymptotic tensor ranks [7.916635054977068]
  We show that the subrank and the slice rank have no accumulation points, and that over the complex numbers, the slice rank has no accumulation points. Central to our approach are two new general lower bounds on the subrank of tensors, which measures how much a tensor can be diagonalized. Our rely on new lower bounds on the maximum rank in matrix subspaces that are obtained by slicing a three-tensor in the three different directions.
  arXiv  Detail & Related papers  (2023-06-02T17:42:39Z)
• Borda Regret Minimization for Generalized Linear Dueling Bandits [65.09919504862496]
  We study the Borda regret minimization problem for dueling bandits, which aims to identify the item with the highest Borda score. We propose a rich class of generalized linear dueling bandit models, which cover many existing models. Our algorithm achieves an $tildeO(d2/3 T2/3)$ regret, which is also optimal.
  arXiv  Detail & Related papers  (2023-03-15T17:59:27Z)
• Renormalization group for measurement and entanglement phase transitions [0.0]
  We analyze the renormalization-group (RG) flows of two effective Lagrangians. We show that the theory for the random tensor network formally possesses a dimensional reduction property analogous to that of the random-field Ising model.
  arXiv  Detail & Related papers  (2023-03-14T12:40:03Z)
• Detection-Recovery Gap for Planted Dense Cycles [72.4451045270967]
  We consider a model where a dense cycle with expected bandwidth $n tau$ and edge density $p$ is planted in an ErdHos-R'enyi graph $G(n,q)$. We characterize the computational thresholds for the associated detection and recovery problems for the class of low-degree algorithms.
  arXiv  Detail & Related papers  (2023-02-13T22:51:07Z)
• Causal Bandits for Linear Structural Equation Models [58.2875460517691]
  This paper studies the problem of designing an optimal sequence of interventions in a causal graphical model. It is assumed that the graph's structure is known and has $N$ nodes. Two algorithms are proposed for the frequentist (UCB-based) and Bayesian settings.
  arXiv  Detail & Related papers  (2022-08-26T16:21:31Z)
• On the Effective Number of Linear Regions in Shallow Univariate ReLU Networks: Convergence Guarantees and Implicit Bias [50.84569563188485]
  We show that gradient flow converges in direction when labels are determined by the sign of a target network with $r$ neurons. Our result may already hold for mild over- parameterization, where the width is $tildemathcalO(r)$ and independent of the sample size.
  arXiv  Detail & Related papers  (2022-05-18T16:57:10Z)
• Edge states and universality class of the critical two-box symmetric SU(3) chain [0.0]
  We numerically demonstrate that, although it is critical, the two-box symmetric $mathrmSU(3)$ chain possesses edge states in the adjoint representation. We show that these edge states are very efficiently screened by attaching adjoint representations at the ends of the chain.
  arXiv  Detail & Related papers  (2021-07-20T07:44:49Z)
• Lifting the Convex Conjugate in Lagrangian Relaxations: A Tractable Approach for Continuous Markov Random Fields [53.31927549039624]
  We show that a piecewise discretization preserves better contrast from existing discretization problems. We apply this theory to the problem of matching two images.
  arXiv  Detail & Related papers  (2021-07-13T12:31:06Z)
• Low-Rank Sinkhorn Factorization [45.87981728307819]
  We introduce an explicit factorization of low rank couplings as a product of textitsub-coupling factors linked by a common marginal. We prove the non-asymptotic stationary convergence of this algorithm and illustrate its efficiency on benchmark experiments.
  arXiv  Detail & Related papers  (2021-03-08T13:18:45Z)
• Linear semi-infinite programming approach for entanglement quantification [0.0]
  We show the absence of a duality gap between primal and dual problems, even if the entanglement quantifier is not continuous. We implement a central cutting-plane algorithm for LSIP to quantify entanglement between three qubits.
  arXiv  Detail & Related papers  (2020-07-27T19:12:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.