{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T20:47:20Z","timestamp":1790801240640,"version":"4.1.0"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,12,14]],"date-time":"2014-12-14T00:00:00Z","timestamp":1418515200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s11128-014-0892-x","type":"journal-article","created":{"date-parts":[[2014,12,13]],"date-time":"2014-12-13T10:02:55Z","timestamp":1418464975000},"page":"1-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":173,"title":["A case study in programming a quantum annealer for hard operational planning problems"],"prefix":"10.1007","volume":"14","author":[{"given":"Eleanor G.","family":"Rieffel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Davide","family":"Venturelli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bryan","family":"O\u2019Gorman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Minh B.","family":"Do","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elicia M.","family":"Prystay","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vadim N.","family":"Smelyanskiy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,12,14]]},"reference":[{"key":"892_CR1","volume-title":"A Gentle Introduction to Quantum Computing","author":"EG Rieffel","year":"2011","unstructured":"Rieffel, E.G., Polak, W.: A Gentle Introduction to Quantum Computing. MIT Press, Cambridge, MA (2011)"},{"key":"892_CR2","volume-title":"Quantum Computing and Quantum Information","author":"M Nielsen","year":"2001","unstructured":"Nielsen, M., Chuang, I.L.: Quantum Computing and Quantum Information. Cambridge University Press, Cambridge (2001)"},{"key":"892_CR3","unstructured":"Farhi, E., Goldstone, J., Gutmann, S., Sipser, M.: Quantum computation by adiabatic evolution. arXiv:quant-ph\/0001106 (2000)"},{"key":"892_CR4","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1103\/RevModPhys.80.1061","volume":"80","author":"A Das","year":"2008","unstructured":"Das, A., Chakrabarti, B.K.: Colloquium: quantum annealing and analog quantum computation. Rev. Mod. Phys. 80, 1061 (2008)","journal-title":"Rev. Mod. Phys."},{"key":"892_CR5","unstructured":"Smelyanskiy, V.N., Rieffel, E.G., Knysh, S.I., Williams, C.P., Johnson, M.W., Thom, M.C., Macready, W.G., Pudenz, K.L.: A near-term quantum computing approach for hard computational problems in space exploration. arXiv:1204.2821 (2012)"},{"issue":"7346","key":"892_CR6","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1038\/nature10012","volume":"473","author":"M Johnson","year":"2011","unstructured":"Johnson, M., Amin, M., Gildert, S., Lanting, T., Hamze, F., Dickson, N., Harris, R., Berkley, A., Johansson, J., Bunyk, P., et al.: Quantum annealing with manufactured spins. Nature 473(7346), 194 (2011)","journal-title":"Nature"},{"key":"892_CR7","doi-asserted-by":"crossref","unstructured":"Boixo, S., Albash, T., Spedalieri, F.M., Chancellor, N., Lidar, D.A.: Experimental signature of programmable quantum annealing. Nat. Commun. (2013). doi: 10.1038\/ncomms3067","DOI":"10.1038\/ncomms3067"},{"key":"892_CR8","doi-asserted-by":"crossref","unstructured":"Smolin, J.A., Smith, G.: Classical signature of quantum annealing. arXiv:1305.4904 (2013)","DOI":"10.3389\/fphy.2014.00052"},{"key":"892_CR9","unstructured":"Wang, L., R\u00f8nnow, T.F., Boixo, S., Isakov, S.V., Wang, Z., Wecker, D., Lidar, D.A., Martinis, J.M., Troyer, M.: Comment on \u201cClassical signature of quantum annealing\u201d. arXiv:1305.5837 (2013)"},{"issue":"3","key":"892_CR10","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1038\/nphys2900","volume":"10","author":"S Boixo","year":"2014","unstructured":"Boixo, S., R\u00f8nnow, T.F., Isakov, S.V., Wang, Z., Wecker, D., Lidar, D.A., Martinis, J.M., Troyer, M.: Evidence for quantum annealing with more than one hundred qubits. Nat. Phys. 10(3), 218 (2014)","journal-title":"Nat. Phys."},{"key":"892_CR11","unstructured":"Shin, S.W., Smith, G., Smolin, J.A., Vazirani, U.: How \u201cquantum\u201d is the D-Wave machine? arXiv:1401.7087 (2014)"},{"key":"892_CR12","unstructured":"Vinci, W., Albash, T., Mishra, A., Warburton, P.A., Lidar, D.A.: Distinguishing classical and quantum models for the D-Wave device. arXiv:1403.4228 (2014)"},{"key":"892_CR13","unstructured":"Shin, S.W., Smith, G., Smolin, J.A., Vazirani, U.: Comment on \u201cDistinguishing classical and quantum models for the D-Wave device\u201d. arXiv:1404.6499 (2014)"},{"key":"892_CR14","doi-asserted-by":"crossref","unstructured":"Rieffel, E.G., Venturelli, D., Hen, I., Do, M., Frank, J.: Parametrized families of hard planning problems from phase transitions. In: Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (AAAI-14), pp. 2337\u20132343,(2014)","DOI":"10.1609\/aaai.v28i1.9044"},{"key":"892_CR15","first-page":"27005","volume":"1","author":"Z Wang","year":"2013","unstructured":"Wang, Z., Boixo, S., Albash, T., Lidar, D.: Benchmarking the D-Wave adiabatic quantum optimizer via 2D-Ising spin glasses. APS Meeting Abstr. 1, 27005 (2013)","journal-title":"APS Meeting Abstr."},{"key":"892_CR16","doi-asserted-by":"crossref","unstructured":"R\u00f8nnow, T.F., Wang, Z., Job, J., Boixo, S., Isakov, S.V., Wecker,D., Martinis, J.M., Lidar, D.A., Troyer, M.: Defining and detectingquantum speedup. Science 345(6195), 420 (2014)","DOI":"10.1126\/science.1252319"},{"key":"892_CR17","unstructured":"Wang, Z., Job, J., Troyer, M., Lidar, D.A. et al.: Performance of quantum annealing on random Ising problems implemented using the D-wave two. Bull. Am. Phys. Soc. (2014)"},{"key":"892_CR18","doi-asserted-by":"crossref","unstructured":"Venturelli, D., Mandra, S., Knysh, S., OGorman, B., Biswas, R., Smelyanskiy, V.: Quantum optimization of fully-connected spin glasses. arXiv:1406.7553 (2014)","DOI":"10.1103\/PhysRevX.5.031040"},{"key":"892_CR19","doi-asserted-by":"crossref","unstructured":"Kassal, I., Whitfield, J.D., Perdomo-Ortiz, A., Yung, M.H., Aspuru-Guzik, A.: Simulating chemistry using quantum computers. arXiv:1007.2648 (2010)","DOI":"10.1146\/annurev-physchem-032210-103512"},{"key":"892_CR20","doi-asserted-by":"crossref","unstructured":"Perdomo-Ortiz, A., Dickson, N., Drew-Brook, M., Rose, G., Aspuru-Guzik, A.: Finding low-energy conformations of lattice protein models by quantum annealing. Sci. Rep. (2012). doi: 10.1038\/srep00571","DOI":"10.1038\/srep00571"},{"key":"892_CR21","unstructured":"Babbush, R., Perdomo-Ortiz, A., O\u2019Gorman, B., Macready, W., Aspuru-Guzik, A.: Construction of energy functions for lattice heteropolymer models: a case study in constraint satisfaction programming and adiabatic quantum optimization. arXiv:1211.3422 (2012)"},{"key":"892_CR22","doi-asserted-by":"crossref","unstructured":"Babbush, R., Love, P.J., Aspuru-Guzik, A.: Adiabatic quantum simulation of quantum chemistry. arXiv:1311.3967 (2013)","DOI":"10.1038\/srep06603"},{"key":"892_CR23","doi-asserted-by":"crossref","unstructured":"Perdomo-Ortiz, A., Fluegemann, J., Narasimhan, S., Smelyanskiy, V., Biswas, R.: A quantum approach to diagnosis of multiple faults in electrical power systems. In: 5th IEEE International Conference on Space Mission Challenges for Information Technology. (To appear.) (2014)","DOI":"10.1109\/SMC-IT.2014.14"},{"key":"892_CR24","doi-asserted-by":"crossref","unstructured":"O\u2019Gorman, B., Perdomo-Ortiz, A., Babbush, R., Aspuru-Guzik, A., Smelyanskiy, V.: Bayesian network structure learning using quantum annealing. Eur. Phys. J. Spec. Top. arXiv:1407.3897 (2014)","DOI":"10.1140\/epjst\/e2015-02349-9"},{"key":"892_CR25","unstructured":"Perdomo-Ortiz, A., Fluegemann, J., Narasimhan, S., Biswas, R., Smelyanskiy, V.: Programming and solving real-world applications on a quantum annealing device. arXiv:1406.7601 (2014)"},{"issue":"3","key":"892_CR26","first-page":"189","volume":"2","author":"RE Fikes","year":"1972","unstructured":"Fikes, R.E., Nilsson, N.J.: STRIPS: a new approach to the application of theorem proving to problem solving. Artif. Intell. 2(3), 189 (1972)","journal-title":"Artif. Intell."},{"key":"892_CR27","volume-title":"Automated Planning: Theory and Practice","author":"M Ghallab","year":"2004","unstructured":"Ghallab, M., Nau, D., Traverso, P.: Automated Planning: Theory and Practice. Elsevier, Amsterdam (2004)"},{"key":"892_CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1026044009832","volume":"20","author":"D Long","year":"2003","unstructured":"Long, D., Fox, M.: PDDL2. 1: an extension to PDDL for expressing temporal planning domains. J. Artif. Intell. Res. 20, 1 (2003)","journal-title":"J. Artif. Intell. Res."},{"key":"892_CR29","unstructured":"Helmert, M.: Complexity results for standard benchmark domains in planning. Artifi. Intell. J. 143(2), 219\u2013262 (2003)"},{"key":"892_CR30","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1613\/jair.1747","volume":"24","author":"J Hoffmann","year":"2005","unstructured":"Hoffmann, J.: Local search topology in planning benchmarks: an empirical analysis. J. Artif. Intell. Res. 24, 685 (2005)","journal-title":"J. Artif. Intell. Res."},{"issue":"1","key":"892_CR31","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0012-365X(83)90021-3","volume":"43","author":"J Koml\u00f3s","year":"1983","unstructured":"Koml\u00f3s, J., Szemer\u00e9di, E.: Limit distribution for the existence of Hamiltonian cycles in a random graph. Discrete Math. 43(1), 55 (1983)","journal-title":"Discrete Math."},{"key":"892_CR32","unstructured":"Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the really hard problems are. IJCAI 91, 331\u2013337 (1991)"},{"key":"892_CR33","doi-asserted-by":"crossref","unstructured":"Chien, S., Johnston, M., Frank, J., Giuliano, M., Kavelaars, A., Lenzen, C., Policella, N., Verfailie, G.: A generalized timeline representation, services, and interface for automating space mission operations. In: 12th International Conference on Space Operations (2012)","DOI":"10.2514\/6.2012-1275459"},{"issue":"1","key":"892_CR34","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1002\/(SICI)1098-2418(1999010)14:1<63::AID-RSA3>3.0.CO;2-7","volume":"14","author":"D Achlioptas","year":"1999","unstructured":"Achlioptas, D., Friedgut, E.: A sharp threshold for k-colorability. Random Struct. Algorithm. 14(1), 63 (1999)","journal-title":"Random Struct. Algorithm."},{"key":"892_CR35","doi-asserted-by":"crossref","unstructured":"Coja-Oghlan, A.: Upper-bounding the k-colorability threshold by counting covers. arXiv:1305.0177 (2013)","DOI":"10.1109\/FOCS.2013.48"},{"issue":"2","key":"892_CR36","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1016\/S0022-0000(03)00120-X","volume":"67","author":"D Achlioptas","year":"2003","unstructured":"Achlioptas, D., Moore, C.: Almost all graphs with average degree 4 are 3-colorable. J. Comput. Syst. Sci. 67(2), 441 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"892_CR37","unstructured":"Dubois, O., Mandler, J.: On the non-3-colourability of random graphs. arXiv:math\/0209087 (2002)"},{"key":"892_CR38","unstructured":"Culberson, J., Beacham, A., Papp, D.: Hiding our colors. In: Proceedings of the CP95 Workshop on Studying and Solving Really Hard Problems, pp. 31\u201342, (1995)"},{"issue":"5","key":"892_CR39","doi-asserted-by":"crossref","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: II. Minor-universal graph design. Quantum Inf. Process. 7(5), 193 (2008)","journal-title":"Quantum Inf. Process."},{"key":"892_CR40","doi-asserted-by":"crossref","unstructured":"Lucas, A.: Ising formulations of many NP problems. arXiv:1302.5843 (2013)","DOI":"10.3389\/fphy.2014.00005"},{"key":"892_CR41","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0004-3702(96)00047-1","volume":"90","author":"A Blum","year":"1997","unstructured":"Blum, A., Furst, M.: Fast planning through planning graph analysis. Artif. Intell. J. 90, 281 (1997)","journal-title":"Artif. Intell. J."},{"key":"892_CR42","unstructured":"Kautz, H.: Working Notes on the Fourth International Planning Competition (IPC-2004) pp. 44\u201345 (2004)"},{"issue":"1","key":"892_CR43","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0166-218X(01)00341-9","volume":"123","author":"E Boros","year":"2002","unstructured":"Boros, E., Hammer, P.L.: Pseudo-boolean optimization. Discrete Appl. Math. 123(1), 155 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"10\u201311","key":"892_CR44","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1002\/andp.201300120","volume":"525","author":"R Babbush","year":"2013","unstructured":"Babbush, R., O\u2019Gorman, B., Aspuru-Guzik, A.: Resource efficient gadgets for compiling adiabatic quantum optimization problems. Ann. Phys. 525(10\u201311), 877 (2013)","journal-title":"Ann. Phys."},{"issue":"3","key":"892_CR45","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1007\/s11128-013-0683-9","volume":"13","author":"C Klymko","year":"2014","unstructured":"Klymko, C., Sullivan, B.D., Humble, T.S.: Adiabatic quantum programming: minor embedding with hard faults. Quantum Inf. Process. 13(3), 709 (2014)","journal-title":"Quantum Inf. Process."},{"key":"892_CR46","unstructured":"Cai, J., Macready, B., Roy, A.: A practical heuristic for finding graph minors. arXiv:1406.2741 (2014)"},{"key":"892_CR47","doi-asserted-by":"crossref","unstructured":"Pudenz, K.L., Albash, T., Lidar, D.A.: Error-corrected quantum annealing with hundreds of qubits. Nat. Commun. (2014). doi: 10.1038\/ncomms4243","DOI":"10.1038\/ncomms4243"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-014-0892-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-014-0892-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-014-0892-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,30]],"date-time":"2023-07-30T17:26:28Z","timestamp":1690737988000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-014-0892-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,14]]},"references-count":47,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["892"],"URL":"https:\/\/doi.org\/10.1007\/s11128-014-0892-x","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,14]]}}}