Pith. sign in

REVIEW 1 cited by

Deep-Q Learning with Hybrid Quantum Neural Network on Solving Maze Problems

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

arxiv 2304.10159 v3 pith:Z5C3QSCS submitted 2023-04-20 quant-ph cs.AIcs.LG

classification quant-phcs.AIcs.LG
keywords quantumlearningproblemshybridmazeneuralpotentialreinforcement
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Quantum computing holds great potential for advancing the limitations of machine learning algorithms to handle higher dimensions of data and reduce overall training parameters in deep learning (DL) models. This study uses a trainable variational quantum circuit (VQC) on a gate-based quantum computing model to investigate the potential for quantum benefit in a model-free reinforcement learning problem. Through a comprehensive investigation and evaluation of the current model and capabilities of quantum computers, we designed and trained a novel hybrid quantum neural network based on the latest Qiskit and PyTorch framework. We compared its performance with a full-classical CNN with and without an incorporated VQC. Our research provides insights into the potential of deep quantum learning to solve a maze problem and, potentially, other reinforcement learning problems. We conclude that reinforcement learning problems can be practical with reasonable training epochs. Moreover, a comparative study of full-classical and hybrid quantum neural networks is discussed to understand these two approaches' performance, advantages, and disadvantages to deep-Q learning problems, especially on larger-scale maze problems larger than 4x4.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Hybrid-Quantum Neural Architecture Search for The Proximal Policy Optimization Algorithm

    quant-ph 2025-01 conditional novelty 5.0 of 10

    In a 1000-iteration evolutionary search over hybrid quantum-classical PPO architectures on CartPole, the best hybrid model ranked 11th, behind eight classical models.

Pith tools