REVIEW 2 cited by
Adiabatic training for Variational Quantum Algorithms
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
This paper presents a new hybrid Quantum Machine Learning (QML) model composed of three elements: a classical computer in charge of the data preparation and interpretation; a Gate-based Quantum Computer running the Variational Quantum Algorithm (VQA) representing the Quantum Neural Network (QNN); and an adiabatic Quantum Computer where the optimization function is executed to find the best parameters for the VQA. As of the moment of this writing, the majority of QNNs are being trained using gradient-based classical optimizers having to deal with the barren-plateau effect. Some gradient-free classical approaches such as Evolutionary Algorithms have also been proposed to overcome this effect. To the knowledge of the authors, adiabatic quantum models have not been used to train VQAs. The paper compares the results of gradient-based classical algorithms against adiabatic optimizers showing the feasibility of integration for gate-based and adiabatic quantum computing models, opening the door to modern hybrid QML approaches for High Performance Computing.
Forward citations
Cited by 2 Pith papers
-
QUBO-based training for VQAs on Quantum Annealers
A QUBO-based annealer training scheme with recursive refinement is tested on Iris, Heart Disease, and Diabetes, but the QUBO derivation has a critical gap.
-
A Survey on Integrating Quantum Computers into High Performance Computing Systems
A structured review of 107 papers on quantum-HPC integration, organized into seven categories, finds a flourishing tool ecosystem but little standardization.
Discussion (0). Continue with ORCID to comment.