Entropy Inequalities Constrain Holographic Erasure Correction

• URL: http://arxiv.org/abs/2502.12246v1
• Date: Mon, 17 Feb 2025 19:00:02 GMT
• Title: Entropy Inequalities Constrain Holographic Erasure Correction
• Authors: Bartlomiej Czech, Sirui Shuai, Yixu Wang,
• Abstract summary: We interpret holographic entropy inequalities in terms of erasure correction.<n>The non-saturation of an inequality is a necessary condition for certain schemes of holographic erasure correction.
• Score: 0.5852077003870417
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We interpret holographic entropy inequalities in terms of erasure correction. The non-saturation of an inequality is a necessary condition for certain schemes of holographic erasure correction, manifested in the bulk as non-empty overlaps of corresponding entanglement wedges.

Related papers

• Revisiting Convergence: Shuffling Complexity Beyond Lipschitz Smoothness [50.78508362183774]
  Shuffling-type gradient methods are favored in practice for their simplicity and rapid empirical performance.<n>Most require the Lipschitz condition, which is often not met in common machine learning schemes.
  arXiv  Detail & Related papers  (2025-07-11T15:36:48Z)
• On the completeness of contraction map proof method for holographic entropy inequalities [0.10923877073891444]
  The contraction map proof method is the commonly used method to prove holographic entropy inequalities.<n>In this note, we answer the question in affirmative for all linear holographic entropy inequalities with rational coefficients.<n>We show that, generically, the pre-image of a non-contraction map is not a hypercube, but a proper cubical subgraph.
  arXiv  Detail & Related papers  (2025-06-22T16:21:54Z)
• Gradient Equilibrium in Online Learning: Theory and Applications [56.02856551198923]
  gradient equilibrium is achieved by standard online learning methods.<n> gradient equilibrium translates into an interpretable and meaningful property in online prediction problems.<n>We show that gradient equilibrium framework can be used to develop a debiasing scheme for black-box predictions.
  arXiv  Detail & Related papers  (2025-01-14T18:59:09Z)
• Towards a complete classification of holographic entropy inequalities [0.10923877073891444]
  We use a triality between holographic entropy inequalities, contraction maps and partial cubes.<n>The validity of a holographic entropy inequality is implied by the existence of a contraction map.<n>We also demonstrate interesting by-products, most notably, a procedure to generate candidate quantum entropy inequalities.
  arXiv  Detail & Related papers  (2024-09-25T19:55:31Z)
• Critical spin models from holographic disorder [49.1574468325115]
  We study the behavior of XXZ spin chains with a quasiperiodic disorder not present in continuum holography. Our results suggest the existence of a class of critical phases whose symmetries are derived from models of discrete holography.
  arXiv  Detail & Related papers  (2024-09-25T18:00:02Z)
• Two infinite families of facets of the holographic entropy cone [4.851309113635069]
  We verify that the recently proven infinite families of holographic entropy inequalities are maximally tight, i.e. they are symmetry facets of the holographic entropy cone. On star graphs, both families of inequalities quantify how concentrated / spread information is with respect to a dihedral acting on subsystems. In addition, toric inequalities viewed in the K-basis show an interesting interplay between four-party and six-party perfect tensors.
  arXiv  Detail & Related papers  (2024-01-23T19:00:01Z)
• Holographic Entropy Inequalities and the Topology of Entanglement Wedge Nesting [0.5852077003870417]
  We prove two new infinite families of holographic entropy inequalities. A key tool is a graphical arrangement of terms of inequalities, which is based on entanglement wedge nesting (EWN)
  arXiv  Detail & Related papers  (2023-09-26T18:00:01Z)
• Overcoming Distribution Mismatch in Quantizing Image Super-Resolution Networks [53.23803932357899]
  quantization leads to accuracy loss in image super-resolution (SR) networks. Existing works address this distribution mismatch problem by dynamically adapting quantization ranges during test time. We propose a new quantization-aware training scheme that effectively Overcomes the Distribution Mismatch problem in SR networks.
  arXiv  Detail & Related papers  (2023-07-25T08:50:01Z)
• Quadratic pseudospectrum for identifying localized states [68.8204255655161]
  quadratic pseudospectrum is a method for approaching systems with incompatible observables. We derive an important estimate relating the Clifford and quadratic pseudospectra. We prove that the quadratic pseudospectrum is local, and derive bounds on the errors that are incurred by truncating the system in the vicinity of where the pseudospectrum is being calculated.
  arXiv  Detail & Related papers  (2022-04-22T00:57:09Z)
• Spectral clustering under degree heterogeneity: a case for the random walk Laplacian [83.79286663107845]
  This paper shows that graph spectral embedding using the random walk Laplacian produces vector representations which are completely corrected for node degree. In the special case of a degree-corrected block model, the embedding concentrates about K distinct points, representing communities.
  arXiv  Detail & Related papers  (2021-05-03T16:36:27Z)
• Inequalities for complementarity in observed statistics [0.0]
  We show that, if the measured statistics does notfulfill the inequalities it is equivalent to the lack of a joint distribution for theincompatible observables. This is illustrated by path-interference duality ina Young interferometer.
  arXiv  Detail & Related papers  (2021-03-04T15:26:01Z)
• Distribution-Balanced Loss for Multi-Label Classification in Long-Tailed Datasets [98.74153364118898]
  We present a new loss function called Distribution-Balanced Loss for the multi-label recognition problems that exhibit long-tailed class distributions. The Distribution-Balanced Loss tackles these issues through two key modifications to the standard binary cross-entropy loss. Experiments on both Pascal VOC and COCO show that the models trained with this new loss function achieve significant performance gains.
  arXiv  Detail & Related papers  (2020-07-19T11:50:10Z)
• Superbalance of Holographic Entropy Inequalities [0.0]
  We prove that all non-redundant holographic entropy inequalities are superbalanced. This is tantamount to proving that besides subadditivity, all non-redundant holographic entropy inequalities are superbalanced.
  arXiv  Detail & Related papers  (2020-02-11T17:24:44Z)

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.