Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,181 papers · 148 categories

Trend · papers per month

2468 · Jun 201819922001200920182026
48 results for holographic entanglement

Bit threads prove holographic monogamy of mutual information.

problem Proving the monogamy of mutual information in holographic entanglement.
method Using bit threads and multicommodity flow adapted from network theory, combined with convex optimization tools.
result Proved the monogamy of mutual information property of holographic entanglement entropies.

Researchers derive a new Jacobi equation to calculate Holographic Entanglement Entropy changes.

problem Calculating changes in Holographic Entanglement Entropy for small perturbations.
method Deriving an inhomogeneous Jacobi equation for minimal surfaces and applying it to perturbative changes in HEE.
result Perturbative calculation of Holographic Entanglement Entropy changes up to second order.

The Ryu-Takayanagi (RT) formula relates the entanglement entropy of a region in a holographic theory to the area of a corresponding bulk minimal surface. Using the max flow-min cut principle, a theorem from network theory, we rewrite the RT formula in a way that does not make reference to the minimal surface. Instead, …

2016-04-01abs ↗pdf ↗

New formula connects holographic entanglement entropy to Willmore energy in 5D.

problem Analogous to 3D, find a new formula for 5D entanglement entropy.
method Prove equivalence between holographic entanglement entropy and Willmore energy in 5D.
result The Willmore energy in 5D is not globally minimized by a round ball.

We use the conformal invariance and the holographic correspondence to fully specify the dependence of entanglement entropy on the extrinsic geometry of the 2d surface ΣΣ that separates two subsystems of quantum strongly coupled N=4{\mathcal{N}}=4 SU(N) superconformal gauge theory. We extend this result and calculate en…

2008-02-21abs ↗pdf ↗

New framework constructs holographic tensor networks using hyperbolic buildings.

problem Building holographic tensor networks for non-integer dimensions and fractal spaces.
method Introducing a unifying framework based on hyperbolic buildings and dualities.
result Constructs a family of bulk regions satisfying complementary recovery and Ryu-Takayanagi formula.

A recent proposal by Ryu and Takayanagi for a holographic interpretation of entanglement entropy in conformal field theories dual to supergravity on anti-de Sitter (adS) is generalized to include entanglement entropy of black holes living on the boundary of adS. The generalized proposal is verified in boundary dimensio…

2006-06-21abs ↗pdf ↗

A regularization procedure developed in [1] for the integral curvature invariants on manifolds with conical singularities is generalized to the case of squashed cones. In general, the squashed conical singularities do not have rotational O(2) symmetry in a subspace orthogonal to a singular surface ΣΣ so that the surfa…

2013-06-17abs ↗pdf ↗

Study on bit threads and their locking properties in holographic spacetimes.

problem Understanding the conditions under which regions can be locked in holographic spacetimes.
method Investigation of different density bounds and their implications on the locking of regions.
result Non-crossing regions can be locked under the most stringent bound, but crossing regions cannot.

Unified geometric flows improve deep learning efficiency and simplify neural network topologies.

problem Improving deep learning performance and simplifying neural network structures.
method Proposes a thermodynamically coupled Ricci flow that dynamically adapts parameter space geometry to loss landscape topology, enabling automated singularity resolution and providing entanglement entropy bounds.
result Demonstrates 2.1× convergence acceleration and 63% topological simplification while maintaining O(NlogN)\mathcal{O}(N\log N) complexity, outperforming Riemannian baselines by 15.2% in few-shot accuracy.

Study finds almost contact structures in thermal QCD-like theories at intermediate coupling.

problem Understanding (Almost) Contact Structures in thermal QCD-like theories.
method Explicitly obtained (Almost) Contact Structures and SU(3) structures.
result Subspaces of C3S and AC3S are not mutually 'N-path connected' in the Infra-Red.

Study improves pollen detection in optical and holographic images using deep learning.

problem Improving pollen detection accuracy in holographic microscopy images.
method Used YOLOv8s for detection and MobileNetV3L for classification, addressing performance gaps through dataset expansion and automated labeling.
result Significant improvement in detection and classification performance on holographic images.

This paper derives an explicit formula for Branson's Q-curvature in even-dimensional conformal geometry. The ingredients in the formula come from the Poincare metric in one higher dimension; hence the formula is called holographic. When specialized to the conformally flat case, the holographic formula expresses Q-curva…

