REVIEW 7 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
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 7 Pith papers
-
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.
-
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...
-
Leveraging Phase Polynomials for Quantum Circuit Optimization
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.
-
Quantum circuits as a game: A reinforcement learning agent for quantum compilation and its application to reconfigurable neutral atom arrays
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.
-
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 to comment.