{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T02:03:47Z","timestamp":1780711427963,"version":"3.54.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030729035","type":"print"},{"value":"9783030729042","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-72904-2_1","type":"book-chapter","created":{"date-parts":[[2021,3,26]],"date-time":"2021-03-26T11:03:03Z","timestamp":1616756583000},"page":"1-16","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A Novel Ant Colony Optimization Strategy for the Quantum Circuit Compilation Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5630-7173","authenticated-orcid":false,"given":"Marco","family":"Baioletti","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-0003-4370-7156","authenticated-orcid":false,"given":"Angelo","family":"Oddi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,3,27]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","unstructured":"Baioletti, M., Milani, A., Poggioni, V., Rossi, F.: Experimental evaluation of pheromone models in ACOPlan. Ann. Math. Artif. Intell. 62(3), 187\u2013217 (2011). https:\/\/doi.org\/10.1007\/s10472-011-9265-7","DOI":"10.1007\/s10472-011-9265-7"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1007\/978-3-319-68759-9_79","volume-title":"Simulated Evolution and Learning","author":"M Baioletti","year":"2017","unstructured":"Baioletti, M., Milani, A., Santucci, V.: A new precedence-based ant colony optimization for permutation problems. In: Shi, Y., et al. (eds.) SEAL 2017. LNCS, vol. 10593, pp. 960\u2013971. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68759-9_79"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Booth, K.E.C., Do, M., Beck, C., Rieffel, E., Venturelli, D., Frank, J.: Comparing and integrating constraint programming and temporal planning for quantum circuit compilation. In: Proceedings of the $$28^{th}$$ International Conference on Automated Planning & Scheduling, ICAPS 2018, pp. 366\u2013374 (2018)","DOI":"10.1609\/icaps.v28i1.13920"},{"key":"1_CR4","unstructured":"Brierley, S.: Efficient implementation of quantum circuits with limited qubit interactions. Quantum Inf. Comput. 17(13\u201314), 1096\u20131104 (2017). http:\/\/dl.acm.org\/citation.cfm?id=3179575.3179577"},{"key":"1_CR5","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"},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Cirac, J.I., Zoller, P.: Quantum computations with cold trapped ions. Phys. Rev. Lett. 74, 4091\u20134094 (1995). https:\/\/doi.org\/10.1103\/PhysRevLett.74.4091","DOI":"10.1103\/PhysRevLett.74.4091"},{"key":"1_CR7","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)"},{"key":"1_CR8","unstructured":"Do, M., Wang, Z., O\u2019Gorman, B., Venturelli, D., Rieffel, E., Frank, J.: Planning for compilation of a quantum algorithm for graph coloring. ArXiv abs\/2002.10917 (2020)"},{"key":"1_CR9","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. Bradford Company, USA (2004)"},{"key":"1_CR10","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028. November 2014"},{"key":"1_CR11","unstructured":"Guerreschi, G.G., Park, J.: Gate scheduling for quantum algorithms. arXiv preprint arXiv:1708.00023, July 2017"},{"key":"1_CR12","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."},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Herrera-Mart\u00ed, D.A., Fowler, A.G., Jennings, D., Rudolph, T.: Photonic implementation for the topological cluster-state quantum computer. Phys. Rev. A 82, 032332 (2010). https:\/\/doi.org\/10.1103\/PhysRevA.82.032332","DOI":"10.1103\/PhysRevA.82.032332"},{"issue":"4","key":"1_CR14","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1109\/TEVC.2002.802450","volume":"6","author":"D Merkle","year":"2002","unstructured":"Merkle, D., Merkle, M., Schmeck, H.: Ant colony optimization for resource-constrained project scheduling. IEEE Trans. Evol. Comput. 6(4), 333\u2013346 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"1_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":"1_CR16","volume-title":"Quantum Computation and Quantum Information: 10th Anniversary Edition","author":"MA Nielsen","year":"2011","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th Anniversary Edition, 10th edn. Cambridge University Press, New York (2011)","edition":"10"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","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.) CPAIOR 2018. LNCS, vol. 10848, pp. 446\u2013461. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93031-2_32"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Rasconi, R., Oddi, A.: An innovative genetic algorithm for the quantum circuit compilation problem. In: Proceeding of the Thirty-Third Conference on Artificial Intelligence, AAAI 2019, pp. 7707\u20137714. AAAI Press (2019)","DOI":"10.1609\/aaai.v33i01.33017707"},{"key":"1_CR19","doi-asserted-by":"publisher","unstructured":"Resende, M.G., Werneck, R.F.: A hybrid heuristic for the p-median problem. J. Heuristics 10(1), 59\u201388 (2004). https:\/\/doi.org\/10.1023\/B:HEUR.0000019986.96257.50","DOI":"10.1023\/B:HEUR.0000019986.96257.50"},{"key":"1_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, October 2016. https:\/\/doi.org\/10.1109\/ICRC.2016.7738703","DOI":"10.1109\/ICRC.2016.7738703"},{"key":"1_CR21","unstructured":"St\u00fctzle, T.: An ant approach to the flow shop problem. In: Proceedings of the 6th European Congress on Intelligent Techniques & Soft Computing, EUFIT 1998, Aachen, Germany, pp. 1560\u20131564 (1998)"},{"key":"1_CR22","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 Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, pp. 4440\u20134446 (2017). https:\/\/doi.org\/10.24963\/ijcai.2017\/620","DOI":"10.24963\/ijcai.2017\/620"},{"key":"1_CR23","doi-asserted-by":"publisher","unstructured":"Yao, N.Y., et al.: Quantum logic between remote quantum registers. Phys. Rev. A 87, 022306 (2013). https:\/\/doi.org\/10.1103\/PhysRevA.87.022306","DOI":"10.1103\/PhysRevA.87.022306"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-72904-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,22]],"date-time":"2022-12-22T14:44:27Z","timestamp":1671720267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-72904-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030729035","9783030729042"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-72904-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"27 March 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoCOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 April 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 April 2021","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":"evocop2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2021\/evocop\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}