Alessandro Giovagnoli
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Alessandro Giovagnoli has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Barbara Ercolano
University Observatory, Faculty of Physics, Ludwig-Maximilians-Universität München
1 shared publication - J. Mittendorf
Ludwig Maximilians Univ Munchen, Univ Observ Munich, Fac Phys, Scheinerstr 1, D-81679 Munich, Germany
1 shared publication - Karan Molaverdikhani
Universitäts-Sternwarte, Fakultät für Physik, Ludwig-Maximilians-Universität München , Scheinerstr. 1, D-81679 München
1 shared publication - Matthias Schubert
LMU Munich
1 shared publication - Tommaso Grassi
Max-Planck-Institut für Extraterrestrische Physik
1 shared publication - Volker Tresp
LMU Munich
1 shared publication
Latest Publications
- Open Access
- 5 October 2024
- Published by Elsevier in Astronomy and Computing
- Vol. 49
Classifying the clouds of Venus using unsupervised machine learning
- 5 October 2024
- Published by Elsevier in Astronomy and Computing
- Vol. 49
Open AccessClassifying the clouds of Venus using unsupervised machine learning
- Open Access
- 15 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 647-650
QNEAT: Natural Evolution of Variational Quantum Circuit Architecture
Quantum Machine Learning (QML) is a recent and rapidly evolving field where the theoretical framework and logic of quantum mechanics are employed to solve machine learning tasks. Various techniques with different levels of quantum-classical hybridization have been proposed. Here we focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks in the noisy intermediate-scale quantum (NISQ) era. Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture. This paper focuses on this last problem for finding optimal architectures of variational quantum circuits for various tasks. To address it, we propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC. In particular, we present a version of the well-known neuroevolution of augmenting topologies (NEAT) algorithm and adapt it to the case of variational quantum circuits. We refer to the proposed architecture search algorithm for VQC as QNEAT. We test the algorithm with different benchmark problems of classical fields of machine learning i.e. reinforcement learning and combinatorial optimization.
- 15 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 647-650
Open AccessQNEAT: Natural Evolution of Variational Quantum Circuit Architecture
Quantum Machine Learning (QML) is a recent and rapidly evolving field where the theoretical framework and logic of quantum mechanics are employed to solve machine learning tasks. Various techniques with different levels of quantum-classical hybridization have been proposed. Here we focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks in the noisy intermediate-scale quantum (NISQ) era. Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture. This paper focuses on this last problem for finding optimal architectures of variational quantum circuits for various tasks. To address it, we propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC. In particular, we present a version of the well-known neuroevolution of augmenting topologies (NEAT) algorithm and adapt it to the case of variational quantum circuits. We refer to the proposed architecture search algorithm for VQC as QNEAT. We test the algorithm with different benchmark problems of classical fields of machine learning i.e. reinforcement learning and combinatorial optimization.