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...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings of the International Conference on Automated Planning and Scheduling Ročník 28; s. 366 - 374
Hlavní autori:	Booth, Kyle, Do, Minh, Beck, J., Rieffel, Eleanor, Venturelli, Davide, Frank, Jeremy
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	01.01.2018
ISSN:	2334-0835, 2334-0843
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!