Machine Learning Optimization of Quantum Circuit Layouts
ACM Transactions on Quantum Computing · 30.06.2023 · 4 (2) · 1-25
DOI: 10.1145/3565271 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Transactions on Quantum Computing, online erschienen am 24.02.2023. Verfasst von Alexandru Paler und 3 weiteren Autor:innen. Die Arbeit wurde bisher 39-mal zitiert (Crossref) und nennt 41 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Google Faculty Research Awards.
Abstract (Originalsprache)
The quantum circuit layout (QCL) problem involves mapping out a quantum circuit such that the constraints of the device are satisfied. We introduce a quantum circuit mapping heuristic, QXX, and its machine learning version, QXX-MLP. The latter automatically infers the optimal QXX parameter values such that the laid out circuit has a reduced depth. In order to speed up circuit compilation, before laying the circuits out, we use a Gaussian function to estimate the depth of the compiled circuits. This Gaussian also informs the compiler about the circuit region that influences most the resulting circuit’s depth. We present empiric evidence for the feasibility of learning the layout method using approximation. QXX and QXX-MLP open the path to feasible large-scale QCL methods.
Förderung
- Google Faculty Research Awards
Zitieren
APA
Paler, A., Sasu, L., Florea, A., & Andonie, R. (2023). Machine Learning Optimization of Quantum Circuit Layouts. ACM Transactions on Quantum Computing, 4(2), 1-25. https://doi.org/10.1145/3565271
Vancouver
Paler A, Sasu L, Florea A, Andonie R. Machine Learning Optimization of Quantum Circuit Layouts. ACM Transactions on Quantum Computing. 2023;4(2):1-25. doi:10.1145/3565271
BibTeX
@article{Paler2023,
author = {Paler, Alexandru and Sasu, Lucian and Florea, Adrian-Cătălin and Andonie, Răzvan},
title = {Machine Learning Optimization of Quantum Circuit Layouts},
journal = {ACM Transactions on Quantum Computing},
year = {2023},
volume = {4},
number = {2},
pages = {1--25},
doi = {10.1145/3565271}
}
EUVIMED