REVIEW 4 cited by
Generative quantum combinatorial optimization by means of a novel conditional generative quantum eigensolver
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
Quantum computing is entering a transformative phase with the emergence of logical quantum processors, which hold the potential to tackle complex problems beyond classical capabilities. While significant progress has been made, applying quantum algorithms to real-world problems remains challenging. Hybrid quantum-classical techniques have been explored to bridge this gap, but they often face limitations in expressiveness, trainability, or scalability. In this work, we introduce conditional Generative Quantum Eigensolver (conditional-GQE), a context-aware quantum circuit generator powered by an encoder-decoder Transformer. Focusing on combinatorial optimization, we train our generator for solving problems with up to 10 qubits, exhibiting nearly perfect performance on new problems. By leveraging the high expressiveness and flexibility of classical generative models, along with an efficient preference-based training scheme, conditional-GQE provides a generalizable and scalable framework for quantum circuit generation. Our approach advances hybrid quantum-classical computing and contributes to accelerate the transition toward fault-tolerant quantum computing.
Forward citations
Cited by 4 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.
-
Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN
Any finite combinatorial problem with a known logical circuit can be encoded as a tensor network whose contraction defines an explicit, though generally inefficient, solution equation.
-
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). Continue with ORCID to comment.