REVIEW 2 cited by
Asynchronous training of quantum reinforcement learning
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
The development of quantum machine learning (QML) has received a lot of interest recently thanks to developments in both quantum computing (QC) and machine learning (ML). One of the ML paradigms that can be utilized to address challenging sequential decision-making issues is reinforcement learning (RL). It has been demonstrated that classical RL can successfully complete many difficult tasks. A leading method of building quantum RL agents relies on the variational quantum circuits (VQC). However, training QRL algorithms with VQCs requires significant amount of computational resources. This issue hurdles the exploration of various QRL applications. In this paper, we approach this challenge through asynchronous training QRL agents. Specifically, we choose the asynchronous training of advantage actor-critic variational quantum policies. We demonstrate the results via numerical simulations that within the tasks considered, the asynchronous training of QRL agents can reach performance comparable to or superior than classical agents with similar model sizes and architectures.
Forward citations
Cited by 2 Pith papers
-
Hybrid-Quantum Neural Architecture Search for The Proximal Policy Optimization Algorithm
In a 1000-iteration evolutionary search over hybrid quantum-classical PPO architectures on CartPole, the best hybrid model ranked 11th, behind eight classical models.
-
A Study on Quantum Neural Networks in Healthcare 5.0
A literature review that maps quantum neural network techniques to healthcare 5.0 applications, with a taxonomy, comparison tables, and a list of open challenges.
Discussion (0). Continue with ORCID to comment.