REVIEW 6 cited by
QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits
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
QAOA-GPT: Efficient Generation of Adaptive and Regular Quantum Approximate Optimization Algorithm Circuits
read the original abstract
Quantum computing has the potential to improve our ability to solve certain optimization problems that are computationally difficult for classical computers, by offering new algorithmic approaches that may provide speedups under specific conditions. In this work, we introduce QAOA-GPT, a generative framework that leverages Generative Pretrained Transformers (GPT) to directly synthesize quantum circuits for solving quadratic unconstrained binary optimization problems, and demonstrate it on the MaxCut problem on graphs. To diversify the training circuits and ensure their quality, we have generated a synthetic dataset using the adaptive QAOA approach, a method that incrementally builds and optimizes problem-specific circuits. The experiments conducted on a curated set of graph instances demonstrate that QAOA-GPT, generates high quality quantum circuits for new problem instances unseen in the training as well as successfully parametrizes QAOA. Our results show that using QAOA-GPT to generate quantum circuits will significantly decrease both the computational overhead of classical QAOA and adaptive approaches that often use gradient evaluation to generate the circuit and the classical optimization of the circuit parameters. Our work shows that generative AI could be a promising avenue to generate compact quantum circuits in a scalable way.
Forward citations
Cited by 6 Pith papers
-
Learning to Prepare Molecular Ground States with Transformer Models
Transformers trained on ADAPT-VQE data generate imipramine ground-state circuits in seconds at roughly reference accuracy — and beat the training data after reinforcement learning — though real-hardware energies still...
-
Performance Model for Hybrid Quantum-Classical Workflows
A two-level runtime model decomposes hybrid quantum-classical cycles into quantum, classical, and communication time, allowing a communication-to-computation ratio to classify workflows as compute- or communication-bound.
-
Scaling Quantum Optimization for Unit Commitment via Pauli Correlation Encoding
Hybrid quantum-classical optimization for unit commitment uses Pauli-Correlation Encoding to solve multi-period schedules with up to 312 binary variables while satisfying load, ramping, and reserve constraints.
-
Generative quantum eigensolver with constrained circuit-cutting overhead
The authors extend generative quantum eigensolver to produce circuits with upper-bounded quantum circuit-cutting overhead for molecular ground-state search, tested via transformer decoder on BeH2 with a new loss funct...
-
Direct entanglement ansatz learning (DEAL) with ZNE on error-prone superconducting qubits
DEAL boosts success rates in quantum combinatorial optimization by up to 14% over QAOA on superconducting qubits via direct parameter-to-angle mapping, entanglement ansatz, and ZNE.
-
Setting angles in quantum approximate optimization at utility-scale
The paper benchmarks approximation techniques and transfer learning for setting QAOA angles at utility scale and extracts operational guidance from hardware-validated results.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.