Pith. sign in

REVIEW 17 cited by

Quantum circuit optimization with 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 2103.07585 v1 pith:UDOQDGKF submitted 2021-03-13 quant-ph

classification quant-ph
keywords quantumcircuitoptimizationapproachcircuitsapproachesarchitecturedeep
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

A central aspect for operating future quantum computers is quantum circuit optimization, i.e., the search for efficient realizations of quantum algorithms given the device capabilities. In recent years, powerful approaches have been developed which focus on optimizing the high-level circuit structure. However, these approaches do not consider and thus cannot optimize for the hardware details of the quantum architecture, which is especially important for near-term devices. To address this point, we present an approach to quantum circuit optimization based on reinforcement learning. We demonstrate how an agent, realized by a deep convolutional neural network, can autonomously learn generic strategies to optimize arbitrary circuits on a specific architecture, where the optimization target can be chosen freely by the user. We demonstrate the feasibility of this approach by training agents on 12-qubit random circuits, where we find on average a depth reduction by 27% and a gate count reduction by 15%. We examine the extrapolation to larger circuits than used for training, and envision how this approach can be utilized for near-term quantum devices.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 17 Pith papers

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

  1. Reinforcement Learning Control of Quantum Error Correction

    quant-ph 2025-11 conditional novelty 7.0 of 10

    A reinforcement-learning controller that treats quantum error-detection events as rewards stabilizes a superconducting surface/color code under injected drift, cuts logical error rates ~20% after expert calibration, a...

  2. Learning Circuits with Infinite Tensor Networks

    quant-ph 2025-06 conditional novelty 7.0 of 10

    Infinite tensor networks are used to compile translation-invariant quantum circuits that prepare ground states and time evolution operators with fewer gates than Trotterization.

  3. Shielded RL for Route-Charged Parity-Term Ordering in QEDA Phase Components

    quant-ph 2026-07 accept novelty 6.0 of 10

    Shielded RL reordering of commuting phase terms cuts routed CNOT counts by 5.7–12.2% over search baselines on parity-walk QEDA components, but the proxy does not transfer to extraction-heavy or token/permutation circuits.

  4. Quantum feature-map learning with reduced resource overhead

    quant-ph 2025-10 conditional novelty 6.0 of 10

    By classically reconstructing quantum model outputs, Q-FLAIR selects gates, features, and weights with O(M) quantum evaluations per iteration, decoupling quantum cost from feature dimension and enabling >90% MNIST acc...

  5. Quantum Circuit Optimization for the Fault-Tolerance Era: Do We Have to Start from Scratch?

    quant-ph 2025-09 conditional novelty 6.0 of 10

    Existing NISQ optimization passes can reduce estimated FTQC resource requirements, with rotation-gate reduction providing the largest gains.

  6. Leveraging Phase Polynomials for Quantum Circuit Optimization

    cs.PL 2025-06 conditional novelty 6.0 of 10

    A quantum circuit optimizer, PhasePoly, co-optimizes phase and output parity matrices and merges phase-polynomial blocks across gate barriers, reducing total gates by 34.9% and CNOT gates by 28.5% on average.

  7. POPQC: Parallel Optimization for Quantum Circuits (Extended Version)

    cs.DC 2025-06 conditional novelty 6.0 of 10

    POPQC parallelizes local quantum-circuit optimization with O(n log n) work and O(r log n) span and proves local optimality with respect to an external oracle.

  8. Quantum circuits as a game: A reinforcement learning agent for quantum compilation and its application to reconfigurable neutral atom arrays

    quant-ph 2025-06 conditional novelty 6.0 of 10

    A transformer-based reinforcement learning agent learns to reconfigure atoms in neutral atom arrays and reduces estimated logarithmic infidelity by up to about 20% on benchmark circuits, including unseen ones.

  9. Leveraging Diffusion Models for Parameterized Quantum Circuit Generation

    quant-ph 2025-05 conditional novelty 5.0 of 10

    A diffusion model is extended to generate both the architecture and the continuous gate parameters of parameterized quantum circuits, conditioned on target performance like fidelity or accuracy.

  10. Scalable Quantum Architecture Search via Landscape Analysis

    quant-ph 2025-05 conditional novelty 5.0 of 10

    A zero-shot quantum architecture search ranks circuits by relative landscape fluctuation computed with Clifford sampling, then prunes redundant gates, reaching 50-qubit VQE simulations with fewer gates.

  11. Improving thermal state preparation of Sachdev-Ye-Kitaev model with reinforcement learning on quantum hardware

    quant-ph 2025-01 reject novelty 5.0 of 10

    Reinforcement learning with a 3D convolutional network designs low-CNOT circuits for variational thermal state preparation of the SYK model up to 14 Majorana fermions, but training uses the exact free energy and fidel...

  12. Optimization of Hybrid Quantum-Classical Algorithms

    cs.DC 2025-05 conditional novelty 4.0 of 10

    The authors introduce metrics and seven optimization routines for Quil hybrid programs, showing improvements on magic state distillation and a modified iterative phase estimation program.

  13. UDiTQC: U-Net-Style Diffusion Transformer for Quantum Circuit Synthesis

    cs.LG 2025-01 conditional novelty 4.0 of 10

    A U-Net-style diffusion transformer (UDiT) is applied to quantum circuit synthesis, outperforming the U-Net-based GenQC on entanglement generation and unitary compilation in small-scale experiments.

  14. A hybrid learning agent for episodic learning tasks with unknown target distance

    quant-ph 2024-12 conditional novelty 4.0 of 10

    An episode-length-doubling rule adapted from Boyer's quantum search lets the hybrid QRL agent find a first reward in grid mazes without knowing the target distance, and it outperforms classical agents in several wall ...

  15. Practical Fidelity Limits of Toffoli Gates in Superconducting Quantum Processors

    quant-ph 2025-09 reject novelty 3.0 of 10

    Benchmarking a decomposed Toffoli gate on IBM quantum hardware yields 56-64% state fidelities, but the claimed state-dependent error pattern is confounded by using different devices.

  16. Quantum computing and artificial intelligence: status and perspectives

    quant-ph 2025-05 unverdicted novelty 3.0 of 10

    A broad expert white paper sets a European research agenda for combining quantum computing and AI, spanning quantum machine learning, AI-driven quantum control, and foundational questions.

  17. Artificial intelligence for representing and characterizing quantum systems

    quant-ph 2025-09 unverdicted novelty 1.0 of 10

    A review organizes AI-based quantum system characterization into ML, deep learning, and language model paradigms, covering property prediction and implicit state reconstruction.

Pith tools