{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T06:01:26Z","timestamp":1788242486206,"version":"build-2803163510"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031271809","type":"print"},{"value":"9783031271816","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-27181-6_26","type":"book-chapter","created":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T04:34:21Z","timestamp":1678422861000},"page":"374-386","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Quantum Circuit Compilation for\u00a0the\u00a0Graph Coloring Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4370-7156","authenticated-orcid":false,"given":"Angelo","family":"Oddi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2420-4713","authenticated-orcid":false,"given":"Riccardo","family":"Rasconi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5630-7173","authenticated-orcid":false,"given":"Marco","family":"Baioletti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8748-9632","authenticated-orcid":false,"given":"Vieri Giuliano","family":"Santucci","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hamish","family":"Beck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,3,11]]},"reference":[{"key":"26_CR1","unstructured":"Qiskit: an open-source framework for quantum computing (2021). https:\/\/doi.org\/10.5281\/zenodo.2573505"},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-72904-2_1","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"M Baioletti","year":"2021","unstructured":"Baioletti, M., Rasconi, R., Oddi, A.: A novel ant colony optimization strategy for the quantum circuit compilation problem. In: Zarges, C., Verel, S. (eds.) EvoCOP 2021. LNCS, vol. 12692, pp. 1\u201316. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72904-2_1"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Chand, S., Singh, H.K., Ray, T., Ryan, M.: Rollout based heuristics for the quantum circuit compilation problem. In: 2019 IEEE Congress on Evolutionary Computation (CEC), pp. 974\u2013981 (2019)","DOI":"10.1109\/CEC.2019.8790000"},{"issue":"5\u20136","key":"26_CR4","doi-asserted-by":"publisher","first-page":"1900015","DOI":"10.1002\/qute.201900015","volume":"2","author":"D Cruz","year":"2019","unstructured":"Cruz, D., et al.: Efficient quantum algorithms for GHZ and w states, and implementation on the IBM quantum computer. Adv. Quant. Technol. 2(5\u20136), 1900015 (2019)","journal-title":"Adv. Quant. Technol."},{"key":"26_CR5","first-page":"17","volume":"5","author":"P Erdos","year":"1960","unstructured":"Erdos, P., Renyi, A.: On the evolution of random graphs. Publ. Math. Inst. Hungary. Acad. Sci. 5, 17\u201361 (1960)","journal-title":"Publ. Math. Inst. Hungary. Acad. Sci."},{"key":"26_CR6","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028 (2014)"},{"issue":"2","key":"26_CR7","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s42979-020-00437-z","volume":"2","author":"FG Fuchs","year":"2021","unstructured":"Fuchs, F.G., Kolden, H.\u00d8., Aase, N.H., Sartor, G.: Efficient encoding of the weighted max $$k$$-cut on a quantum computer using QAOA. SN Comput. Sci. 2(2), 89 (2021). https:\/\/doi.org\/10.1007\/s42979-020-00437-z","journal-title":"SN Comput. Sci."},{"key":"26_CR8","unstructured":"Guerreschi, G.G., Park, J.: Gate scheduling for quantum algorithms. arXiv preprint arXiv:1708.00023 (2017)"},{"issue":"2","key":"26_CR9","doi-asserted-by":"publisher","first-page":"34","DOI":"10.3390\/a12020034","volume":"12","author":"S Hadfield","year":"2019","unstructured":"Hadfield, S., Wang, Z., O\u2019Gorman, B., Rieffel, E., Venturelli, D., Biswas, R.: From the quantum approximate optimization algorithm to a quantum alternating operator ansatz. Algorithms 12(2), 34 (2019)","journal-title":"Algorithms"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0167-6377(87)90021-6","volume":"6","author":"J Hart","year":"1987","unstructured":"Hart, J., Shogan, A.: Semi-greedy heuristics: an empirical study. Oper. Res. Lett. 6, 107\u2013114 (1987)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"26_CR11","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1109\/JETCAS.2016.2528720","volume":"6","author":"A Kole","year":"2016","unstructured":"Kole, A., Datta, K., Sengupta, I.: A heuristic for linear nearest neighbor realization of quantum circuits by swap gate insertion using $$n$$-gate lookahead. IEEE J. Emerg. Sel. Topics Circuits Syst. 6(1), 62\u201372 (2016). https:\/\/doi.org\/10.1109\/JETCAS.2016.2528720","journal-title":"IEEE J. Emerg. Sel. Topics Circuits Syst."},{"issue":"1","key":"26_CR12","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/TCAD.2017.2693284","volume":"37","author":"A Kole","year":"2018","unstructured":"Kole, A., Datta, K., Sengupta, I.: A new heuristic for $$n$$-dimensional nearest neighbor realization of a quantum circuit. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 37(1), 182\u2013192 (2018). https:\/\/doi.org\/10.1109\/TCAD.2017.2693284","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"26_CR13","unstructured":"Li, G., Ding, Y., Xie, Y.: Tackling the qubit mapping problem for NISQ-era quantum devices. CoRR abs\/1809.02573 (2018). https:\/\/arxiv.org\/1809.02573arxiv.org\/abs\/1809.02573"},{"key":"26_CR14","doi-asserted-by":"publisher","unstructured":"Maslov, D., Falconer, S.M., Mosca, M.: Quantum circuit placement: optimizing qubit-to-qubit interactions through mapping quantum circuits into a physical experiment. In: Proceedings of the 44th Annual Design Automation Conference, DAC\u201907, pp. 962\u2013965. ACM, New York, NY, USA (2007). https:\/\/doi.org\/10.1145\/1278480.1278717","DOI":"10.1145\/1278480.1278717"},{"key":"26_CR15","volume-title":"Automated Planning: Theory & Practice","author":"D Nau","year":"2004","unstructured":"Nau, D., Ghallab, M., Traverso, P.: Automated Planning: Theory & Practice. Morgan Kaufmann Publishers Inc., San Francisco (2004)"},{"key":"26_CR16","unstructured":"Oddi, A., Smith, S.: Stochastic procedures for generating feasible schedules. In: Proceedings 14th National Conference on AI (AAAI-97), pp. 308\u2013314 (1997)"},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-319-93031-2_32","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"A Oddi","year":"2018","unstructured":"Oddi, A., Rasconi, R.: Greedy randomized search for scalable compilation of quantum circuits. In: van Hoeve, W.J. (ed.) Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pp. 446\u2013461. Springer International Publishing, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93031-2_32"},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","volume":"2","author":"J Preskill","year":"2018","unstructured":"Preskill, J.: Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018). https:\/\/doi.org\/10.22331\/q-2018-08-06-79","journal-title":"Quantum"},{"issue":"1","key":"26_CR19","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/B:HEUR.0000019986.96257.50","volume":"10","author":"MG Resende","year":"2004","unstructured":"Resende, M.G., Werneck, R.F.: A hybrid heuristic for the p-median problem. J. Heuristics 10(1), 59\u201388 (2004)","journal-title":"J. Heuristics"},{"key":"26_CR20","doi-asserted-by":"publisher","unstructured":"Sete, E.A., Zeng, W.J., Rigetti, C.T.: A functional architecture for scalable quantum computing. In: 2016 IEEE International Conference on Rebooting Computing (ICRC), pp. 1\u20136 (2016).https:\/\/doi.org\/10.1109\/ICRC.2016.7738703","DOI":"10.1109\/ICRC.2016.7738703"},{"key":"26_CR21","doi-asserted-by":"publisher","unstructured":"Venturelli, D., Do, M., Rieffel, E., Frank, J.: Temporal planning for compilation of quantum approximate optimization circuits. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence, IJCAI-17, pp. 4440\u20134446 (2017). https:\/\/doi.org\/10.24963\/ijcai.2017\/620","DOI":"10.24963\/ijcai.2017\/620"},{"key":"26_CR22","doi-asserted-by":"publisher","first-page":"012320","DOI":"10.1103\/PhysRevA.101.012320","volume":"101","author":"Z Wang","year":"2020","unstructured":"Wang, Z., Rubin, N.C., Dominy, J.M., Rieffel, E.G.: $$xy$$ mixers: analytical and numerical results for the quantum alternating operator ansatz. Phys. Rev. A 101, 012320 (2020)","journal-title":"Phys. Rev. A"}],"container-title":["Lecture Notes in Computer Science","AIxIA 2022 \u2013 Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-27181-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T04:38:01Z","timestamp":1678423081000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-27181-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031271809","9783031271816"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-27181-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"11 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIxIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference of the Italian Association for Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Udine","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aiia2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aixia2022.uniud.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This proceeding includes one invited paper.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}