Pith. sign in

REVIEW 3 cited by

Quantum Architecture Search via Deep 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

arxiv 2104.07715 v1 pith:OCYEB7JY submitted 2021-04-15 quant-ph cs.AIcs.LGcs.NE

classification quant-phcs.AIcs.LGcs.NE
keywords quantumarchitectureframeworkgatelearningagentdeepdesign
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Recent advances in quantum computing have drawn considerable attention to building realistic application for and using quantum computers. However, designing a suitable quantum circuit architecture requires expert knowledge. For example, it is non-trivial to design a quantum gate sequence for generating a particular quantum state with as fewer gates as possible. We propose a quantum architecture search framework with the power of deep reinforcement learning (DRL) to address this challenge. In the proposed framework, the DRL agent can only access the Pauli-$X$, $Y$, $Z$ expectation values and a predefined set of quantum operations for learning the target quantum state, and is optimized by the advantage actor-critic (A2C) and proximal policy optimization (PPO) algorithms. We demonstrate a successful generation of quantum gate sequences for multi-qubit GHZ states without encoding any knowledge of quantum physics in the agent. The design of our framework is rather general and can be employed with other DRL architectures or optimization methods to study gate synthesis and compilation for many quantum states.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Observable Geometry for Effective Quantum Circuits

    quant-ph 2026-07 conditional novelty 5.0 of 10

    A stabilizer-overlap score built from a Hamiltonian's eigenspaces predicts which variational circuit generators are redundant and should be removed.

  2. CircuitHunt: Automated Quantum Circuit Screening for Superior Credit-Card Fraud Detection

    quant-ph 2025-08 reject novelty 4.0 of 10

    CircuitHunt screens KetGPT circuits with qubit/parameter filters and 5-epoch macro-F1 scoring, selecting circuit #221 (6 qubits, 9 parameters) that reportedly hits 97% accuracy, but SMOTE-before-split inflates the tes...

  3. Hamiltonian Expressibility for Ansatz Selection in Variational Quantum Algorithms

    quant-ph 2025-07 conditional novelty 4.0 of 10

    In small variational quantum eigensolver problems, high Hamiltonian expressibility helps for superposition-state problems while low expressibility helps for basis-state problems.

Pith tools