Comparing and Integrating Constraint Programming and Temporal Planning for Quantum Circuit Compilation

Recently, the makespan-minimization problem of compiling a general class of quantum algorithms into near-term quantum processors has been introduced to the AI community. The research demonstrated that temporal planning is a strong approach for a class of quantum circuit compilation (QCC) problems. I...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Proceedings of the International Conference on Automated Planning and Scheduling Jg. 28; S. 366 - 374
Hauptverfasser:	Booth, Kyle, Do, Minh, Beck, J., Rieffel, Eleanor, Venturelli, Davide, Frank, Jeremy
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	01.01.2018
ISSN:	2334-0835, 2334-0843
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!