{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T00:48:13Z","timestamp":1772758093937,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2018,5,3]],"date-time":"2018-05-03T00:00:00Z","timestamp":1525305600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sign Process Syst"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s11265-018-1357-8","type":"journal-article","created":{"date-parts":[[2018,5,3]],"date-time":"2018-05-03T04:48:49Z","timestamp":1525322929000},"page":"363-377","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":50,"title":["Finding Maximum Cliques on the D-Wave Quantum Annealer"],"prefix":"10.1007","volume":"91","author":[{"given":"Guillaume","family":"Chapuis","sequence":"first","affiliation":[]},{"given":"Hristo","family":"Djidjev","sequence":"additional","affiliation":[]},{"given":"Georg","family":"Hahn","sequence":"additional","affiliation":[]},{"given":"Guillaume","family":"Rizk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,3]]},"reference":[{"key":"1357_CR1","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1137\/0215075","volume":"15","author":"E Balas","year":"1986","unstructured":"Balas, E., & Yu, C. (1986). Finding a maximum clique in an arbitrary graph. SIAM Journal of Comparative, 15, 1054\u20131068.","journal-title":"SIAM Journal of Comparative"},{"issue":"2","key":"1357_CR2","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s11634-010-0079-y","volume":"5","author":"V Batagelj","year":"2011","unstructured":"Batagelj, V., & Zaversnik, M. (2011). An o(m) algorithm for cores decomposition of networks. Adv Dat An Class, 5(2), 129\u2013145.","journal-title":"Adv Dat An Class"},{"issue":"1","key":"1357_CR3","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s11128-015-1150-6","volume":"15","author":"T Boothby","year":"2016","unstructured":"Boothby, T., King, A., Roy, A. (2016). Fast clique minor generation in Chimera qubit connectivity graphs. Quantum Information Processing, 15(1), 495\u2013508.","journal-title":"Quantum Information Processing"},{"key":"1357_CR4","first-page":"1","volume":"10-2006","author":"E Boros","year":"2006","unstructured":"Boros, E., Hammer, P., Tavares, G. (2006). Preprocessing of Unconstrained Quadratic Binary Optimization. Rutcor Research Report RRR, 10-2006, 1\u201358.","journal-title":"Rutcor Research Report RRR"},{"issue":"4","key":"1357_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TASC.2014.2318294","volume":"24","author":"P Bunyk","year":"2014","unstructured":"Bunyk, P., Hoskinson, E., Johnson, M., Tolkacheva, E., Altomare, F., Berkley, A., Harris, R., Hilton, J., Lanting, T., Przybysz, A., Whittaker, J. (2014). Architectural considerations in the design of a superconducting quantum annealing processor. IEEE Trans on Appl Superconductivity, 24(4), 1\u201310.","journal-title":"IEEE Trans on Appl Superconductivity"},{"issue":"33957","key":"1357_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/srep33957","volume":"6","author":"Y Cao","year":"2016","unstructured":"Cao, Y., Jiang, S., Perouli, D., Kais, S. (2016). Solving Set Cover with Pairs Problem using Quantum Annealing. Nature Scientific Reports, 6(33957), 1\u201315. https:\/\/doi.org\/10.1038\/srep33957 .","journal-title":"Nature Scientific Reports"},{"key":"1357_CR7","unstructured":"Chapuis, G., Djidjev, H., Hahn, G., Rizk, G. (2017). Finding maximum cliques on the d-wave quantum annealer. Proceedings of the 2017 ACM International Conference on Computing Frontiers (CF\u201917), 1\u20138."},{"key":"1357_CR8","unstructured":"Coffrin, C., Nagarajan, H., Bent, R. (2017). Challenges and successes of solving binary quadratic programming benchmarks on the dw2x qpu. Los Alamos ANSI debrief, 1\u201384."},{"key":"1357_CR9","unstructured":"D-Wave. (2016). D-Wave post-processing guide."},{"key":"1357_CR10","unstructured":"D-Wave. (2016). Introduction to the D-Wave quantum hardware."},{"issue":"031","key":"1357_CR11","first-page":"015","volume":"6","author":"V Denchev","year":"2016","unstructured":"Denchev, V., Boixo, S., Isakov, S., Ding, N., Babbush, R., Smelyanskiy, V., Martinis, J., Neven, H. (2016). What is the computational value of finite-range tunneling? Physical Review X, 6(031), 015.","journal-title":"Physical Review X"},{"issue":"1","key":"1357_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.31703\/gpr.2016(I-I).01","volume":"1","author":"H Djidjev","year":"2016","unstructured":"Djidjev, H., Hahn, G., Mniszewski, S., Negre, C., Niklasson, A., Sardeshmukh, V. (2016). Graph partitioning methods for fast parallel quantum molecular dynamics. CSC 2016, 1(1), 1\u201317.","journal-title":"CSC 2016"},{"key":"1357_CR13","unstructured":"Dridi, R., & Alghassi, H. (2016). Homology computation of large point clouds using quantum annealing. arXiv: 1512.09328 , 1\u201317."},{"issue":"22","key":"1357_CR14","doi-asserted-by":"publisher","first-page":"5064","DOI":"10.1016\/j.ins.2007.06.009","volume":"177","author":"X Geng","year":"2007","unstructured":"Geng, X., Xu, J., Xiao, J., Pan, L. (2007). A simple simulated annealing algorithm for the maximum clique problem. Information Science, 177(22), 5064\u20135071.","journal-title":"Information Science"},{"key":"1357_CR15","unstructured":"Gurobi Optimization, Inc. (2015). Gurobi optimizer reference manual. http:\/\/www.gurobi.com ."},{"key":"1357_CR16","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF01096415","volume":"3","author":"J Hasselberg","year":"1993","unstructured":"Hasselberg, J., Pardalos, P., Vairaktarakis, G. (1993). Test Case Generators and Computational Results for the Maximum Clique Problem. Journal of Global Optimization, 3, 463\u2013482.","journal-title":"Journal of Global Optimization"},{"key":"1357_CR17","doi-asserted-by":"crossref","unstructured":"Johnson, D.S., & Trick, M.A. (Eds.). (1996). Clique, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, DIMACS, Vol. 26. Providence: American Mathematical Society. http:\/\/dimacs.rutgers.edu\/Volumes\/Vol26.html .","DOI":"10.1090\/dimacs\/026"},{"key":"1357_CR18","doi-asserted-by":"publisher","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., Chapple, E., Enderud, C., Hilton, J., Karimi, K., Ladizinsky, E., Ladizinsky, N., Oh, T., Perminov, I., Rich, C., Thom, M., Tolkacheva, E., Truncik, C., Uchaikin, S., Wang, J., Wilson, B., Rose, G. (2011). Quantum annealing with manufactured spins. Nature, 473, 194\u2013198.","journal-title":"Nature"},{"key":"1357_CR19","unstructured":"Kim, S.H., Kim, Y.H., Moon, B.R. (2001). A Hybrid Genetic Algorithm for the MAX CUT Problem. Proceeding GECCO\u201901 Proceedings of the 3rd Annual Conference on Genetic and Evolutionary Computation, 416\u2013423."},{"key":"1357_CR20","unstructured":"King, J., Yarkoni, S., Nevisi, M., Hilton, J., McGeoch, C. (2015). Benchmarking a quantum annealing processor with the time-to-target metric. arXiv: 1508.05087 , 1\u201329."},{"issue":"5","key":"1357_CR21","first-page":"1","volume":"2","author":"A Lucas","year":"2014","unstructured":"Lucas, A. (2014). Ising formulations of many np problems. Frontiers in Physics, 2(5), 1\u201327.","journal-title":"Frontiers in Physics"},{"key":"1357_CR22","doi-asserted-by":"crossref","unstructured":"Mniszewski, S., Negre, C., Ushijima-Mwesigwa, H. (2016). Graph Partitioning using the D-Wave for Electronic Structure Problems. LA-UR-16-27873, 1\u201321.","DOI":"10.2172\/1330055"},{"key":"1357_CR23","doi-asserted-by":"crossref","unstructured":"Neukart, F., Von Dollen, D., Compostella, G., Seidel, C., Yarkoni, S., Parney, B. (2017). Traffic flow optimization using a quantum annealer. arXiv: 1708.01625 , 1\u201312.","DOI":"10.3389\/fict.2017.00029"},{"key":"1357_CR24","unstructured":"Nguyen, N., & Kenyon, G. (2017). Solving sparse representations for object classification using the quantum d-wave 2x machine. Los Alamos ISTI debrief, 1\u201330."},{"key":"1357_CR25","unstructured":"Pattabiraman, B., Patwary, M., Gebremedhin, A., Liao, W.K., Choudhary, A. (2013). Fast algorithms for the maximum clique problem on massive sparse graphs. In International Workshop on Algorithms and Models for the Web-Graph (pp. 156\u2013169): Springer."},{"key":"1357_CR26","unstructured":"Perdomo-Ortiz, A., Feldman, A., Ozaeta, A., Isakov, S., Zhu, Z., O\u2019Gorman, B., Katzgraber, H., Diedrich, A., Neven, H., de Kleer, J., Lackey, B., Biswas, R. (2017). On the readiness of quantum optimization machines for industrial applications. arXiv: 1708.09780 , 1\u201322."},{"key":"1357_CR27","unstructured":"Rogers, M., & Singleton, R. (2016). Ising Simulations on the D-Wave QPU. LA-UR-16-27649, 1\u201314."},{"key":"1357_CR28","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1126\/science.1252319","volume":"345","author":"T R\u00f8nnow","year":"2014","unstructured":"R\u00f8nnow, T., Wang, Z., Job, J., Boixo, S., Isakov, S., Wecker, D., Martinis, J., Lidar, D., Troyer, M. (2014). Defining and detecting quantum speedup. Science, 345, 420\u2013424.","journal-title":"Science"},{"key":"1357_CR29","unstructured":"Rossi, R., Gleich, D., Gebremedhin, A., Patwary, M. (2013). A fast parallel maximum clique algorithm for large sparse graphs and temporal strong components. CoRR, arXiv: 1302.6256 ."},{"key":"1357_CR30","volume-title":"Discrete optimisation problems on an adiabatic quantum computer","author":"T Stollenwerk","year":"2015","unstructured":"Stollenwerk, T., Lobe, E., Tr\u00f6ltzsch, A. (2015). Discrete optimisation problems on an adiabatic quantum computer. London: 17th British-French-German Conference on Optimization."},{"key":"1357_CR31","doi-asserted-by":"crossref","unstructured":"Thulasidasan, S. (2016). Generative Modeling for Machine Learning on the D-Wave. LA-UR-16-28813, 1\u201323.","DOI":"10.2172\/1332219"},{"key":"1357_CR32","unstructured":"Trummer, I., & Koch, C. (2015). Multiple Query Optimization on the D-Wave 2X adiabatic Quantum Computer. arXiv: 1510.06437 , 1\u201312."},{"key":"1357_CR33","doi-asserted-by":"crossref","unstructured":"Ushijima-Mwesigwa, H., Negre, C., Mniszewski, S. (2017). Graph Partitioning using Quantum Annealing on the D-Wave System. arXiv: 1705.03082 , 1\u201320.","DOI":"10.1145\/3149526.3149531"},{"issue":"25797","key":"1357_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/srep25797","volume":"6","author":"C Wang","year":"2016","unstructured":"Wang, C., Chen, H., Jonckheere, E. (2016). Quantum versus simulated annealing in wireless interference network optimization. Nature Scientific Reports, 6(25797), 1\u20139. https:\/\/doi.org\/10.1038\/srep25797 .","journal-title":"Nature Scientific Reports"}],"container-title":["Journal of Signal Processing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11265-018-1357-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-018-1357-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-018-1357-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,1]],"date-time":"2020-11-01T13:15:09Z","timestamp":1604236509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11265-018-1357-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,3]]},"references-count":34,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["1357"],"URL":"https:\/\/doi.org\/10.1007\/s11265-018-1357-8","relation":{},"ISSN":["1939-8018","1939-8115"],"issn-type":[{"value":"1939-8018","type":"print"},{"value":"1939-8115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,3]]},"assertion":[{"value":"21 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 March 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}