Pith. sign in

REVIEW 5 cited by

Curriculum reinforcement learning for quantum architecture search under hardware errors

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 2402.03500 v1 pith:TFQO5FM7 submitted 2024-02-05 quant-ph cs.AIcs.LG

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

The key challenge in the noisy intermediate-scale quantum era is finding useful circuits compatible with current device limitations. Variational quantum algorithms (VQAs) offer a potential solution by fixing the circuit architecture and optimizing individual gate parameters in an external loop. However, parameter optimization can become intractable, and the overall performance of the algorithm depends heavily on the initially chosen circuit architecture. Several quantum architecture search (QAS) algorithms have been developed to design useful circuit architectures automatically. In the case of parameter optimization alone, noise effects have been observed to dramatically influence the performance of the optimizer and final outcomes, which is a key line of study. However, the effects of noise on the architecture search, which could be just as critical, are poorly understood. This work addresses this gap by introducing a curriculum-based reinforcement learning QAS (CRLQAS) algorithm designed to tackle challenges in realistic VQA deployment. The algorithm incorporates (i) a 3D architecture encoding and restrictions on environment dynamics to explore the search space of possible circuits efficiently, (ii) an episode halting scheme to steer the agent to find shorter circuits, and (iii) a novel variant of simultaneous perturbation stochastic approximation as an optimizer for faster convergence. To facilitate studies, we developed an optimized simulator for our algorithm, significantly improving computational efficiency in simulating noisy quantum circuits by employing the Pauli-transfer matrix formalism in the Pauli-Liouville basis. Numerical experiments focusing on quantum chemistry tasks demonstrate that CRLQAS outperforms existing QAS algorithms across several metrics in both noiseless and noisy environments.

Discussion (0). Sign in to comment.

Forward citations

Cited by 5 Pith papers

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

  1. Discovering Data Encoding Strategies for Quantum-Classical Neural Networks Using Monte Carlo Tree Search

    quant-ph 2026-05 conditional novelty 7.0 of 10

    MCTS discovers superior data encoding circuits for QCCNNs that outperform standard encodings on medical datasets, with effective rank of feature maps serving as a performance predictor.

  2. Gated QKAN-FWP: Scalable Quantum-inspired Sequence Learning

    cs.LG 2026-05 unverdicted novelty 7.0 of 10

    Gated QKAN-FWP combines fast weight programming with quantum-inspired Kolmogorov-Arnold networks via single-qubit DARUAN activations and gated updates to deliver a 12.5k-parameter model that outperforms larger classic...

  3. Generative Quantum-inspired Kolmogorov-Arnold Eigensolver

    quant-ph 2026-05 unverdicted novelty 7.0 of 10

    GQKAE uses quantum-inspired Kolmogorov-Arnold networks to reduce parameters by 66% in generative quantum eigensolvers while achieving chemical accuracy on H4, N2, LiH, and other molecules.

  4. DreamQAS: Learning a Decision-Useful World Model for VQE-Efficient Quantum Architecture Search

    cs.LG 2026-07 conditional novelty 6.0 of 10

    DreamQAS reaches fine VQE error targets with 1.6–10.6× fewer real optimizer calls than a no-imagination control by learning only the energy-feedback score and imagining policy rollouts over exact circuit rules.

  5. Quantum Architecture Search for Solving Quantum Machine Learning Tasks

    quant-ph 2025-09 conditional novelty 5.0 of 10

    A reinforcement learning framework (RL-QAS) discovers compact variational quantum circuit architectures for Iris and binary MNIST classification, outperforming a simple strongly-entangling-layer baseline.

Pith tools