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

0.3%0.5%0.8%0.3% · Aug 202119922001200920172026
20 results for NISQ

InfoQGAN uses mutual information to improve QGANs, overcoming mode collapse and feature disentanglement issues.

problem Mode collapse and lack of feature control in QGANs.
method Integrates InfoGAN principles with variational quantum circuit, classical discriminator, and MINE for mutual information optimization.
result InfoQGAN effectively mitigates mode collapse and achieves robust feature disentanglement.

Meta-learning algorithms prepare quantum Gibbs states efficiently for NISQ devices.

problem Efficiently preparing quantum Gibbs states for NISQ devices.
method Meta-Variational Quantum Thermalizer (Meta-VQT) and Neural Network Meta-VQT (NN-Meta VQT) algorithms.
result Meta-learned parameters significantly outperform random initializations in optimization tasks.

The paper explores the generalization of quantum neural networks using stability theory.

problem Understanding the generalization properties of quantum neural networks.
method The authors use algorithmic stability to establish generalization bounds for quantum neural networks.
result The paper provides practical insights into the design and training of quantum neural networks.

The state-of-the-art machine learning approaches are based on classical von Neumann computing architectures and have been widely used in many industrial and academic domains. With the recent development of quantum computing, researchers and tech-giants have attempted new quantum circuits for machine learning tasks. How…

2019-06-30abs ↗pdf ↗

Researchers develop a framework for quantum machine learning models.

problem Comparing quantum machine learning models and their resource requirements.
method Constructive framework of linear quantum models using quantum information theory.
result Linear quantum models require exponentially more qubits than data re-uploading models for certain learning tasks.

Quantum algorithms for CVaR portfolio optimization face trade-offs between hardware coherence and expressibility.

problem Quantum algorithmic resilience for CVaR portfolio optimization
method WS-QAOA vs. HE-VQNN
result WS-QAOA provides exact theoretical mapping but suffers from hardware decoherence, while HE-VQNN preserves hardware coherence but lacks expressibility.

Probabilistic Quantum Memory (PQM) is a data structure that computes the distance from a binary input to all binary patterns stored in superposition on the memory. This data structure allows the development of heuristics to speed up artificial neural networks architecture selection. In this work, we propose an improved…

2020-01-11abs ↗pdf ↗

This work proposes efficient classical training protocols for IQP circuits to train quantum generative models.

problem Training quantum generative models on industrially relevant probability distributions is challenging due to high computational cost.
method Developed protocols for classical training of IQP circuits, which are hard to sample but have efficient gradient computation.
result Classically trained IQP circuits can efficiently sample from target probability distributions, demonstrating practical quantum advantage.

This study improves quantum classifiers by optimizing data preprocessing.

problem Quantum Machine Learning advantages are not yet clearly demonstrated.
method Used Linear Discriminant Analysis (LDA) for data preprocessing.
result Variational Quantum Algorithm (VQA) outperforms classical classifiers.

Study finds no significant difference in neural network weights with quantum random numbers.

problem Effects of biased quantum random numbers on neural network initialization.
method Empirical study using quantum hardware and classical pseudo-random numbers.
result No statistically significant difference found between quantum random numbers and other types.

Quantum algorithm for pricing European call options.

problem Accurate valuation of financial derivatives, especially for complex models and options.
method Transforms classical FFT into quantum QFT for pricing European call options.
result Quantum algorithm outperforms classical Monte Carlo simulation in NISQ era.

Quantum method speeds up risk estimation for insurance tail risks.

problem Sample-sparsity in classical Monte Carlo methods for tail risk pricing.
method Quantum Amplitude Estimation (QAE) with Grover amplification.
result Quantum method achieves convergence approaching order reciprocal N, enabling high-resolution tail estimation within practical budgets.

Hybrid QAOA approach optimizes portfolios with strict constraints, outperforming classical methods.

problem Combinatorial optimization under strict cardinality constraints in portfolio management.
method Constraint-preserving QAOA with XY-mixers and Trotterized initialization.
result QAOA achieves a Sharpe Ratio of 1.81, significantly outperforming classical methods.

Hybrid QML model improves recovery rate prediction accuracy.

problem Complex nonlinear dependencies, high-dimensional feature spaces, and limited sample sizes in recovery rate forecasting.
method Hybrid Quantum Machine Learning (QML) with Amplitude Encoding, leveraging PQC and qubit data compression.
result Significantly lower RMSE (0.228) compared to classical models.

Quantum model outperforms classical in training but underperforms in real-world metrics.

problem Mismatch between proxy reward signals and true investment objectives in financial domains.
method Hybrid quantum-classical reinforcement learning framework with automated feature engineering.
result Quantum models achieve higher training rewards but underperform in real-world metrics.

Quantum optimization for portfolios with risk and diversification constraints.

problem Implementing complex constraints in portfolio optimization for financial applications.
method Transformed portfolio optimization into a quadratic binary optimization problem suitable for quantum annealers.
result Demonstrated practical implementation of daily constraints in real data using quantum processors.