{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T02:03:09Z","timestamp":1780711389982,"version":"3.54.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319930305","type":"print"},{"value":"9783319930312","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-93031-2_32","type":"book-chapter","created":{"date-parts":[[2018,6,7]],"date-time":"2018-06-07T06:04:24Z","timestamp":1528351464000},"page":"446-461","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Greedy Randomized Search for Scalable Compilation of Quantum Circuits"],"prefix":"10.1007","author":[{"given":"Angelo","family":"Oddi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Riccardo","family":"Rasconi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,6,8]]},"reference":[{"key":"32_CR1","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":"32_CR2","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":"32_CR3","unstructured":"Oddi, A., Smith, S.: Stochastic procedures for generating feasible schedules. In: Proceedings 14th National Conference on AI (AAAI-1997), pp. 308\u2013314 (1997)"},{"key":"32_CR4","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"},{"issue":"20","key":"32_CR5","doi-asserted-by":"publisher","first-page":"4091","DOI":"10.1103\/PhysRevLett.74.4091","volume":"74","author":"J. I. Cirac","year":"1995","unstructured":"Cirac, J.I., Zoller, P.: Quantum computations with cold trapped ions. Phys. Rev. Lett. 74, 4091\u20134094 (1995)","journal-title":"Physical Review Letters"},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"032332","DOI":"10.1103\/PhysRevA.82.032332","volume":"82","author":"DA Herrera-Mart\u00ed","year":"2010","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)","journal-title":"Phys. Rev. A"},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"022306","DOI":"10.1103\/PhysRevA.87.022306","volume":"87","author":"NY Yao","year":"2013","unstructured":"Yao, N.Y., Gong, Z.X., Laumann, C.R., Bennett, S.D., Duan, L.M., Lukin, M.D., Jiang, L., Gorshkov, A.V.: Quantum logic between remote quantum registers. Phys. Rev. A 87, 022306 (2013)","journal-title":"Phys. Rev. A"},{"key":"32_CR8","unstructured":"Brierley, S.: Efficient implementation of quantum circuits with limited qubit interactions. arXiv preprint arXiv:1507.04263, September 2016"},{"key":"32_CR9","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028, November 2014"},{"key":"32_CR10","unstructured":"Guerreschi, G.G., Park, J.: Gate scheduling for quantum algorithms. arXiv preprint arXiv:1708.00023, July 2017"},{"key":"32_CR11","doi-asserted-by":"crossref","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","DOI":"10.1109\/ICRC.2016.7738703"},{"key":"32_CR12","doi-asserted-by":"crossref","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)","DOI":"10.24963\/ijcai.2017\/620"},{"key":"32_CR13","doi-asserted-by":"crossref","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 2007, pp. 962\u2013965. ACM, New York (2007)","DOI":"10.1109\/DAC.2007.375304"},{"issue":"1","key":"32_CR14","first-page":"61","volume":"20","author":"M Fox","year":"2003","unstructured":"Fox, M., Long, D.: PDDL2.1: An extension to PDDL for expressing temporal planning domains. J. Artif. Int. Res. 20(1), 61\u2013124 (2003)","journal-title":"J. Artif. Int. Res."},{"key":"32_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)"},{"issue":"1","key":"32_CR16","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. Top. Circ. Syst. 6(1), 62\u201372 (2016)","journal-title":"IEEE J. Emerg. Sel. Top. Circ. Syst."},{"issue":"1","key":"32_CR17","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. Circ. Syst. 37(1), 182\u2013192 (2018)","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circ. Syst."},{"key":"32_CR18","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"key":"32_CR19","unstructured":"Gomes, C.P., Selman, B., Kautz, H.: Boosting combinatorial search through randomization. In: Proceedings of the Fifteenth National\/Tenth Conference on Artificial Intelligence\/Innovative Applications of Artificial Intelligence. AAAI 1998\/IAAI 1998, pp. 431\u2013437. American Association for Artificial Intelligence, Menlo Park (1998)"},{"key":"32_CR20","doi-asserted-by":"crossref","unstructured":"Eyerich, P., Mattm\u00fcller, R., R\u00f6ger, G.: Using the context-enhanced additive heuristic for temporal and numeric planning. In: Proceedings of the 19th International Conference on Automated Planning and Scheduling, ICAPS 2009, Thessaloniki, Greece, 19\u201323 September 2009 (2009)","DOI":"10.1609\/icaps.v19i1.13373"},{"issue":"04","key":"32_CR21","doi-asserted-by":"publisher","first-page":"767","DOI":"10.1142\/S0218213004001806","volume":"13","author":"BW Wah","year":"2004","unstructured":"Wah, B.W., Chen, Y.: Subgoal partitioning and global search for solving temporal planning problems in mixed space. Int. J. Artif. Intell. Tools 13(04), 767\u2013790 (2004)","journal-title":"Int. J. Artif. Intell. Tools"},{"issue":"1","key":"32_CR22","first-page":"323","volume":"26","author":"Y Chen","year":"2006","unstructured":"Chen, Y., Wah, B.W., Hsu, C.W.: Temporal planning using subgoal partitioning and resolution in SGPlan. J. Artif. Int. Res. 26(1), 323\u2013369 (2006)","journal-title":"J. Artif. Int. Res."},{"issue":"1","key":"32_CR23","first-page":"239","volume":"20","author":"A Gerevini","year":"2003","unstructured":"Gerevini, A., Saetti, A., Serina, I.: Planning through stochastic local search and temporal action graphs in LPG. J. Artif. Int. Res. 20(1), 239\u2013290 (2003)","journal-title":"J. Artif. Int. Res."}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-93031-2_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:29:26Z","timestamp":1709832566000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-93031-2_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319930305","9783319930312"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-93031-2_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"8 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Delft","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2018\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}