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,695 papers · 148 categories

Trend · papers per month

183366549732 · Jun 202019922001200920172026
48 results for Projected entangled pair states

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 ↗

How useful can machine learning be in a quantum laboratory? Here we raise the question of the potential of intelligent machines in the context of scientific research. A major motivation for the present work is the unknown reachability of various entanglement classes in quantum experiments. We investigate this question …

2017-06-02abs ↗pdf ↗

The paper studies 4-qubit Clifford states and their properties.

problem Understanding the set and properties of 4-qubit Clifford states.
method Analyzing the 293760 4-qubit Clifford states, splitting them into 18 groups, and studying the action of CNOT gates and local gates.
result There are 293760 4-qubit Clifford states with specific entanglement entropies, and any pair can be connected with local gates and at most 3 CNOT gates.

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.

EAGC boosts GCD by regulating gradient entanglement, improving known and novel category separability.

problem Gradient entanglement distorts supervised gradients and overlaps known and novel class representations.
method EAGC uses AGA and EEP to align and project gradients, reducing entanglement and overlap.
result EAGC consistently boosts GCD performance, setting new state-of-the-art results.

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.

Entangled watermarks improve model defense against extraction attacks.

problem Model extraction attacks risk leaking valuable intellectual property.
method Entangled Watermarking Embeddings (EWE) leverages model capacity to overfit to outlier input-output pairs.
result The approach successfully claims model ownership with high confidence and minimal performance loss.

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.

Improved clustering accuracy with disentangled latent code representation.

problem Improving k-Means clustering performance.
method Optimizing the entanglement of autoencoder latent code representation using soft nearest neighbor loss with annealing temperature.
result 96.2% test clustering accuracy on MNIST, 85.6% on Fashion-MNIST, and 79.2% on EMNIST Balanced datasets.

Tensor completion estimates missing components by exploiting the low-rank structure of multi-way data. The recently proposed methods based on tensor train (TT) and tensor ring (TR) show better performance in image recovery than classical ones. Compared with TT and TR, the projected entangled pair state (PEPS), which is…

2019-03-12abs ↗pdf ↗

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 ↗

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.

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).

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.

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 ↗

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.

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 ↗

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 ↗

By generalizing the measurements on the game experiments of mixed strategy Nash equilibrium, we study the dynamical pattern in a representative dynamic stochastic general equilibrium (DSGE). The DSGE model describes the entanglements of the three variables (output gap [yy], inflation [ππ] and nominal interest rate [$…

2014-10-30abs ↗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 ↗

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.

A path integral on a link complement of a three-sphere fixes a vector (the "link state") in Chern-Simons theory. The link state can be written in a certain basis with the colored link invariants as its coefficients. We use symmetric webs to systematically compute the colored link invariants, by which we can write down …

2017-07-12abs ↗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 ↗

We explore and expand the Soft Nearest Neighbor Loss\textit{Soft Nearest Neighbor Loss} to measure the entanglement\textit{entanglement} of class manifolds in representation space: i.e., how close pairs of points from the same class are relative to pairs of points from different classes. We demonstrate several use cases of the loss. As an analytical to…

2019-02-05abs ↗pdf ↗

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.

Quantum computing speeds up asset pricing models exponentially.

problem Solving dynamic nonlinear asset pricing models efficiently.
method Utilizes quantum superposition and entanglement to solve models exponentially faster than classical methods.
result Exponential computational speed-up for solving asset pricing models.

We present a systematic calculation of the volumes of compact manifolds which appear in physics: spheres, projective spaces, group manifolds and generalized flag manifolds. In each case we state what we believe is the most natural scale or normalization of the manifold, that is, the generalization of the unit radius co…

2002-10-16abs ↗pdf ↗

Study identifies stable configurations of intertwined threads with repulsive interactions.

problem Stable configurations of entangled systems with repulsive interactions.
method Analysis of steepest descent flow of an energy functional.
result Existence and uniqueness of stable configuration of two layers drifting apart at t1/3t^{1/3} rate.

Combining insights from machine learning and quantum Monte Carlo, the stochastic reconfiguration method with neural network Ansatz states is a promising new direction for high-precision ground state estimation of quantum many-body problems. Even though this method works well in practice, little is known about the learn…

2019-10-24abs ↗pdf ↗

We demonstrate how machine learning is able to model experiments in quantum physics. Quantum entanglement is a cornerstone for upcoming quantum technologies such as quantum computation and quantum cryptography. Of particular interest are complex quantum states with more than two particles and a large number of entangle…

2019-10-30abs ↗pdf ↗

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 ↗