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

Trend · papers per month

19375674 · Jun 202019922001200920172026
48 results for quantum parallelism

Classical optimization algorithms in machine learning often take a long time to compute when applied to a multi-dimensional problem and require a huge amount of CPU and GPU resource. Quantum parallelism has a potential to speed up machine learning algorithms. We describe a generic mathematical model to leverage quantum…

2019-11-17abs ↗pdf ↗

Quantum computing improves Monte Carlo option pricing for complex derivatives.

problem Complex financial derivatives require extensive computations in high-dimensional spaces.
method Developed a quantum algorithm for simulating many potential asset paths in parallel.
result Quantum algorithm provides highly accurate option pricing and risk analysis.

This paper proposes a brain-inspired approach to quantum machine learning with the goal of circumventing many of the complications of other approaches. The fact that quantum processes are unitary presents both opportunities and challenges. A principal opportunity is that a large number of computations can be carried ou…

2018-10-13abs ↗pdf ↗

Study of bound states in quantum layers with confining potentials.

problem Investigating bound states in quantum layers with confining potentials.
method Developed a general approach using parallel coordinates based on the surface but outside its cut locus.
result Discrete eigenvalues exist for certain quantum layers with positive total Gauss curvature.

We propose a version of the non-relativistic quantum mechanics in which the pure states of a quantum system are described as sections of a Hilbert (generally infinitely-dimensional) fibre bundle over the space-time. There evolution is governed via (a kind of) a parallel transport in this bundle. Some problems concernin…

1998-03-29abs ↗pdf ↗

Quantum variational circuits improve reinforcement learning efficiency.

problem Improving reinforcement learning algorithms using quantum computing.
method Investigation of quantum variational circuits for DQN and Double DQN, encoding classical data for quantum circuits.
result Quantum variational circuits can solve reinforcement learning tasks with a smaller parameter space.

Ideas from deformation quantization applied to algebras with one generator lead to methods to treat a nonlinear flat connection. It provides us elements of algebras to be parallel sections. The moduli space of the parallel sections is studied as an example of bundle-like objects with discordant (sogo) transition functi…

2007-11-23abs ↗pdf ↗

New method combines QQA and gradient-based sampling for combinatorial optimization.

problem Scalability challenges in learning-based solvers for combinatorial optimization.
method Integrates gradient-based update through continuous relaxation with Quasi-Quantum Annealing (QQA) and parallel communication.
result Achieves superior speed-quality trade-offs for large-scale instances.

Unified framework for robust causal directionality in quantum systems under MNAR observation.

problem Determining causal directionality in quantum systems under MNAR observation.
method Integrates CVAE-based latent constraints, MNAR-aware selection models, GEE-stabilized regression, penalized empirical likelihood, and Bayesian optimization.
result Achieves lower bias and variance, near-nominal coverage, and superior quantum-specific diagnostics.

We generalize the notion of parallel transport along paths for abelian bundles to parallel transport along surfaces for abelian gerbes using an embedded Topological Quantum Field Theory (TQFT) approach. We show both for bundles and gerbes with connection that there is a one-to-one correspondence between their local des…

2003-02-06abs ↗pdf ↗

Quantum models face barren plateaus, but specific losses can be trainable.

problem Barren plateaus and loss concentration in quantum generative models.
method Investigated explicit and implicit losses, and their interplay.
result Explicit losses lead to new barren plateaus, while implicit losses can be trainable.

Quantum probability theory reveals hidden structure in joint probability distributions.

problem Understanding hidden structure in joint probability distributions.
method Modeling joint probability distributions as density operators and applying partial trace.
result Decoding extra information in reduced density operators that captures subsystem interactions.

Quantum stochastic flow computes heat kernel traces for Ricci flat manifolds.

problem Computing heat kernel traces for Ricci flat manifolds.
method Quantum stochastic differential equation (qsde) on Fock space over L2L^2 differential 1-forms, adapted flow construction.
result Trace of the connection Laplacian heat kernel can be computed over any compact Ricci-flat Riemannian manifold.

Quantum circuits explained using Shapley values for better understanding.

problem Improving the explainability of quantum machine learning circuits.
method Applying Shapley values to quantify gate importance in quantum circuits.
result Quantum circuits can be explained by their gate importance, enhancing understanding and interpretability.

A surprising image of the stock market arises if the price time series of all Dow Jones Industrial Average stock components are represented in one chart at once. The chart evolves into a braid representation of the stock market by taking into account only the crossing of stocks and fixing a convention defining overcros…

2014-06-13abs ↗pdf ↗

We propose a model of quantum gravity in arbitrary dimensions defined in terms of the BV quantization of a supersymmetric, infinite dimensional matrix model. This gives an (AKSZ-type) Chern-Simons theory with gauge algebra the space of observables of a quantum mechanical Hilbert space H. The model is motivated by previ…

2014-07-22abs ↗pdf ↗

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.

The colored Jones function of a knot is a sequence of Laurent polynomials that encodes the Jones polynomial of a knot and its parallels. It has been understood in terms of representations of quantum groups and Witten gave an intrinsic quantum field theory interpretation of the colored Jones function as the expectation …

2004-11-23abs ↗pdf ↗

We consider the Dirichlet Laplacian in tubular neighbourhoods of complete non-compact Riemannian manifolds immersed in the Euclidean space. We show that the essential spectrum coincides with the spectrum of a planar tube provided that the second fundamental form of the manifold vanishes at infinity and the transport of…

2012-11-12abs ↗pdf ↗

Jeffreys Flow improves robustness of Boltzmann generators for rare event sampling.

problem Rare events and metastable trapping in sampling physical systems with rough energy landscapes.
method Introduces Jeffreys Flow, a robust generative framework using Parallel Tempering distillation and symmetric Jeffreys divergence to mitigate mode collapse and improve mode coverage.
result Minimizing Jeffreys divergence suppresses mode collapse and corrects inaccuracies in multi-modal distributions.

A 3-dimensional homotopy quantum field theory (HQFT) can be described as a TQFT for surfaces and 3-cobordisms endowed with homotopy classes of maps into a given space. For a group ππ, we introduce a notion of a modular crossed ππ-category and show that such a category gives rise to a 3-dimensional HQFT with target sp…

2000-05-31abs ↗pdf ↗

New fault-tolerant quantum gates for homological LDPC codes with constant or almost-constant rate.

problem Fault-tolerant quantum computing for homological LDPC codes with constant or almost-constant encoding rate.
method Derive generic formula for transversal and logical gates acting on 3-manifolds, using higher symmetries and cup product cohomology.
result Parallelizable logical gates for homological LDPC codes with constant or almost-constant rate.

Study of panhandle polynomials of torus links with geometric applications.

problem Characterizing the HOMFLY-PT polynomial of torus knots and links.
method Utilizing quantum group representations and the Rosso-Jones formula.
result Established panhandle-like structure of HOMFLY-PT polynomials for torus knots and links.