REVIEW 19 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
Quantum circuit optimization with deep reinforcement learning
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.
Forward citations
Cited by 19 Pith papers
-
Generative Quantum-inspired Kolmogorov-Arnold Eigensolver
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.
-
Structure-Aware Transformers for Learning Near-Optimal Trotter Orderings with System-Size Generalization in 1D Heisenberg Hamiltonians
A structure-aware transformer trained on 3-14 qubit systems predicts Trotter orderings for 16-20 qubit 1D Heisenberg Hamiltonians with a mean fidelity gap of 0.00115 to the best of 24 candidates.
-
Replay-buffer engineering for noise-robust quantum circuit optimization
Treating the replay buffer as a central lever in RL for quantum circuit optimization yields 4-32x sample efficiency gains, up to 67.5% faster episodes, and 85-90% fewer steps to accuracy on noisy molecular and compila...
-
Reinforcement Learning Control of Quantum Error Correction
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...
-
Shielded RL for Route-Charged Parity-Term Ordering in QEDA Phase Components
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.
-
Generative Quantum Data Embeddings for Supervised Learning
Generative optimization of quantum embedding circuits improves supervised classification on some datasets, with derived bounds showing performance saturation governed by Wasserstein distance of the classical input data.
-
Physics Guided Generative Optimization for Trotter Suzuki Decomposition
P-GONE applies generative ML to optimize Trotter-Suzuki decompositions, reporting up to 19.4x circuit depth reduction at F >= 0.95 versus Qiskit baselines on structured Hamiltonians.
-
Learning quantum disentanglement scheduling from reduced states via modular hybrid policies
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 ...
-
DeepQuantum: A PyTorch-based Software Platform for Quantum Machine Learning and Photonic Quantum Computing
DeepQuantum is a PyTorch platform that unifies quantum circuits, photonic quantum circuits, and measurement-based quantum computing in one open-source framework for hybrid models and variational algorithms.
-
Quantum feature-map learning with reduced resource overhead
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...
-
Quantum algorithms for equational reasoning
Presents a quantum Hamiltonian whose ground state encodes equivalence classes of expressions, enabling verification, counting, and structural queries on instances far beyond classical reach.
-
Learning-Optimized Qubit Mapping and Reuse to Minimize Inter-Core Communication in Modular Quantum Architectures
QARMA applies transformer-augmented reinforcement learning to qubit allocation and reuse in modular quantum systems, reporting up to 86% average reduction in inter-core communications versus optimized Qiskit baselines.
-
FactorLibrary: From Polynomials to Circuits via Recursive Subgoals
FactorLibrary stores reusable subexpressions to help RL agents (especially PPO+MCTS top-down) find certified optimal arithmetic circuits for polynomials up to complexity 8 at 91.8% success rate.
-
Automatic De-Quantization of Quantum Programs Using Constant Propagation
Hybrid quantum-classical constant propagation reduces multi-qubit quantum operations by propagating constants between quantum and classical program states.
-
Physics Guided Generative Optimization for Trotter Suzuki Decomposition
A generative optimization loop using diffusion models, PINNs, and GNNs achieves 85.6% of fourth-order Qiskit fidelity at 21.8% circuit depth for transverse-field Ising model Trotter-Suzuki decomposition.
-
Investigation of Automated Design of Quantum Circuits for Imaginary Time Evolution Methods Using Deep Reinforcement Learning
DDQN reinforcement learning automates VITE circuit design, producing circuits with ~37% fewer gates and ~43% less depth than hardware-efficient ansatze for Max-Cut while reaching Full-CI for H2 with shallower depth.
-
Noise tolerance via reinforcement in the quantum search problem
Reinforcement reduces quantum search time from √D to ln D and exponentially improves noise tolerance via numerical simulations on qubits and qudits.
-
Practical Fidelity Limits of Toffoli Gates in Superconducting Quantum Processors
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.
-
Artificial intelligence for representing and characterizing quantum systems
A review organizes AI-based quantum system characterization into ML, deep learning, and language model paradigms, covering property prediction and implicit state reconstruction.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.