Equivariant quantum circuits for learning on weighted graphs

Variational quantum algorithms are the leading candidate for advantage on near-term quantum hardware. When training a parametrized quantum circuit in this setting to solve a specific problem, the choice of ansatz is one of the most important factors that determines the trainability and performance o...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:npj quantum information Jg. 9; H. 1; S. 47 - 15
Hauptverfasser: Skolik, Andrea, Cattelan, Michele, Yarkoni, Sheir, Bäck, Thomas, Dunjko, Vedran
Format: Journal Article
Sprache:Englisch
Veröffentlicht: London Nature Publishing Group UK 13.05.2023
Nature Publishing Group
Nature Portfolio
Schlagworte:
639/705/1042
639/766/483/481
Algorithms
Circuits
Classical and Quantum Gravitation
Deep learning
Learning algorithms
Machine learning
Optimization
Performance evaluation
Physics
Physics and Astronomy
Quantum Computing
Quantum Field Theories
Quantum Information Technology
Quantum Physics
Relativity Theory
Spintronics
String Theory
Symmetry
ISSN:2056-6387, 2056-6387
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Variational quantum algorithms are the leading candidate for advantage on near-term quantum hardware. When training a parametrized quantum circuit in this setting to solve a specific problem, the choice of ansatz is one of the most important factors that determines the trainability and performance of the algorithm. In quantum machine learning (QML), however, the literature on ansatzes that are motivated by the training data structure is scarce. In this work, we introduce an ansatz for learning tasks on weighted graphs that respects an important graph symmetry, namely equivariance under node permutations. We evaluate the performance of this ansatz on a complex learning task, namely neural combinatorial optimization, where a machine learning model is used to learn a heuristic for a combinatorial optimization problem. We analytically and numerically study the performance of our model, and our results strengthen the notion that symmetry-preserving ansatzes are a key to success in QML.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2056-6387
2056-6387
DOI:10.1038/s41534-023-00710-y