{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T13:23:03Z","timestamp":1770988983380,"version":"3.50.1"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030507428","type":"print"},{"value":"9783030507435","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-50743-5_10","type":"book-chapter","created":{"date-parts":[[2020,6,15]],"date-time":"2020-06-15T19:03:45Z","timestamp":1592247825000},"page":"187-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":42,"title":["Embedding Algorithms for Quantum Annealers with Chimera and Pegasus Connection Topologies"],"prefix":"10.1007","author":[{"given":"Stefanie","family":"Zbinden","sequence":"first","affiliation":[]},{"given":"Andreas","family":"B\u00e4rtschi","sequence":"additional","affiliation":[]},{"given":"Hristo","family":"Djidjev","sequence":"additional","affiliation":[]},{"given":"Stephan","family":"Eidenbenz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,15]]},"reference":[{"issue":"50","key":"10_CR1","doi-asserted-by":"publisher","first-page":"7018","DOI":"10.1016\/j.tcs.2011.09.015","volume":"412","author":"I Adler","year":"2011","unstructured":"Adler, I., Dorn, F., Fomin, F.V., Sau, I., Thilikos, D.M.: Faster parameterized algorithms for minor containment. Theor. Comput. Sci. 412(50), 7018\u20137028 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.09.015","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10_CR2","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1137\/S0097539705447323","volume":"37","author":"D Aharonov","year":"2007","unstructured":"Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., Regev, O.: Adiabatic quantum computation is equivalent to standard quantum computation. SIAM J. Comput. 37(1), 166\u2013194 (2007). https:\/\/doi.org\/10.1137\/S0097539705447323","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.L.: Statistical mechanics of complex networks. Rev. Modern Phys. 74(1), 47\u201397 (2002). https:\/\/doi.org\/10.1103\/RevModPhys.74.47","journal-title":"Rev. Modern Phys."},{"issue":"5439","key":"10_CR4","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"AL Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science 286(5439), 509\u2013512 (1999). https:\/\/doi.org\/10.1126\/science.286.5439.509","journal-title":"Science"},{"key":"10_CR5","unstructured":"Boothby, K., Bunyk, P., Raymond, J., Roy, A.: Next-generation topology of d-wave quantum processors. Technical Report 14\u20131026A-C, D-Wave Systems (2019). https:\/\/www.dwavesys.com\/resources\/publications?type=white"},{"issue":"1","key":"10_CR6","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s11128-015-1150-6","volume":"15","author":"T Boothby","year":"2015","unstructured":"Boothby, T., King, A.D., Roy, A.: Fast clique minor generation in Chimera qubit connectivity graphs. Quantum Inf. Process. 15(1), 495\u2013508 (2015). https:\/\/doi.org\/10.1007\/s11128-015-1150-6","journal-title":"Quantum Inf. Process."},{"issue":"4","key":"10_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TASC.2014.2318294","volume":"24","author":"PI Bunyk","year":"2014","unstructured":"Bunyk, P.I., et al.: Architectural considerations in the design of a superconducting quantum annealing processor. IEEE Trans. Appl. Superconductivity 24(4), 1\u201310 (2014). https:\/\/doi.org\/10.1109\/TASC.2014.2318294","journal-title":"IEEE Trans. Appl. Superconductivity"},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"B\u00e4rtschi, A., Eidenbenz, S.: Deterministic preparation of dicke states. In: Fundamentals of Computation Theory, pp. 126\u2013139. FCT 2019 (2019). https:\/\/doi.org\/10.1007\/978-3-030-25027-0_9","DOI":"10.1007\/978-3-030-25027-0_9"},{"key":"10_CR9","unstructured":"Cai, J., Macready, W.G., Roy, A.: A practical heuristic for finding graph minors. https:\/\/arxiv.org\/abs\/1406.2741 (2014)"},{"issue":"5","key":"10_CR10","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s11128-008-0082-9","volume":"7","author":"V Choi","year":"2008","unstructured":"Choi, V.: Minor-embedding in adiabatic quantum computation: I. The parameter setting problem. Quantum Inf. Process. 7(5), 193\u2013209 (2008). https:\/\/doi.org\/10.1007\/s11128-008-0082-9","journal-title":"Quantum Inf. Process."},{"issue":"3","key":"10_CR11","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s11128-010-0200-3","volume":"10","author":"V Choi","year":"2011","unstructured":"Choi, V.: Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design. Quantum Inf. Process. 10(3), 343\u2013353 (2011). https:\/\/doi.org\/10.1007\/s11128-010-0200-3","journal-title":"Quantum Inf. Process."},{"key":"10_CR12","doi-asserted-by":"publisher","unstructured":"Cowtan, A., Dilkes, S., Duncan, R., Krajenbrink, A., Simmons, W., Sivarajah, S.: On the qubit routing problem. In: 14th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2019, pp. 5:1\u20135:32 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.TQC.2019.5","DOI":"10.4230\/LIPIcs.TQC.2019.5"},{"key":"10_CR13","unstructured":"D-Wave Systems: minorminer. https:\/\/github.com\/dwavesystems\/minorminer (2017), a heuristic tool for minor embedding"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On random graphs I. Publicationes Mathematicae 6, 290\u2013297 (1959). https:\/\/www.renyi.hu\/~p_erdos\/1959-11.pdf","DOI":"10.5486\/PMD.1959.6.3-4.12"},{"key":"10_CR15","unstructured":"Farhi, E., Goldstone, J., Gutmann, S., Sipser, M.: Quantum Computation by Adiabatic Evolution. https:\/\/arxiv.org\/abs\/quant-ph\/0001106 (2000)"},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Software: Practice and Experience 21(11), 1129\u20131164 (1991). https:\/\/doi.org\/10.1002\/spe.4380211102","DOI":"10.1002\/spe.4380211102"},{"key":"10_CR17","doi-asserted-by":"publisher","unstructured":"Garrett, C.K.: The Darwin Cluster. Technical Report, LA-UR-18-25080, Los Alamos National Laboratory (2018). https:\/\/doi.org\/10.2172\/1441285","DOI":"10.2172\/1441285"},{"issue":"4","key":"10_CR18","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1214\/aoms\/1177706098","volume":"30","author":"EN Gilbert","year":"1959","unstructured":"Gilbert, E.N.: Random graphs. Ann. Math. Stat. 30(4), 1141\u20131144 (1959). https:\/\/doi.org\/10.1214\/aoms\/1177706098","journal-title":"Ann. Math. Stat."},{"issue":"5","key":"10_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-018-1863-4","volume":"17","author":"TD Goodrich","year":"2018","unstructured":"Goodrich, T.D., Sullivan, B.D., Humble, T.S.: Optimizing adiabatic quantum program compilation using a graph-theoretic framework. Quantum Inf. Process. 17(5), 1\u201326 (2018). https:\/\/doi.org\/10.1007\/s11128-018-1863-4","journal-title":"Quantum Inf. Process."},{"issue":"6398","key":"10_CR20","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1126\/science.aat2025","volume":"361","author":"R Harris","year":"2018","unstructured":"Harris, R., et al.: Phase transitions in a programmable quantum spin glass simulator. Science 361(6398), 162\u2013165 (2018). https:\/\/doi.org\/10.1126\/science.aat2025","journal-title":"Science"},{"key":"10_CR21","doi-asserted-by":"publisher","unstructured":"Karp, R.M.: Reducibility among Combinatorial Problems, pp. 85\u2013103. Springer, US (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"10_CR22","doi-asserted-by":"publisher","unstructured":"Kim, J.H., Vu, V.H.: Generating random regular graphs. In: 35th ACM Symposium on Theory of Computing, pp. 213\u2013222. STOC 2003 (2003). https:\/\/doi.org\/10.1145\/780542.780576","DOI":"10.1145\/780542.780576"},{"issue":"7719","key":"10_CR23","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1038\/s41586-018-0410-x","volume":"560","author":"AD King","year":"2018","unstructured":"King, A.D., et al.: Observation of topological phenomena in a programmable lattice of 1,800 qubits. Nature 560(7719), 456\u2013460 (2018). https:\/\/doi.org\/10.1038\/s41586-018-0410-x","journal-title":"Nature"},{"issue":"3","key":"10_CR24","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/s11128-013-0683-9","volume":"13","author":"C Klymko","year":"2013","unstructured":"Klymko, C., Sullivan, B.D., Humble, T.S.: Adiabatic quantum programming: minor embedding with hard faults. Quantum Inf. Process. 13(3), 709\u2013729 (2013). https:\/\/doi.org\/10.1007\/s11128-013-0683-9","journal-title":"Quantum Inf. Process."},{"issue":"1","key":"10_CR25","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0012-365X(92)90687-B","volume":"108","author":"J Matou\u0161ek","year":"1992","unstructured":"Matou\u0161ek, J., Thomas, R.: On the complexity of finding iso- and other morphisms for partial k-trees. Dis. Math. 108(1), 343\u2013364 (1992). https:\/\/doi.org\/10.1016\/0012-365X(92)90687-B","journal-title":"Dis. Math."},{"key":"10_CR26","unstructured":"O\u2019Gorman, B., Huggins, W.J., Rieffel, E.G., Whaley, K.B.: Generalized swap networks for near-term quantum computing (2019). https:\/\/arxiv.org\/abs\/1905.05118"},{"key":"10_CR27","doi-asserted-by":"publisher","unstructured":"Pelofske, E., Hahn, G., Djidjev, H.: Solving large minimum vertex cover problems on a quantum annealer. In: 16th ACM International Conference on Computing Frontiers, pp. 76\u201384. CF 2019 (2019). https:\/\/doi.org\/10.1145\/3310273.3321562","DOI":"10.1145\/3310273.3321562"},{"key":"10_CR28","unstructured":"Pinilla, J.P.: Embera (2019). https:\/\/github.com\/joseppinilla\/embera, a collection of minor-embedding methods and utilities"},{"key":"10_CR29","doi-asserted-by":"publisher","unstructured":"Pinilla, J.P., Wilton, S.J.E.: Layout-aware embedding for quantum annealing processors. In: High Performance Computing, pp. 121\u2013139. ISC 2019 (2019). https:\/\/doi.org\/10.1007\/978-3-030-20656-7_7","DOI":"10.1007\/978-3-030-20656-7_7"},{"issue":"1","key":"10_CR30","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jctb.1995.1006","volume":"63","author":"N Robertson","year":"1995","unstructured":"Robertson, N., Seymour, P.: Graph. Minors. XIII the disjoint paths problem. J. Combinatorial Theory Ser. B 63(1), 65\u2013110 (1995). https:\/\/doi.org\/10.1006\/jctb.1995.1006","journal-title":"J. Combinatorial Theory Ser. B"},{"issue":"4","key":"10_CR31","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1017\/S0963548399003867","volume":"8","author":"A Steger","year":"1999","unstructured":"Steger, A., Wormald, N.C.: Generating random regular graphs quickly. Combinatorics Probability Comput. 8(4), 377\u2013396 (1999). https:\/\/doi.org\/10.1017\/S0963548399003867","journal-title":"Combinatorics Probability Comput."},{"key":"10_CR32","doi-asserted-by":"publisher","unstructured":"Sugie, Y., et al.: Graph minors from simulated annealing for annealing machines with sparse connectivity. In: Theory and Practice of Natural Computing, pp. 111\u2013123. TPNC 2018 (2018). https:\/\/doi.org\/10.1007\/978-3-030-04070-3_9","DOI":"10.1007\/978-3-030-04070-3_9"},{"key":"10_CR33","doi-asserted-by":"publisher","unstructured":"Takemoto, T., Hayashi, M., Yoshimura, C., Yamaoka, M.: A 2x30k-Spin multichip scalable annealing processor based on a processing-in-memory approach for solving large-scale combinatorial optimization problems. In: IEEE International Solid-State Circuits Conference, pp. 52\u201354. ISSCC 2019 (2019). https:\/\/doi.org\/10.1109\/ISSCC.2019.8662517","DOI":"10.1109\/ISSCC.2019.8662517"},{"issue":"4","key":"10_CR34","doi-asserted-by":"publisher","first-page":"77","DOI":"10.3390\/a12040077","volume":"12","author":"T Vyskocil","year":"2019","unstructured":"Vyskocil, T., Djidjev, H.: Embedding equality constraints of optimization problems into a quantum annealer. Algorithms 12(4), 77 (2019). https:\/\/doi.org\/10.3390\/a12040077","journal-title":"Algorithms"},{"key":"10_CR35","doi-asserted-by":"publisher","unstructured":"Wille, R., Burgholzer, L., Zulehner, A.: Mapping quantum circuits to IBM QX architectures using the minimal number of SWAP and H Operations. In: 56th Annual Design Automation Conference 2019, DAC 2019, p. 142 (2019). https:\/\/doi.org\/10.1145\/3316781.3317859","DOI":"10.1145\/3316781.3317859"},{"issue":"1","key":"10_CR36","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1109\/JSSC.2015.2498601","volume":"51","author":"M Yamaoka","year":"2016","unstructured":"Yamaoka, M., Yoshimura, C., Hayashi, M., Okuyama, T., Aoki, H., Mizuno, H.: A 20k-spin ising chip to solve combinatorial optimization problems with CMOS annealing. IEEE J. Solid-State Circ. 51(1), 303\u2013309 (2016). https:\/\/doi.org\/10.1109\/JSSC.2015.2498601","journal-title":"IEEE J. Solid-State Circ."},{"issue":"5","key":"10_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-017-1569-z","volume":"16","author":"A Zaribafiyan","year":"2017","unstructured":"Zaribafiyan, A., Marchand, D.J.J., Changiz Rezaei, S.S.: Systematic and deterministic graph minor embedding for Cartesian products of graphs. Quantum Inf. Process. 16(5), 1\u201326 (2017). https:\/\/doi.org\/10.1007\/s11128-017-1569-z","journal-title":"Quantum Inf. Process."}],"container-title":["Lecture Notes in Computer Science","High Performance Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50743-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,18]],"date-time":"2023-12-18T20:03:16Z","timestamp":1702929796000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-50743-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030507428","9783030507435"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50743-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"15 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISC High Performance","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on High Performance Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Frankfurt am Main","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"supercomputing2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.isc-hpc.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Linklings","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"87","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":"27","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":"31% - 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.73","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":"4.33","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}