2007-04-13abs ↗pdf ↗

In the presence of boundaries the integrated conformal anomaly is modified by the boundary terms so that the anomaly is non-vanishing in any (even or odd) dimension. The boundary terms are due to extrinsic curvature whose exact structure in d=3d=3 and d=4d=4 has recently been identified. In this note we present a hologra…

2017-02-02abs ↗pdf ↗

Learning embeddings of entities and relations is an efficient and versatile method to perform machine learning on relational data such as knowledge graphs. In this work, we propose holographic embeddings (HolE) to learn compositional vector space representations of entire knowledge graphs. The proposed method is relate…

2015-10-16abs ↗pdf ↗

HGConv uses HRR to efficiently detect malware, outperforming existing methods.

problem Efficiently detecting malware with long sequences.
method Holographic Global Convolutional Networks (HGConv) utilizing Holographic Reduced Representations (HRR).
result Achieved state-of-the-art results on malware benchmarks.

Researchers create holographic super-embeddings for M5 and M2 branes.

problem No concrete examples of super-embeddings for M5 and M2 branes existed.
method Constructed explicit holographic super-embeddings of probe M5 and M2 branes into their super-AdS backgrounds.
result Explicit holographic super-embeddings of M5 and M2 branes were successfully constructed.

Secure neural network inference on untrusted platforms using holographic reduced representations.

problem Secure neural network inference on untrusted platforms.
method Connectionist Symbolic Pseudo Secrets using Holographic Reduced Representations (HRR).
result Empirical robustness to attack under various threat models.

Holographic Invariant Storage uses vector architectures to ensure LLM safety at design time.

problem Mitigating context drift in large language models (LLMs) during deployment.
method Introduces Holographic Invariant Storage (HIS) protocol that combines known properties of bipolar Vector Symbolic Architectures into a design-time safety contract.
result Closed-form guarantees for single-signal recovery fidelity, continuous-noise robustness, and multi-signal capacity degradation are provided and validated.

Kauffman and Lomonaco explored the idea of understanding quantum entanglement (the non-local correlation of certain properties of particles) topologically by viewing unitary entangling operators as braiding operators. In the work of G. Alagic, M. Jarret, and S. Jordan it is shown that entanglement is a necessary condit…

2016-11-24abs ↗pdf ↗

AI enhances pollen recognition in veterinary imaging using holographic microscopy.

problem Challenges in recognizing pollen in holographic images due to speckle noise and artifacts.
method Training YOLOv8s and MobileNetV3L on dual-modality dataset, employing WGAN-SN for synthetic data augmentation.
result GAN-based augmentation improves object detection and classification in holographic images, closing the performance gap.

The paper uncovers the mathematical structure enabling value decomposition in multi-agent systems.

problem Theoretical justification for why value decomposition works effectively in multi-agent systems remains underexplored.
method The paper introduces the concept of Markov entanglement to measure the underlying structure and demonstrates how it can be used to bound the decomposition error.
result The widely-used class of index policies is weakly entangled and enjoys a sublinear O(N)\mathcal O(\sqrt{N}) scale of decomposition error for NN-agent systems.

Paper defines untangling number to measure entanglement complexity in 3-periodic networks.

problem Measuring the complexity of entanglement in 3-periodic networks.
method Defining ground states through knot-theoretic crossing diagrams and measuring untangling number.
result Introduced untangling number as a measure of entanglement complexity.

Any solution to the Yang-Baxter equation yields a family of representations of braid groups. Under certain conditions, identified by Turaev, the appropriately normalized trace of these representations yields a link invariant. Any Yang-Baxter solution can be interpreted as a two-qudit quantum gate. Here we show that if …

2015-07-21abs ↗pdf ↗

This work introduces 'Artificial Entanglement' to understand LLMs' fine-tuning effectiveness.

problem Understanding the effectiveness of parameter-efficient fine-tuning methods for large language models.
method Adopting a quantum-information-inspired perspective, the study measures 'Artificial Entanglement' in neural networks.
result LoRA and FFT induce distinct internal entanglement signatures but not external ones, suggesting a 'no-hair' property.