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

22436586 · May 202619922001200920172026
48 results for quantum mixing

Study of quantum spaces on Kähler manifolds with T-symmetry converging to a mixed polarization.

problem Quantum spaces on Kähler manifolds with T-symmetry and their convergence.
method Construction of a one-parameter family of Kähler structures and study of quantum spaces.
result Quantum spaces corresponding to different polarizations converge to a mixed polarization as the parameter goes to infinity.

In this paper we propose a geometrization of the non-relativistic quantum mechanics for mixed states. Our geometric approach makes use of the Uhlmann's principal fibre bundle to describe the space of mixed states and as a novelty tool, to define a dynamic-dependent metric tensor on the principal manifold, such that the…

2013-02-06abs ↗pdf ↗

Quantum mixing for eigenfunctions on hyperbolic surfaces converging to the hyperbolic plane.

problem Mixing of quantum eigenfunctions on converging hyperbolic surfaces.
method Duhamel formula for hyperbolic wave equation, exponential mixing of geodesic flow.
result Quantum mixing for eigenfunctions in large spectral windows.

Quantum mechanics fundamentally forbids deterministic discrimination of quantum states and processes. However, the ability to optimally distinguish various classes of quantum data is an important primitive in quantum information science. In this work, we train near-term quantum circuits to classify data represented by …

2018-05-22abs ↗pdf ↗

Study explores quantum spaces on toric varieties and their limiting behavior.

problem Understanding quantum spaces on toric varieties and their limiting behavior.
method Established quantum spaces for mixed polarizations and examined one-parameter families of Kähler polarizations.
result Quantum spaces Hk,t\mathcal{H}_{k,t} converge to Hk\mathcal{H}_{k} as tightarrowt ightarrow \infty.

A quantum state generation method that respects physical constraints.

problem Generating quantum states with complex-valued Hermitian, positive semi-definite, and trace one properties.
method Mirror diffusion model with von Neumann entropy to enforce structural constraints.
result Demonstrated effective generation of quantum states with conditional guidance.

QNA uses quantum-inspired density operators to diagnose market dependence and structural risk.

problem Lack of unified operator representation for market dependence and structural risk diagnostics.
method Quantum Network of Assets (QNA) framework using density operators.
result QNA entropy remains strongly related to covariance spectral entropy but becomes distinct with multi-feature rolling trajectories.

We introduce two methods for estimating the density matrix for a quantum system: Quantum Maximum Likelihood and Quantum Variational Inference. In these methods, we construct a variational family to model the density matrix of a mixed quantum state. We also introduce quantum flows, the quantum analog of normalizing flow…

2019-04-11abs ↗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.

Recently, increased computational power and data availability, as well as algorithmic advances, have led machine learning techniques to impressive results in regression, classification, data-generation and reinforcement learning tasks. Despite these successes, the proximity to the physical limits of chip fabrication al…

2017-07-26abs ↗pdf ↗

Paper develops security model and pricing for stable digital currency in quantum blockchain network.

problem Securing and pricing stable digital currency in a quantum blockchain network.
method Developed a block-based quantum channel networking technology and a FinTech platform model with dynamic pricing.
result Established a generalized IoB security model using quantum channel networking and QKD.

Quantum algorithm speeds up MIP solving by a near-quadratic factor.

problem Solving Mixed Integer Programs (MIPs) efficiently.
method Incremental-Quantum-Branch-and-Bound algorithm combining quantum speedup with classical search heuristics.
result Universal near-quadratic speedup over classical Branch-and-Bound algorithms.

New algorithm improves efficiency of quantum system modeling.

problem Intractable complexities in quantum Hamiltonian learning and Gibbs sampling.
method Generalized quantum natural gradient descent and Quantum-Probabilistic Mirror Descent.
result Data sample efficiency proven using information geometry and quantum metrology.

The main goal of this paper is to explore latent topic analysis (LTA), in the context of quantum information retrieval. LTA is a valuable technique for document analysis and representation, which has been extensively used in information retrieval and machine learning. Different LTA techniques have been proposed, some b…

2019-03-07abs ↗pdf ↗

In Deep Learning, a well-known approach for training a Deep Neural Network starts by training a generative Deep Belief Network model, typically using Contrastive Divergence (CD), then fine-tuning the weights using backpropagation or other discriminative techniques. However, the generative training can be time-consuming…

2015-10-21abs ↗pdf ↗

