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

3877115153 · May 202619922001200920172026
48 results for quantum separability

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.

New framework for cyclic quantum causal models with graph separation property.

problem Understanding causal relationships in feedback processes and exotic scenarios.
method Introducing a robust probability rule and a novel graph-separation property, p-separation.
result Established graph-separation properties for all consistent cyclic causal models.

Quantum correlations enhance generative models, providing a new resource for machine learning.

problem Capturing complex probability distributions in unsupervised learning.
method Theoretical and numerical analysis of quantum correlations in generative models.
result Quantum nonlocality and contextuality provide an expressivity advantage over classical models.

Geodesic flows on Kähler manifolds are quantum integrable when metrics are c-projectively equivalent.

problem Quantum integrability of geodesic flows on Kähler manifolds under c-projective equivalence.
method Construction of Poisson-commuting integrals of motion and their quantum counterparts.
result The geodesic flow's integrals of motion commute as quantum operators, leading to separation of variables in Schrödinger's equation.

Quantum speedup for Monte Carlo integration reduces integrand calls.

problem Reducing the number of calls to the integrand subroutine in high-dimensional Monte Carlo integration.
method Combining nested quantum amplitude estimation with pseudorandom numbers for separable integrands.
result Significant reduction in the number of integrand calls for high-dimensional integration.

New method uses single quantum state for machine learning tasks, improving accuracy.

problem Challenges in unsupervised learning with quantum data.
method SIngle-Preparation Quantum Information Processing (SIPQIP) concept.
result Significantly more accurate estimation compared to traditional methods.

Develops a new framework for causal models on cyclic graphs, solving unique solvability issues.

problem Challenges in specifying unique probability distributions for cyclic functional causal models.
method Introduces a new probability rule and graph-separation property (p-separation) for cyclic fCMs.
result Proves p-separation is sound and complete for all consistent cyclic fCMs, recovering d-separation for DAGs.

We demonstrate how quantum computation can provide non-trivial improvements in the computational and statistical complexity of the perceptron model. We develop two quantum algorithms for perceptron learning. The first algorithm exploits quantum information processing to determine a separating hyperplane using a number …

2016-02-15abs ↗pdf ↗

Counting the number of clusters, when these clusters overlap significantly is a challenging problem in machine learning. We argue that a purely mathematical quantum theory, formulated using the path integral technique, when applied to non-physics modeling leads to non-physics quantum theories that are statistical in na…

2020-01-03abs ↗pdf ↗

This paper introduces quantum invariants for 3-alterfolds and proves their consistency with topological moves.

problem Quantum invariants for 3-alterfolds and their consistency with topological moves.
method Introduction of 3-alterfolds with embedded separating surfaces and spherical fusion categories.
result Quantum invariants of 3-alterfolds are consistent with topological moves and generalize invariants of 3-manifolds containing framed links.

This work restricts hidden cardinality in causal models to infer causal relations.

problem Causal relations between variables with a common unobserved cause cannot be directly inferred.
method Derive inequality constraints from d-separation in causal models with known cardinalities of unobserved variables.
result Inference of causal relations is possible with additional assumptions about cardinalities.

The statistical complexity of quantum circuits is studied using Rademacher complexity.

problem Measuring the richness of quantum hypothesis spaces.
method Applying Rademacher complexity to quantum circuits, investigating dependencies on resources, depth, width, and input/output registers.
result Bounds on the capacity of quantum neural networks constrained by circuit depth, width, and resource measures.

The second author previously discussed how classical complexity separation conjectures, we call them "axioms", have implications in three manifold topology: polynomial length stings of operations which preserve certain Jones polynomial evaluations cannot produce exponential simplifications of link diagrams. In this pap…

2013-05-26abs ↗pdf ↗

Eigen component analysis combines quantum mechanics with machine learning for efficient data analysis.

problem Efficiently extracting linearly separable components from complex data.
method Eigen component analysis (ECA) incorporates quantum mechanics principles into linear learning models.
result ECA outperforms classical linear models and can be integrated with deep neural networks.

The influence of additional information on the decision making of agents, who are interacting members of a society, is analyzed within the mathematical framework based on the use of quantum probabilities. The introduction of social interactions, which influence the decisions of individual agents, leads to a generalizat…

2012-02-21abs ↗pdf ↗

Quantum computing improves copula-based risk aggregation models.

