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

3897781,1671,556 · Jun 202019922001200920172026
48 results for quantum reinforcement learning

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.

Quantum algorithms speed up reinforcement learning policies in large state-action spaces.

problem Limitations of quantum access in training reinforcement learning policies.
method Designing quantum algorithms to train reinforcement learning policies.
result Quantum algorithms offer full quadratic speed-ups in sample complexity for well-behaved policies.

A quantum reinforcement learning algorithm reduces sample complexity.

problem Quantum reinforcement learning under model-free settings with quantum oracle access.
method Quantum Natural Policy Gradient (QNPG) algorithm replacing random sampling with deterministic gradient estimation.
result QNPG achieves a sample complexity of ildeO(ε1.5) ilde{\mathcal{O}}(ε^{-1.5}) for queries to the quantum oracle, significantly improving classical lower bound.

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 ↗

Quantum UCB algorithm reduces reinforcement learning regret exponentially.

problem Episodic reinforcement learning with quantum state evolution.
method Upper Confidence Bound (UCB) quantum algorithm with quantum mean estimation.
result Exponential improvement in regret from $\Tilde{\mathcal{O}}(\sqrt{K})$ to $\Tilde{\mathcal{O}}(1)$.

Hybrid quantum-classical RL model solves standard benchmark tasks and proves quantum advantage.

problem Challenges in reinforcement learning, especially in solving standard benchmarking tasks.
method Parametrized quantum circuits in a hybrid quantum-classical RL model.
result Demonstrates quantum advantage in solving standard benchmarking tasks and intractable classical problems.

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.

In the past decade, the field of quantum machine learning has drawn significant attention due to the prospect of bringing genuine computational advantages to now widespread algorithmic methods. However, not all domains of machine learning have benefited equally from quantum enhancements. Notably, deep learning and rein…

2019-10-28abs ↗pdf ↗

A reinforcement learning approach prepares quantum squeezed states in open spin systems.

problem Generating non-classical states in open quantum systems with dissipation and dephasing.
method Reinforcement learning to determine optimal control pulses for spin-squeezing.
result Optimal control sequences enhance collective spin squeezing and entanglement.

Quantum machine learning aims to solve learning problems more efficiently.

problem Solving learning problems more efficiently using quantum processors.
method Leveraging quantum processors for optimization, supervised, unsupervised, reinforcement learning, and generative modeling.
result Quantum approaches may offer real benefits under certain conditions.

A RL-enhanced quantum-inspired algorithm solves combinatorial optimization problems.

problem Optimizing quantum-inspired algorithms for combinatorial problems.
method Reinforcement learning agent tunes hyperparameters of a quantum-inspired algorithm.
result The RL-enhanced algorithm samples high-quality solutions to the Ising problem.

Quantum RL algorithm achieves logarithmic regret for exploration.

problem Designing efficient quantum RL algorithms for exploration.
method UCRL-style quantum algorithm with lazy updating and quantum estimation.
result Proves O(poly(S,A,H,logT))\mathcal{O}(\mathrm{poly}(S, A, H, \log T)) worst-case regret.

Quantum machine learning solves high-dimensional PDEs with lower variance and improved accuracy.

problem Approximating solutions to high-dimensional parabolic PDEs.
method Pure Variational Quantum Circuit (VQC) for BSDE approximation, using temporal discretization and Monte Carlo simulation.
result VQC achieves lower variance and improved accuracy in most cases, particularly in highly nonlinear regimes.

Novel RL approach for molecular design using quantum mechanics.

problem Existing RL methods for molecular design are limited in scope and reward function.
method Formulation in Cartesian coordinates, direct use of quantum mechanics for reward function, translation and rotation invariant state-action space.
result Agent efficiently learns to solve molecular design tasks from scratch.

Quantum algorithms for multi-armed bandits are explored with limited reward access.

problem Exploring quantum speed-ups in multi-armed bandit problems with limited reward information.
method Introduced new bandit models and showed query complexity equivalence with classical algorithms.
result No quadratic speed-up is possible for multi-armed bandits with limited reward access.

New algorithms learn MDPs with better regret bounds using generative sampling.

problem Learning MDPs with optimal policies under uncertainty.
method Hybrid exploration-generative RL model, classical and quantum algorithms.
result Quantum algorithms achieve polylogT\operatorname{poly}\log{T} regret for infinite-horizon MDPs.

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 ↗

Improved fraud detection in finance with quantum-enhanced federated learning.

problem Challenges in detecting financial fraud with traditional methods.
method Hybrid quantum-enhanced federated learning framework combining quantum LSTM with privacy-preserving techniques.
result Approximately 5% improvement in performance metrics compared to conventional models.

Quantum-enhanced metrology aims to estimate an unknown parameter such that the precision scales better than the shot-noise bound. Single-shot adaptive quantum-enhanced metrology (AQEM) is a promising approach that uses feedback to tweak the quantum process according to previous measurement outcomes. Techniques and form…

2016-08-22abs ↗pdf ↗

Machine learning can help us in solving problems in the context big data analysis and classification, as well as in playing complex games such as Go. But can it also be used to find novel protocols and algorithms for applications such as large-scale quantum communication? Here we show that machine learning can be used …

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

The balance between exploration and exploitation is a key problem for reinforcement learning methods, especially for Q-learning. In this paper, a fidelity-based probabilistic Q-learning (FPQL) approach is presented to naturally solve this problem and applied for learning control of quantum systems. In this approach, fi…

2018-06-08abs ↗pdf ↗

Projective simulation (PS) is a model for intelligent agents with a deliberation capacity that is based on episodic memory. The model has been shown to provide a flexible framework for constructing reinforcement-learning agents, and it allows for quantum mechanical generalization, which leads to a speed-up in deliberat…

2018-04-23abs ↗pdf ↗

A novel neural network training method reduces gradient variance for faster and better reinforcement learning.

problem Improving convergence and generalization in deep reinforcement learning.
method Gradient Monitoring (GM) approach to dynamically adjust the learning process based on feedback.
result The proposed methods, especially AM-WGM, significantly enhance model performance and generalization.

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.

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.

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

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.

Quantum machine learning uses superposition to create a large ensemble of classifiers.

problem Improving machine learning efficiency on quantum computers.
method Using superposition to create an exponentially large ensemble of classifiers, trained with an optimization-free learning algorithm.
result Adding an optimization step improves the performance of quantum ensembles of classifiers.