Pith. sign in

REVIEW 3 cited by

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 2501.07085 v1 pith:LGKPNXIR submitted 2025-01-13 quant-ph

PPO-Q: Proximal Policy Optimization with Parametrized Quantum Policies or Values

classification quant-ph
keywords quantumenvironmentsppo-qactionlearningcontinuoushigh-dimensionalmachine
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Quantum machine learning (QML), which combines quantum computing with machine learning, is widely believed to hold the potential to outperform traditional machine learning in the era of noisy intermediate-scale quantum (NISQ). As one of the most important types of QML, quantum reinforcement learning (QRL) with parameterized quantum circuits as agents has received extensive attention in the past few years. Various algorithms and techniques have been introduced, demonstrating the effectiveness of QRL in solving some popular benchmark environments such as CartPole, FrozenLake, and MountainCar. However, tackling more complex environments with continuous action spaces and high-dimensional state spaces remains challenging within the existing QRL framework. Here we present PPO-Q, which, by integrating hybrid quantum-classical networks into the actor or critic part of the proximal policy optimization (PPO) algorithm, achieves state-of-the-art performance in a range of complex environments with significantly reduced training parameters. The hybrid quantum-classical networks in the PPO-Q incorporate two additional traditional neural networks to aid the parameterized quantum circuits in managing high-dimensional state encoding and action selection. When evaluated on 8 diverse environments, including four with continuous action space, the PPO-Q achieved comparable performance with the PPO algorithm but with significantly reduced training parameters. Especially, we accomplished the BipedalWalker environment, with a high-dimensional state and continuous action space simultaneously, which has not previously been reported in the QRL. More importantly, the PPO-Q is very friendly to the current NISQ hardware. We successfully trained two representative environments on the real superconducting quantum devices via the Quafu quantum cloud service.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

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

  1. Entanglement as a Structural Complexity Axis: A PAC-Bayesian View of Generalization in Quantum Policies and Value Functions

    quant-ph 2026-07 conditional novelty 7.0

    Entanglement raises the Fisher effective dimension of parameterized quantum circuits, producing a PAC-Bayes generalization bound that correctly ranks circuits of identical parameter count by their train-test gap.

  2. Learning quantum disentanglement scheduling from reduced states via modular hybrid policies

    quant-ph 2026-04 unverdicted novelty 6.0

    A hybrid policy with classical preprocessing and a parameterized quantum circuit learns effective multiqubit disentanglement scheduling from partial two-qubit reduced-state observations, with preprocessing dominating ...

  3. Scalable Quantum Reservoir Computing over Distributed Quantum Architectures

    quant-ph 2026-05 unverdicted novelty 5.0

    Quantum reservoir computing with distributed architectures reduces time-series forecasting errors by up to 78.8% MAE and 72.3% RMSE in NISQ simulations compared to classical methods.