The mixture of Gaussian distributions, a soft version of k-means , is considered a state-of-the-art clustering algorithm. It is widely used in computer vision for selecting classes, e.g., color, texture, and shapes. In this algorithm, each class is described by a Gaussian distribution, defined by its mean and covarianc…

2016-12-29abs ↗pdf ↗

It is known that evaluating a certain approximation to the Jones polynomial for the plat closure of a braid is a BQP-complete problem. That is, this problem exactly captures the power of the quantum circuit model. The one clean qubit model is a model of quantum computation in which all but one qubit starts in the maxim…

2007-07-19abs ↗pdf ↗

Quantum Clustering is a powerful method to detect clusters in data with mixed density. However, it is very sensitive to a length parameter that is inherent to the Schrödinger equation. In addition, linking data points into clusters requires local estimates of covariance that are also controlled by length parameters. Th…

2019-02-14abs ↗pdf ↗

Develops a new calculus for studying operators on principal bundles.

problem Investigates GG-equivariant operators on principal bundles over manifolds.
method Introduces Borel-Weil calculus to analyze GG-equivariant (pseudo)differential operators.
result Explicit conditions for rapid mixing in dynamical systems and spectral theory results for sub-elliptic Laplacians.

Quantum ML promises faster data analysis but faces trainability challenges.

problem Challenges in training quantum machine learning models.
method Review of current methods and applications of quantum neural networks and quantum deep learning.
result Opportunities for quantum advantage in quantum machine learning.

QGAA learns latent quantum states, reducing errors in quantum data generation.

problem Learning latent representations for quantum data generation.
method Quantum Generative Adversarial Autoencoder (QGAA) combining QAE and QGAN.
result Average errors in energies for H2 and LiH are 0.02 Ha and 0.06 Ha respectively, demonstrating QGAA's potential.

New algorithm classifies and generates genomic sequences using RG-flow categorifier.

problem Classifying and generating genomic sequences for disease prediction.
method RG-flow based categorifier combining quantum field theory, holographic duality, and neural ODEs.
result RG categorifier can classify and generate new sequences from genomic data.

Quantum machine learning uses quantum cross entropy to minimize loss, but measurement loss affects this process.

problem Quantum machine learning's loss minimization through cross entropy is affected by measurement outcomes.
method Defined quantum cross entropy, proved its lower bounds, and investigated its relation to quantum fidelity and likelihood.
result Quantum cross entropy is lower-bounded by negative log-likelihood when derived from quantum data, but measurement outcomes can cause loss.

Quantum Earth Mover's distance improves stability and efficiency in quantum learning.

problem Quantum learning's loss landscapes often lead to poor local minima and gradients.
method Introduced the quantum Earth Mover's (EM) distance and proposed a quantum Wasserstein generative adversarial network (qWGAN).
result The quantum EM distance makes quantum learning more stable and efficient.

Quantum machine learning models can approximate any continuous function.

problem Theoretical understanding of quantum feature maps in machine learning.
method Proving universal approximation property of quantum machine learning models in quantum-enhanced feature spaces.
result Quantum machine learning models are universal approximators of continuous functions.

Restricted Boltzmann machines (RBMs) are powerful machine learning models, but learning and some kinds of inference in the model require sampling-based approximations, which, in classical digital computers, are implemented using expensive MCMC. Physical computation offers the opportunity to reduce the cost of sampling …

2013-12-18abs ↗pdf ↗

Quantum autoencoders allow for reducing the amount of resources in a quantum computation by mapping the original Hilbert space onto a reduced space with the relevant information. Recently, it was proposed to employ approximate quantum adders to implement quantum autoencoders in quantum technologies. Here, we carry out …

2018-07-27abs ↗pdf ↗

We define quantum exterior product wedge_h and quantum exterior differential d_h on Poisson manifolds, of which symplectic manifolds are an important class of examples. Quantum de Rham cohomology is defined as the cohomology of d_h. We also define quantum Dolbeault cohomology. Quantum hard Lefschetz theorem is proved. …

1998-06-30abs ↗pdf ↗

VQAs use classical optimization to train quantum circuits, promising quantum advantage.

problem High computational cost of quantum simulations and solving large-scale problems.
method Variational Quantum Algorithms (VQAs) use classical optimizers to train parametrized quantum circuits.
result VQAs are a promising strategy for obtaining quantum advantage.

Quantum machine learning tackles large datasets with randomized measurements.

problem Efficiently process large, high-dimensional datasets on quantum computers.
method Randomized measurements to scale linearly with dataset size and quadratic for post-processing.
result Substantial speed-up for noisy quantum computers, enabling image classification.