problem Improving quantum models for copula-based risk aggregation.
method Applied Quantum Circuit Born Machine (QCBM) to trapped ion quantum computers, introduced annealing-inspired strategy.
result Quantum models yield comparable or better predictions in risk aggregation tasks.

Develops trace class operators and inverse Laplacian theory for infinite dimensions.

problem Understanding trace class operators and inverse Laplacian on infinite dimensional spaces.
method Presentation of trace class operators and construction of inverse Laplacian on closed manifolds.
result Original trace computations involving the inverse Laplacian on the torus.

In this paper, we present the idea that the formalism of string theory is connected with the dimension 4 in a new way, not covered by phenomenological or model-building approaches. The main connection is given by structures induced by small exotic smooth R^4's having intrinsic meaning for physics in dimension 4. We ext…

2011-02-16abs ↗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.

Unified approach for quantum and classical learning from evaluation oracles.

problem Learning from evaluation oracles in quantum and classical settings.
method Inspired by Kearns' SQ and Valiant's weak evaluation oracle, a unified framework is established.
result Characterizes query complexity for learning linear function classes and extends learnability results for quantum circuits.

We construct a covariant functor from a category of Abelian principal bundles over globally hyperbolic spacetimes to a category of *-algebras that describes quantized principal connections. We work within an appropriate differential geometric setting by using the bundle of connections and we study the full gauge group,…

2013-03-11abs ↗pdf ↗

Clustering, or grouping, dataset elements based on similarity can be used not only to classify a dataset into a few categories, but also to approximate it by a relatively large number of representative elements. In the latter scenario, referred to as extreme clustering, datasets are enormous and the number of represent…

2019-03-19abs ↗pdf ↗

We introduce multiscale invariant dictionaries to estimate quantum chemical energies of organic molecules, from training databases. Molecular energies are invariant to isometric atomic displacements, and are Lipschitz continuous to molecular deformations. Similarly to density functional theory (DFT), the molecule is re…

2016-05-16abs ↗pdf ↗

Pipeline decomposes portfolio optimization problems into smaller, solvable subproblems.

problem Large-scale portfolio optimization with constraints.
method Decomposition pipeline with preprocessing, clustering, and risk rebalancing.
result Pipeline reduces problem size by 80% and computation time.

Motivated by the study of the interrelation between functorial and algebraic quantum field theory, we point out that on any locally trivial bundle of compact groups, representations up to homotopy are enough to separate points by means of the associated representations in cohomol- ogy. Furthermore, we observe that the …

2015-11-06abs ↗pdf ↗

Paper presents quantum algorithms for pricing financial derivatives using complex models.

problem Implementing complex financial models like local volatility on quantum computers.
method Developed two quantum circuit implementations for local volatility model.
result Demonstrated reduced qubit requirements for local volatility model.

Detects causal scenarios with inequality constraints among classical correlations.

problem Classifying causal structures and identifying those with inequality constraints.
method Using d-separation, e-separation, incompatible supports, and HLP condition.
result Resolved all but three causal scenarios with up to 4 observed variables.

Deep RNNs excel at capturing long-term dependencies in sequential data.

problem Lack of a formal measure for RNNs' long-term memory capacity.
method Introduced a measure called Start-End separation rank to quantify RNNs' ability to model long-term dependencies.
result Deep RNNs support Start-End separation ranks that are combinatorially higher than shallow ones.

Tensor-network techniques have enjoyed outstanding success in physics, and have recently attracted attention in machine learning, both as a tool for the formulation of new learning algorithms and for enhancing the mathematical understanding of existing methods. Inspired by these developments, and the natural correspond…

2019-07-08abs ↗pdf ↗

Motivated by the construction of spectral manifolds in noncommutative geometry, we introduce a higher degree Heisenberg commutation relation involving the Dirac operator and the Feynman slash of scalar fields. This commutation relation appears in two versions, one sided and two sided. It implies the quantization of the…

2014-11-04abs ↗pdf ↗

Study on kernels of SO(3) WRT representations for surfaces of genus g≥3.

problem Determine if the kernel of SO(3) WRT representations is generated by p-th powers of Dehn twists.
method Investigate kernels for different genus and prime p values, showing containment in specific subgroups.
result Kernels are contained in subgroups generated by p-th powers of Dehn twists and other specific elements for certain conditions.