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

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of the International Conference on Automated Planning and Scheduling Ročník 28; s. 366 - 374
Hlavní autoři: Booth, Kyle, Do, Minh, Beck, J., Rieffel, Eleanor, Venturelli, Davide, Frank, Jeremy
Médium: Journal Article
Jazyk:angličtina
Vydáno: 01.01.2018
ISSN:2334-0835, 2334-0843
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract 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. In this paper, we explore the use of constraint programming (CP) as an alternative and complementary approach to temporal planning. We extend previous work by introducing two new problem variations that incorporate important characteristics identified by the quantum computing community. We apply temporal planning and CP to the baseline and extended QCC problems as both stand-alone and hybrid approaches. Our hybrid methods use solutions found by temporal planning to warm start CP, leveraging the ability of the former to find satisficing solutions to problems with a high degree of task optionality, an area that CP typically struggles with. The CP model, benefiting from inferred bounds on planning horizon length and task counts provided by the warm start, is then used to find higher quality solutions. Our empirical evaluation indicates that while stand-alone CP is only competitive for the smallest problems, CP in our hybridization with temporal planning out-performs stand-alone temporal planning in the majority of problem classes.
AbstractList 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. In this paper, we explore the use of constraint programming (CP) as an alternative and complementary approach to temporal planning. We extend previous work by introducing two new problem variations that incorporate important characteristics identified by the quantum computing community. We apply temporal planning and CP to the baseline and extended QCC problems as both stand-alone and hybrid approaches. Our hybrid methods use solutions found by temporal planning to warm start CP, leveraging the ability of the former to find satisficing solutions to problems with a high degree of task optionality, an area that CP typically struggles with. The CP model, benefiting from inferred bounds on planning horizon length and task counts provided by the warm start, is then used to find higher quality solutions. Our empirical evaluation indicates that while stand-alone CP is only competitive for the smallest problems, CP in our hybridization with temporal planning out-performs stand-alone temporal planning in the majority of problem classes.
Author Beck, J.
Venturelli, Davide
Do, Minh
Frank, Jeremy
Booth, Kyle
Rieffel, Eleanor
Author_xml – sequence: 1
  givenname: Kyle
  surname: Booth
  fullname: Booth, Kyle
– sequence: 2
  givenname: Minh
  surname: Do
  fullname: Do, Minh
– sequence: 3
  givenname: J.
  surname: Beck
  fullname: Beck, J.
– sequence: 4
  givenname: Eleanor
  surname: Rieffel
  fullname: Rieffel, Eleanor
– sequence: 5
  givenname: Davide
  surname: Venturelli
  fullname: Venturelli, Davide
– sequence: 6
  givenname: Jeremy
  surname: Frank
  fullname: Frank, Jeremy
BookMark eNp9kMtqwzAQRUVJoWmaD-hOP2BXb8vLYvoIBJpC9kZRpCCwJSMphf59bbfNoouuZuYy9zJzbsHCB28AuMeoxALVD06rIZUfRDpcYloTdAWWhFJWIMno4tJTfgPWKbkDYqziouZ0CWwT-kFF509Q-SPc-GxOUeVpboJPOSrnM9zFMKp9_7u2N_0QourgrlPeT6oNEb6flc_nHjYu6rPLcIp23RgW_B24tqpLZv1TV2D__LRvXovt28umedwWmkiZC1ITZipJ2RFpbFQtzMFIbjHRwgqOBJNMV7yillSUYk4PCGuEpGKWayE1XYHqO1bHkFI0ttUuzwdMj3QtRu0ErJ2BtTOwdgY2OvEf5xBdr-LnP54vmUN0ZA
CitedBy_id crossref_primary_10_1145_3680291
crossref_primary_10_1007_s00521_021_06009_3
crossref_primary_10_1016_j_ins_2022_11_020
crossref_primary_10_1007_s10601_022_09330_3
crossref_primary_10_1109_TCAD_2023_3261244
crossref_primary_10_22331_q_2025_05_28_1757
crossref_primary_10_3390_e27030232
crossref_primary_10_1109_TC_2024_3441825
crossref_primary_10_1140_epjp_s13360_024_05928_z
crossref_primary_10_1007_s11128_024_04317_w
crossref_primary_10_1016_j_asoc_2023_110456
crossref_primary_10_1109_TQE_2025_3527399
crossref_primary_10_1007_s11047_023_09955_0
crossref_primary_10_3390_e25030465
crossref_primary_10_1109_TCAD_2021_3057583
crossref_primary_10_1142_S0218126625502883
crossref_primary_10_1109_TQE_2023_3276970
crossref_primary_10_1109_TCAD_2022_3179223
crossref_primary_10_1109_TC_2020_3009140
crossref_primary_10_1007_s42484_020_00014_w
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.1609/icaps.v28i1.13920
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
DeliveryMethod fulltext_linktorsrc
EISSN 2334-0843
EndPage 374
ExternalDocumentID 10_1609_icaps_v28i1_13920
GroupedDBID AAYXX
ALMA_UNASSIGNED_HOLDINGS
CITATION
M~E
ID FETCH-LOGICAL-c288t-2924e7834d0c1ea96ebe85f12c6f6506484c7573f2733153b01c008a4f5c68c3
ISICitedReferencesCount 49
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000492986200044&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2334-0835
IngestDate Sat Nov 29 04:22:32 EST 2025
Tue Nov 18 22:27:45 EST 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c288t-2924e7834d0c1ea96ebe85f12c6f6506484c7573f2733153b01c008a4f5c68c3
OpenAccessLink https://ojs.aaai.org/index.php/ICAPS/article/download/13920/13769
PageCount 9
ParticipantIDs crossref_citationtrail_10_1609_icaps_v28i1_13920
crossref_primary_10_1609_icaps_v28i1_13920
PublicationCentury 2000
PublicationDate 2018-01-01
PublicationDateYYYYMMDD 2018-01-01
PublicationDate_xml – month: 01
  year: 2018
  text: 2018-01-01
  day: 01
