{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T15:51:44Z","timestamp":1778255504832,"version":"3.51.4"},"reference-count":78,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T00:00:00Z","timestamp":1574726400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T00:00:00Z","timestamp":1574726400000},"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":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s10288-019-00424-y","type":"journal-article","created":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T11:03:08Z","timestamp":1574766188000},"page":"335-371","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":227,"title":["Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6945-0438","authenticated-orcid":false,"given":"Fred","family":"Glover","sequence":"first","affiliation":[]},{"given":"Gary","family":"Kochenberger","sequence":"additional","affiliation":[]},{"given":"Yu","family":"Du","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,26]]},"reference":[{"issue":"5","key":"424_CR1","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/1411509.1411513","volume":"55","author":"N Ailon","year":"2008","unstructured":"Ailon N, Charikar M, Newman A (2008) Aggregating inconsistent information: ranking and clustering. J ACM (JACM) 55(5):23","journal-title":"J ACM (JACM)"},{"key":"424_CR2","unstructured":"Aimone JB, Hamilton KE, Mniszewsk S, Reeder L, Schuman CD, Severa WM (2018) Non-neural network applications for spiking neuromorphic hardware. In: PMES workshop"},{"key":"424_CR3","doi-asserted-by":"crossref","unstructured":"Albash T, Lidar DA (2015) Decoherence in adiabatic quantum computation. Phys Rev A 91: 062320. arXiv:1503.08767v2","DOI":"10.1103\/PhysRevA.91.062320"},{"key":"424_CR4","doi-asserted-by":"crossref","unstructured":"Albash T, Hen I, Spedalieri FM, Lidar DA (2015) Reexamination of the evidence for entanglement in the D-Wave processor. Phys Rev A 92:62328. arXiv:1506.03539v2","DOI":"10.1103\/PhysRevA.92.062328"},{"issue":"2","key":"424_CR5","first-page":"135","volume":"9","author":"B Aliadee","year":"2005","unstructured":"Aliadee B, Glover F, Kochenberger G, Rego C (2005) A new modeling and solution approach for the number partitioning problem. Appl Math Decis Sci 9(2):135\u2013145","journal-title":"Appl Math Decis Sci"},{"issue":"2","key":"424_CR6","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1016\/j.ejor.2006.12.068","volume":"186","author":"B Alidaee","year":"2008","unstructured":"Alidaee B, Kochenberger G, Lewis K, Lewis M, Wang H (2008) A new approach for modeling and solving set packing problems. Eur J Oper Res 186(2):504\u2013512","journal-title":"Eur J Oper Res"},{"issue":"4","key":"424_CR7","doi-asserted-by":"publisher","first-page":"046112","DOI":"10.1103\/PhysRevE.82.046112","volume":"82","author":"D Aloise","year":"2010","unstructured":"Aloise D, Cafieri S, Caporossi G, Hansen P, Perron S, Liberti L (2010) Column generation algorithms for exact modularity maximization in networks. Phys Rev E 82(4):046112","journal-title":"Phys Rev E"},{"key":"424_CR8","doi-asserted-by":"publisher","unstructured":"Alom MZ, Van Essen B, Moody AT, Widemann DP, Taha TM (2017) Quadratic unconstrained binary optimization (QUBO) on neuromorphic computing system. In: IEEE 2017 international joint conference on neural networks (IJCNN). https:\/\/doi.org\/10.1109\/ijcnn.2017.7966350","DOI":"10.1109\/ijcnn.2017.7966350"},{"key":"424_CR9","unstructured":"Alpha-QUBO (2019). http:\/\/meta-analytics.net\/Home\/AlphaQUBO"},{"key":"424_CR10","doi-asserted-by":"crossref","unstructured":"Amin MHS, Truncik CJS, Averin DV (2008) Role of single qubit decoherence time in adiabatic quantum computation. Phys Rev A 80: 022303. arXiv:0803.1196v2","DOI":"10.1103\/PhysRevA.80.022303"},{"issue":"1\u20132","key":"424_CR11","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10107-016-1032-4","volume":"162","author":"M Anthony","year":"2017","unstructured":"Anthony M, Boros E, Crama Y, Gruber A (2017) Quadratic reformulations of nonlinear binary optimization problems. Math Program 162(1\u20132):115\u2013144","journal-title":"Math Program"},{"key":"424_CR12","doi-asserted-by":"publisher","first-page":"48","DOI":"10.3389\/fphy.2019.00048","volume":"7","author":"M Aramon","year":"2019","unstructured":"Aramon M, Rosenberger G, Valiante E, Miyazawa T, Tamura H, Katzgraber HG (2019) Physics-inspired optimization for quadratic unconstrained problems using a digital annealer. Front Phys 7:48","journal-title":"Front Phys"},{"key":"424_CR13","unstructured":"Berwald JJ, Gottlieb JM, Munch E (2018) Computing Wasserstein distance for persistence diagrams on a quantum computer. arXiv:1809.06433"},{"key":"424_CR14","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1038\/nphys2900","volume":"10","author":"S Boixo","year":"2014","unstructured":"Boixo S, R\u00f8nnow TF, Isakov SV, Wang Z, Wecker D, Lidar DA, Martinis JM, Troyer M (2014) Evidence for quantum annealing with more than one hundred qubits. Nat Phys 10:218\u2013224","journal-title":"Nat Phys"},{"issue":"3","key":"424_CR15","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF02115753","volume":"33","author":"E Boros","year":"1991","unstructured":"Boros E, Hammer P (1991) The max-cut problem and quadratic 0\u20131 optimization: polyhedral aspects, relaxations and bounds. Ann Oper Res 33(3):151\u2013180","journal-title":"Ann Oper Res"},{"issue":"1","key":"424_CR16","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(01)00341-9","volume":"123","author":"E Boros","year":"2002","unstructured":"Boros E, Hammer P (2002) Pseudo-boolean optimization. Discrete Appl Math 123(1):155\u2013225","journal-title":"Discrete Appl Math"},{"issue":"2","key":"424_CR17","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1016\/j.disopt.2007.02.001","volume":"5","author":"E Boros","year":"2008","unstructured":"Boros E, Hammer PL, Sun R, Tavares G (2008) A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO). Discrete Optim 5(2):501\u2013529","journal-title":"Discrete Optim"},{"key":"424_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/s11265-018-1357-8","author":"G Chapuis","year":"2018","unstructured":"Chapuis G, Djidjev H, Hahn G, Rizk G (2018) Finding maximum cliques on the D-wave quantum annealer. J Signal Process Syst. https:\/\/doi.org\/10.1007\/s11265-018-1357-8","journal-title":"J Signal Process Syst"},{"key":"424_CR19","doi-asserted-by":"crossref","unstructured":"Clark J, West T, Zammit J, Guo X, Mason L, Russell D (2019) Towards real time multi-robot routing using quantum computing technologies. In: HPC Asia 2019 proceedings of the international conference on high performance computing in Asia-Pacific region, pp 111\u2013119","DOI":"10.1145\/3293320.3293333"},{"key":"424_CR20","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s11128-019-2236-3","volume":"18","author":"P Date","year":"2019","unstructured":"Date P, Patton R, Schuman C, Potok T (2019) Efficiently embedding QUBO problems on adiabatic quantum computers. Quantum Inf Process 18:117. https:\/\/doi.org\/10.1007\/s11128-019-2236-3","journal-title":"Quantum Inf Process"},{"issue":"3","key":"424_CR21","first-page":"24","volume":"5","author":"EP Debenedictis","year":"2019","unstructured":"Debenedictis EP (2019) A future with quantum machine learning. IEEE Comput Edge 5(3):24\u201327","journal-title":"IEEE Comput Edge"},{"key":"424_CR22","unstructured":"Elsokkary N, Khan FS, Humble TS, Torre DL, Gottlieb J (2017) Financial portfolio management using D-wave, quantum optimizer: the case of abu dhabi securities exchange. In: 2017 IEEE high-performance extreme computing (HPEC)"},{"key":"424_CR23","unstructured":"Farhi E, Goldstone J (2014) A quantum approximate optimization algorithm. arXiv:1411.4028"},{"key":"424_CR24","unstructured":"Feld S, Roch C, Gabor T, Seidel C, Neukart F, Galter I, Mauerer W, Linnhoff-Popien C (2018) A hybrid solution method for the capacitated vehicle routing problem using a quantum annealer. arXiv:1811.07403"},{"key":"424_CR25","first-page":"1","volume-title":"Interfaces in computer science and operations research","author":"F Glover","year":"1996","unstructured":"Glover F (1996) Tabu search and adaptive memory programming\u2013advances, applications and challenges. In: Barr RS, Helgason RV, Kennington JL (eds) Interfaces in computer science and operations research. Kluwer Academic Publishers, Springer, pp 1\u201375"},{"key":"424_CR26","unstructured":"Glover F (1997) A template for scatter search and path relinking, in artificial evolution. In: Hao JK, Lutton E, Ronald E, Schoenauer M, Snyers D (eds) Lecture notes in computer science, vol 1363. Springer, pp 13\u201354"},{"key":"424_CR27","unstructured":"Glover F, Kochenberger G (2019) Quantum bridge analytics & QUBO 2.0. In: Quantum insight conference 2019, invited presentation 10\/04\/19, LHOFT\u2014Luxembourg House of Financial Technology, 9, rue du Laboratoire, Luxembourg"},{"key":"424_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F Glover","year":"1997","unstructured":"Glover F, Laguna M (1997) Tabu search. Kluwer Academic Publishers, Boston"},{"key":"424_CR29","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-1-4757-2876-7_10","volume-title":"Industrial applications of combinatorial optimization","author":"F Glover","year":"1998","unstructured":"Glover F, Mulvey J, Bai D, Tapia M (1998) Integrative population analysis for better solutions to large-scale mathematical programs. In: Yu G (ed) Industrial applications of combinatorial optimization. Kluwer Academic Publishers, Boston, pp 212\u2013237"},{"key":"424_CR30","first-page":"272","volume-title":"Combinatorial and global optimization","author":"F Glover","year":"2002","unstructured":"Glover F, Kochenberger G, Alidaee B, Amini M (2002) Solving quadratic knapsack problems by reformulation and tabu search. In: Pardalos PM, Megados A, Burkard R (eds) Combinatorial and global optimization. World Scientific Publishing Co., Singapore, pp 272\u2013287"},{"key":"424_CR31","unstructured":"Glover F, Kochenberger G, Wang Y (2018a) A new QUBO model for unsupervised machine learning. Res Prog (work in progress)"},{"issue":"2018","key":"424_CR32","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1016\/j.ejor.2017.08.025","volume":"265","author":"F Glover","year":"2018","unstructured":"Glover F, Lewis M, Kochenberger G (2018b) Logical and inequality implications for reducing the size and difficulty of unconstrained binary optimization problems. Eur J Oper Res 265(2018):829\u2013842","journal-title":"Eur J Oper Res"},{"key":"424_CR33","doi-asserted-by":"publisher","unstructured":"Hahn G, Djidjev H (2017) Reducing binary quadratic forms for more scalable quantum annealing. In: 2017 IEEE international conference on rebooting computing. https:\/\/doi.org\/10.1109\/ICRC.2017.8123654","DOI":"10.1109\/ICRC.2017.8123654"},{"key":"424_CR34","doi-asserted-by":"publisher","unstructured":"Hamilton K, Schuman CD, Young SR, Imam N, Humble TS (2018) Neural networks and graph alogrithms with next-generation processors. In: 2018 IEEE international parallel and distributed processing symposium workshops (IPDPSW). https:\/\/doi.org\/10.1109\/IPDPSW.2018.00184","DOI":"10.1109\/IPDPSW.2018.00184"},{"issue":"2","key":"424_CR35","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/2076450.2076469","volume":"55","author":"HH Hoos","year":"2012","unstructured":"Hoos HH (2012) Programming by optimization. Commun ACM 55(2):70\u201380","journal-title":"Commun ACM"},{"key":"424_CR36","doi-asserted-by":"crossref","unstructured":"Kalra A, Qureshi F, Tisi M (2018) Portfolio asset identification using graph algorithms on a quantum annealer. http:\/\/www.henryyuen.net\/fall2018\/projects\/qfinance.pdf","DOI":"10.2139\/ssrn.3333537"},{"key":"424_CR37","unstructured":"Kerberos (2019) The network authentication protocol. https:\/\/web.mit.edu\/kerberos\/"},{"key":"424_CR38","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/0-387-29550-X_4","volume-title":"Multiscale optimization methods and applications","author":"G Kochenberger","year":"2006","unstructured":"Kochenberger G, Glover F (2006) A unified framework for modeling and solving combinatorial optimization problems: a tutorial. In: Hager W, Huang SJ, Pardalos P, Prokopyev O (eds) Multiscale optimization methods and applications. Springer, Berlin, pp 101\u2013124"},{"issue":"1","key":"424_CR39","first-page":"89","volume":"1","author":"G Kochenberger","year":"2005","unstructured":"Kochenberger G, Glover F, Alidaee B, Lewis K (2005a) Using the unconstrained quadratic program to model and solve Max 2-Sat problems. Int J OR 1(1):89\u2013100","journal-title":"Int J OR"},{"issue":"1\u20134","key":"424_CR40","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10479-005-3449-7","volume":"139","author":"G Kochenberger","year":"2005","unstructured":"Kochenberger G, Glover F, Alidaee B, Rego C (2005b) An unconstrained quadratic binary programming approach to the vertex coloring problem. Ann OR 139(1\u20134):229\u2013241","journal-title":"Ann OR"},{"issue":"4","key":"424_CR41","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10732-011-9189-8","volume":"19","author":"G Kochenberger","year":"2013","unstructured":"Kochenberger G, Hao J-K, Lu S, Wang H, Glover F (2013) Solving large scale max cut problems via tabu search. J Heuristics 19(4):565\u2013571","journal-title":"J Heuristics"},{"issue":"1","key":"424_CR42","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s10878-014-9734-0","volume":"28","author":"G Kochenberger","year":"2014","unstructured":"Kochenberger G, Hao J-K, Glover F, Lewis M, Lu Z, Wang H, Wang Y (2014) The unconstrained binary quadratic programming problem: a survey. J Comb Optim 28(1):58\u201381","journal-title":"J Comb Optim"},{"key":"424_CR43","unstructured":"Kochenberger G, Badgett A, Chawla R, Glover F, Wang Y, Du Y (2019) Comparison of QAOA and alpha QUBO algorithms (work in progress)"},{"key":"424_CR44","doi-asserted-by":"crossref","unstructured":"Lanting AJ, Przybysz A, Smirnov Y, Spedalieri FM, Amin MH, Berkley AJ, Harris R, Altomare F, Boixo S, Bunyk P, Dickson N, Enderud C, Hilton JP, Hoskinson E, Johnson MW, Ladizinsky E, Ladizinsky N, Neufeld R, Oh T, Perminov I, Rich C, Thom MC, Tolkacheva E, Uchaikin S, Wilson AB, Rose G (2014) Entanglement in a quantum annealing processor. Phys Rev X 4:021041. arXiv:1401.3500v1","DOI":"10.1103\/PhysRevX.4.021041"},{"issue":"3","key":"424_CR45","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1016\/j.cor.2006.04.002","volume":"35","author":"M Lewis","year":"2008","unstructured":"Lewis M (2008) A new modeling and solution approach for the set partitioning problem. Comput OR 35(3):807\u2013813","journal-title":"Comput OR"},{"key":"424_CR46","doi-asserted-by":"crossref","unstructured":"Lucas A (2014) Ising formulations of many NP problems. Front Phys 5:2. arXiv:1302.5843","DOI":"10.3389\/fphy.2014.00005"},{"key":"424_CR47","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, pp 1\u201321","DOI":"10.2172\/1330055"},{"key":"424_CR48","unstructured":"Mniszewski SM, Negre CFA, Ushijima-Mwesigwa (2018) Graph clustering approaches using near term quantum computing. In: Argonne quantum computing workshop"},{"key":"424_CR49","unstructured":"Negre CFA, Ushijima-Mwesigwa H, Mniszewsk SM (2019) Detecting multiple communities using quantum annealing on the D-wave system. arXiv:1901.09756"},{"key":"424_CR50","doi-asserted-by":"crossref","unstructured":"Neukart F, Compostella G, Seidel C, Dollen D, Yarkoni S, Parney B (2017) Traffic flow optimization using a quantum annealer. arXiv:1708.01625","DOI":"10.3389\/fict.2017.00029"},{"key":"424_CR51","unstructured":"Ohzeki M, Miki A, Miyama MJ, Terabe M (2018) Control of automated guided vehicles without collision by quantum annealer and digital devices. arXiv:1812.01532"},{"issue":"8","key":"424_CR52","doi-asserted-by":"publisher","first-page":"1840007","DOI":"10.1142\/S0219749918400075","volume":"16","author":"NMD Oliveira","year":"2018","unstructured":"Oliveira NMD, Silva RMDA, Oliveira WRD (2018) QUBO formulation for the contact map overlap problem. Int J Quantum Inf 16(8):1840007","journal-title":"Int J Quantum Inf"},{"issue":"12","key":"424_CR53","doi-asserted-by":"publisher","first-page":"e0206653","DOI":"10.1371\/journal.pone.0206653","volume":"13","author":"D O\u2019Malley","year":"2018","unstructured":"O\u2019Malley D, Vesselinov VV, Alexandrov BS, Alexandrov LB (2018) Nonnegative\/binary matrix factorization with a D-Wave quantum annealer. PLoS ONE 13(12):e0206653. https:\/\/doi.org\/10.1371\/journal.pone.0206653","journal-title":"PLoS ONE"},{"key":"424_CR54","doi-asserted-by":"crossref","unstructured":"Pakin S (2017) Navigating a maze using a quantum annealer. In: Proceedings of the second international workshop on post Moores era supercomputing, pp 30\u201336","DOI":"10.1145\/3149526.3149532"},{"key":"424_CR55","unstructured":"Pakin S (2018) QMASM\u2013quantum macro assembler. https:\/\/ccsweb.lanl.gov\/~pakin\/software\/; https:\/\/github.com\/lanl\/qmasm"},{"issue":"3","key":"424_CR56","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01098364","volume":"4","author":"P Pardalos","year":"1999","unstructured":"Pardalos P, Xue J (1999) The maximum clique problem. J Glob Optim 4(3):301\u2013328","journal-title":"J Glob Optim"},{"key":"424_CR57","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-030-14082-3_11","volume-title":"Quantum Technology and Optimization Problems","author":"Elijah Pelofske","year":"2019","unstructured":"Pelofske E, Hahn G, Djidjev H (2019) Solving large Maximum Clique problems on a quantum annealer. arXiv:1901.07657"},{"key":"424_CR58","unstructured":"Preskill J (2019) Why i called it \u201cquantum supremacy, quanta magazine. https:\/\/www.quantamagazine.org\/john-preskill-explains-quantum-supremacy-20191002\/"},{"issue":"5","key":"424_CR59","doi-asserted-by":"publisher","first-page":"2027","DOI":"10.1007\/s11128-012-0506-4","volume":"12","author":"KL Pudenz","year":"2013","unstructured":"Pudenz KL, Lidar DA (2013) Quantum adiabatic machine learning. Quantum Inf Process 12(5):2027\u20132070","journal-title":"Quantum Inf Process"},{"key":"424_CR60","unstructured":"Qbsolv (2017) D-Wave initiates open quantum software environment. www.dwavesys.com\/press-releases\/d-wave-initiates-open-quantum-software-environment"},{"key":"424_CR61","unstructured":"Reedy C (2017) When will quantum computers be consumer products? Futurism. https:\/\/futurism.com\/when-will-quantum-computers-be-consumer-products"},{"key":"424_CR62","unstructured":"Reinhardt S (2018) Detecting lateral movement with a compute-intense graph kernel. http:\/\/www.clsac.org\/uploads\/5\/0\/6\/3\/50633811\/reinhardt-clsac-2018.pdf"},{"key":"424_CR63","doi-asserted-by":"crossref","unstructured":"Rodriguez-Heck E (2018) Linear ad quadratic reformulations of nonlinear optimization problems in binary variables. Ph.D. Dissertation, Liege University","DOI":"10.1007\/s10288-018-0392-4"},{"key":"424_CR64","first-page":"71","volume":"17","author":"I Rosenberg","year":"1975","unstructured":"Rosenberg I (1975) Reduction of bivalent maximization to the quadratic case. Cahiers du Centre d\u2019Etudes de Recherche Operationnelle 17:71\u201374","journal-title":"Cahiers du Centre d\u2019Etudes de Recherche Operationnelle"},{"key":"424_CR65","unstructured":"Sahner D (2018) A potential role for quantum annealing in the enhancement of patient outcomes?. https:\/\/www.dwavesys.com\/sites\/default\/files\/Sahner.2018.pdf"},{"issue":"4\u20135","key":"424_CR66","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/s10732-018-9403-z","volume":"25","author":"M Samorani","year":"2019","unstructured":"Samorani M, Wang Y, Wang Y, Lv Z, Glover F (2019) Clustering-Driven evolutionary algorithms: an application of path relinking to the quadratic unconstrained binary optimization problem. J Heuristics 25(4\u20135):629\u2013642","journal-title":"J Heuristics"},{"issue":"7087","key":"424_CR67","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1038\/nature04701","volume":"440","author":"E Schneidman","year":"2006","unstructured":"Schneidman E, Berry MJ, Segev R, Bialek W (2006) Weak pairwise correlations imply strongly correlated network states in a neural population. Nature 440(7087):1007\u20131012","journal-title":"Nature"},{"key":"424_CR68","unstructured":"Shaydulin R, Ushijima-Mwesigwa H, Safro I, Mniszewski S, Alexeev Y (2018) Community detection across emerging quantum architectures. In: PMES workshop"},{"key":"424_CR69","unstructured":"The National Academies of Sciences, Engineering and Medicine Consensus Study Report (2019) Quantum computing: progress and prospects. https:\/\/www.nap.edu\/catalog\/25196\/quantum-computing-progress-and-prospects"},{"key":"424_CR70","doi-asserted-by":"crossref","unstructured":"Ushijima-Mwesigwa H, Negre CFA, Mniszewsk SM (2017) Graph partitioning using quantum annealing on the D-wave system. arXiv:1705.03082","DOI":"10.1145\/3149526.3149531"},{"key":"424_CR71","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-019-01460-7","author":"A Verma","year":"2019","unstructured":"Verma A, Lewis M (2019) Optimal quadratic reformulations of fourth degree Pseudo-Boolean functions. Optim Lett. https:\/\/doi.org\/10.1007\/s11590-019-01460-7","journal-title":"Optim Lett"},{"key":"424_CR72","doi-asserted-by":"crossref","unstructured":"Vyskocil T, Pakin S, Djidjev HN (2019) Embedding inequality constraints for quantum annealling optimization, quantum technology and optimization problems. QTOP 2019. Lecture notes in computer science, vol 11413. Springer","DOI":"10.1007\/978-3-030-14082-3_2"},{"key":"424_CR73","unstructured":"Wang Q, Abdullah T (2018) An introduction to quantum optimization approximation algorithm. https:\/\/www.cs.umd.edu\/class\/fall2018\/cmsc657\/projects\/group_16.pdf"},{"issue":"3","key":"424_CR74","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.ejor.2012.07.012","volume":"223","author":"Y Wang","year":"2012","unstructured":"Wang Y, Lu Z, Glover F, Hao J-K (2012) Path relinking for unconstrained binary quadratic programming. Eur J Oper Res 223(3):595\u2013604","journal-title":"Eur J Oper Res"},{"issue":"4","key":"424_CR75","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/s10732-011-9164-4","volume":"19","author":"Y Wang","year":"2013","unstructured":"Wang Y, Lu Z, Glover F, Hao J-K (2013) Backbone guided tabu search for solving the UBQP problem. J Heuristics 19(4):679\u2013695","journal-title":"J Heuristics"},{"key":"424_CR76","unstructured":"Wang H, Wang Y, Resende M, Kochenberger G (2016) A QUBO approach to solving QAP problems (unpublished manuscript)"},{"issue":"11","key":"424_CR77","doi-asserted-by":"publisher","first-page":"110303","DOI":"10.1088\/0256-307X\/35\/11\/110303","volume":"35","author":"Hongye Yu","year":"2018","unstructured":"Yu H, Huang Y, Wu B (2018) Exact equivalence between quantum adiabatic algorithm and quantum circuit algorithm. arXiv: 1706.07646v3 [quant-ph], https:\/\/doi.org\/10.1088\/0256-307X\/35\/11\/110303","journal-title":"Chinese Physics Letters"},{"key":"424_CR78","unstructured":"Zhou L, Wang S, Choi S, Pichler H, Lukin MD (2018) Quantum approximate optimization algorithm: performance, mechanism, and implementation on near-term devices. arXiv:1812.01041"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-019-00424-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-019-00424-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-019-00424-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,25]],"date-time":"2020-11-25T00:28:50Z","timestamp":1606264130000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-019-00424-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,26]]},"references-count":78,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["424"],"URL":"https:\/\/doi.org\/10.1007\/s10288-019-00424-y","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,11,26]]},"assertion":[{"value":"2 November 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 November 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 November 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}