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.

168,657 papers · 148 categories

Trend · papers per month

2457 · Oct 201919922001200920172026
48 results for Entanglement

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 ↗

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.

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 ↗

A relation between the conformal anomaly and the logarithmic term in the entanglement entropy is known to exist for CFT's in even dimensions. In odd dimensions the local anomaly and the logarithmic term in the entropy are absent. As was observed recently, there exists a non-trivial integrated anomaly if an odd-dimensio…

2016-01-24abs ↗pdf ↗

We analyze the Ricci flow of a noncompact metric that describes a two-dimensional black hole. We consider entanglement entropy of a 2d black hole which is due to the quantum correlations between two subsystems: one is inside and the other is outside the black hole horizon. It is demonstrated that the entanglement entro…

2006-09-06abs ↗pdf ↗

Paper introduces untangling number to quantify 3-periodic tangle complexity.

problem Quantifying the complexity of 3-periodic tangles in biological, chemical, and physical systems.
method Introduces untangling number, a measure of minimum distance to ground state through diagrammatic operations.
result For infinite open curves, generic ground states are crystallographic rod packings.

New methods assess topological entanglement in periodic systems.

problem Assessing topological entanglement in systems with periodic boundary conditions.
method Introducing Periodic Jones polynomial and Cell Jones polynomial.
result Periodic Jones polynomial is a recurring factor of Jones polynomial of finite cutoffs.

We propose a conceptual design for a quantum blockchain. Our method involves encoding the blockchain into a temporal GHZ (Greenberger-Horne-Zeilinger) state of photons that do not simultaneously coexist. It is shown that the entanglement in time, as opposed to an entanglement in space, provides the crucial quantum adva…

2018-04-16abs ↗pdf ↗

New machine learning method detects quantum separability in large-scale systems.

problem Deciding quantum separability of large-scale bipartite density matrices.
method Frank-Wolfe-based algorithm for finding nearest separable density matrices and classification of density matrices as separable or entangled.
result The method scales up to thousands of density matrices and achieves high quantum entanglement detection accuracy.

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 ↗

Study tackles causal effects of close contact on MRSA infections from entangled treatment data.

problem Estimating causal effects of close contact on MRSA infections from observational data with entangled treatments.
method NEAT method that models treatment assignment mechanism and mitigates confounding biases.
result NEAT method effectively estimates causal effects from entangled treatment data.

We present the quantum model of Bertrand duopoly and study the entanglement behavior on the profit functions of the firms. Using the concept of optimal response of each firm to the price of the opponent, we found only one Nash equilibirum point for maximally entangled initial state. The very presence of quantum entangl…

2010-01-16abs ↗pdf ↗

New metric for disentangling multivariate representations, accounting for more complex entanglements.

problem Current disentanglement metrics fail to detect entanglements involving more than two variables.
method Partial Information Decomposition framework to analyze information sharing and propose a new disentanglement metric.
result The proposed metric correctly identifies entanglements in high-dimensional spaces.

For a very ample line bundle L on a compact connected complex manifold X, with a real structure, we discuss entanglement properties of certain sequences of vectors in tensor products of spaces of holomorphic sections of powers of L.

2018-06-26abs ↗pdf ↗

Fibonacci anyons are attractive for use in topological quantum computation because any unitary transformation of their state space can be approximated arbitrarily accurately by braiding. However there is no known braid that entangles two qubits without leaving the space spanned by the two qubits. In other words, there …

2018-02-03abs ↗pdf ↗

The abstract explores a new wave equation linking quantum mechanics and complex adaptive systems.

problem Understanding the underlying mechanism of distribution formation in complex quantum entanglement.
method Exploring the logical relationship between Schrödinger's wave equation and Shi's trading volume-price wave equation in finance.
result A non-localized wave equation in quantum mechanics reveals the invariance of interaction as a universal law.

Tensor networks improve image classification but require more expressive states.

problem Understanding why tensor networks work in image classification.
method Investigated entanglement properties of tensor network models for supervised image classification.
result Tensor networks can learn states that are robustly entangled, suggesting long-range entanglement is not essential.

For a given quantum field theory, provided the area of the entangling surface is fixed, what surface maximizes entanglement entropy? We analyze the answer to this question in four and higher dimensions. Surprisingly, in four dimensions the answer is related to a mathematical problem of finding surfaces which minimize t…

2014-07-17abs ↗pdf ↗

We address several problems concerning the geometry of the space of Hermitian operators on a finite-dimensional Hilbert space, in particular the geometry of the space of density states and canonical group actions on it. For quantum composite systems we discuss and give examples of measures of entanglement.

2006-03-20abs ↗pdf ↗

Entangled bisimulation improves policy learning from visual input.

problem Learning generalizeable policies from visual input in the presence of visual distractions.
method Proposes entangled bisimulation, a bisimulation metric for continuous state and action spaces.
result Entangled bisimulation improves policy learning on the Distracting Control Suite (DCS).

Bit threads provide an alternative description of holographic entanglement, replacing the Ryu-Takayanagi minimal surface with bulk curves connecting pairs of boundary points. We use bit threads to prove the monogamy of mutual information (MMI) property of holographic entanglement entropies. This is accomplished using t…

2018-08-15abs ↗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 ↗

We review supervised learning and deep neural network design for learning membership on algebraic varieties. We demonstrate that these trained artificial neural networks can predict the entanglement type for quantum states. We give examples for detecting degenerate states, as well as border rank classification for up t…

2019-08-27abs ↗pdf ↗

The paper estimates common mean of entangled Gaussians with bounded variances.

problem Estimating common mean of entangled Gaussians with bounded variances.
method Iteratively averaging truncated samples.
result Achieves error $O \left(\frac{\sqrt{n\ln n}}{m} ight)$ with high probability when m=Ω(nlnn)m=Ω(\sqrt{n\ln n}).

A new approach uses circuit topology to study complex polymer interactions.

problem Understanding structural phase transitions in entangled polymer systems.
method Braided circuit topology framework for multiple-chain systems.
result Circuit topological motif fractions are effective order parameters for structural transitions.

A method for estimating parameters from entangled single-sample distributions, robust to high-noise data.

problem Estimating common parameters from entangled single-sample distributions.
method Iterative trimming of samples to estimate the parameter.
result The method can tolerate a constant fraction of high-noise data points.

Geometrically constructs twist-field correlation functions in CFT.

problem Understanding entanglement entropy in quantum systems.
method Using Cauchy-Hadamard renormalization of Polyakov anomaly integral on surfaces with conical singularities.
result Provides a purely mathematical interpretation of entanglement entropy results.

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.

Study on entanglement complexity of confined ring polymers in lattice tubes.

problem Understanding the entanglement complexity of confined ring polymers in lattice tubes.
method Applied knot theory to extend and prove results about the complexity of 2SAPs.
result Proved that all but exponentially few size m 2SAPs have F complexity that grows at least linearly in m as m approaches infinity.