PublicationDecade 2010
PublicationTitle Proceedings of the International Conference on Automated Planning and Scheduling
PublicationYear 2018
SSID ssib044756953
Score 2.0198886
Snippet Recently, the makespan-minimization problem of compiling a general class of quantum algorithms into near-term quantum processors has been introduced to the AI...
SourceID crossref
SourceType Enrichment Source
Index Database
StartPage 366
Title Comparing and Integrating Constraint Programming and Temporal Planning for Quantum Circuit Compilation
Volume 28
WOSCitedRecordID wos000492986200044&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2334-0843
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssib044756953
  issn: 2334-0835
  databaseCode: M~E
  dateStart: 20030101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9QwELaWwoELKgJEoSAfOIGyJHbiOMeyLeIhqiLtobco8TooUpqsdpNVufQf9j91_EygqkQPXKKV5cwmni8z4_E8EHqXEEEASWUA5kAcgD4ug6KMeVBJGifJiqj7dLOJ9PSUn59nZ7PZtcuF2TVp2_LLy2z9X1kNY8BslTp7D3Z7ojAAv4HpcAW2w_WfGL8wnQVt7uFXWw7CHO-rcrFF3fYqP0CFZV24aUtToarxTYx0-OHPAdZ9uPiwqDdiqHstPOpm5KU1as-8Ety6kIM_HY1jWqE6mzga-g7sZLB0_Z_p-FGAz0rFxf_yLoKuM16f778bj7_jzkT7t96P_Ukakf5t7k-PahWm0piwNVm03Wbq3Ij4xLmhZSChNFYFtM3Bt5yOmepOTojbDHMjhSljE4VOTRugW7qC6VKr8Cmst_Md4XU0B2uYhKNidMEAf-lLH8Wo9k9AJNckck0i1yQeoIckTTIVYfjj6sSJN1VakWW6Lqp_LXvODlQ-3nqQiaU0MXmW--iJ3avgI4Oxp2gm22eo8vjCwDU8wRce8YUn-NLTHL6wYzkGfGGLL2zxhSf4eo6Wn0-Wiy-BbdYRCMJ5HxDYyEvVtWUVikgWGYOvnCdVRASrmKqKyGORJimtiOoSmtAyjATYn0VcJYJxQV-gvbZr5UuEGWUUaKwKCqsE1mNJMpgWClrxgpM0O0ChW5dc2EL26uWa_E6GHKD3_pa1qeJy9-RX95n8Gj0ecXuI9vrNIN-gR2LX19vNW83_G9bpm50
linkProvider ISSN International Centre
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Comparing+and+Integrating+Constraint+Programming+and+Temporal+Planning+for+Quantum+Circuit+Compilation&rft.jtitle=Proceedings+of+the+International+Conference+on+Automated+Planning+and+Scheduling&rft.au=Booth%2C+Kyle&rft.au=Do%2C+Minh&rft.au=Beck%2C+J.&rft.au=Rieffel%2C+Eleanor&rft.date=2018-01-01&rft.issn=2334-0835&rft.eissn=2334-0843&rft.volume=28&rft.spage=366&rft.epage=374&rft_id=info:doi/10.1609%2Ficaps.v28i1.13920&rft.externalDBID=n%2Fa&rft.externalDocID=10_1609_icaps_v28i1_13920
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2334-0835&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2334-0835&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2334-0835&client=summon