{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:27:42Z","timestamp":1743089262826,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030344993"},{"type":"electronic","value":"9783030345006"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-34500-6_16","type":"book-chapter","created":{"date-parts":[[2019,11,21]],"date-time":"2019-11-21T19:10:58Z","timestamp":1574363458000},"page":"222-233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On Post-processing the Results of Quantum Optimizers"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3055-279X","authenticated-orcid":false,"given":"Ajinkya","family":"Borle","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1473-2646","authenticated-orcid":false,"given":"Josh","family":"McCarter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,22]]},"reference":[{"key":"16_CR1","unstructured":"The d-wave post-processing documentation. \nhttps:\/\/docs.dwavesys.com\/docs\/latest"},{"key":"16_CR2","unstructured":"Adachi, S.H., Henderson, M.P.: Application of quantum annealing to training of deep neural networks. arXiv preprint \narXiv:1510.06356\n\n (2015)"},{"key":"16_CR3","unstructured":"Dorband, J.E.: Stochastic characteristics of qubits and qubit chains on the D-wave 2X. arXiv preprint \narXiv:1606.05550\n\n (2016)"},{"key":"16_CR4","unstructured":"Dorband, J.E.: A method of finding a lower energy solution to a qubo\/ising objective function. arXiv preprint \narXiv:1801.04849\n\n (2018)"},{"key":"16_CR5","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algorithm. arXiv preprint \narXiv:1411.4028\n\n (2014)"},{"key":"16_CR6","unstructured":"Farhi, E., Goldstone, J., Gutmann, S., Sipser, M.: Quantum computation by adiabatic evolution. arXiv preprint quant-ph\/0001106 (2000)"},{"key":"16_CR7","volume-title":"Statistical Mechanics: A Short Treatise","author":"G Gallavotti","year":"2013","unstructured":"Gallavotti, G.: Statistical Mechanics: A Short Treatise. Springer, Heidelberg (2013)"},{"key":"16_CR8","unstructured":"Greenwood, G.W.: Finding solutions to NP problems: philosophical differences between quantum and evolutionary search algorithms. In: Proceedings of the 2001 Congress on Evolutionary Computation, vol. 2, pp. 815\u2013822. IEEE (2001)"},{"issue":"2","key":"16_CR9","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1103\/PhysRevLett.79.325","volume":"79","author":"LK Grover","year":"1997","unstructured":"Grover, L.K.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79(2), 325 (1997)","journal-title":"Phys. Rev. Lett."},{"issue":"6398","key":"16_CR10","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)","journal-title":"Science"},{"issue":"4","key":"16_CR11","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/PL00011151","volume":"22","author":"J Houdayer","year":"2001","unstructured":"Houdayer, J.: A cluster Monte Carlo algorithm for 2-dimensional spin glasses. Eur. Phys. J. B-Condens. Matter Complex Syst. 22(4), 479\u2013484 (2001)","journal-title":"Eur. Phys. J. B-Condens. Matter Complex Syst."},{"key":"16_CR12","unstructured":"Jensen, F.V.: Bayesian updating in causal probabilistic networks by local computations. An introduction to Bayesian networks (1996)"},{"issue":"5","key":"16_CR13","doi-asserted-by":"publisher","first-page":"5355","DOI":"10.1103\/PhysRevE.58.5355","volume":"58","author":"T Kadowaki","year":"1998","unstructured":"Kadowaki, T., Nishimori, H.: Quantum annealing in the transverse ising model. Phys. Rev. E 58(5), 5355 (1998)","journal-title":"Phys. Rev. E"},{"issue":"7","key":"16_CR14","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/s11128-017-1615-x","volume":"16","author":"H Karimi","year":"2017","unstructured":"Karimi, H., Rosenberg, G.: Boosting quantum annealer performance via sample persistence. Quantum Inf. Process. 16(7), 166 (2017)","journal-title":"Quantum Inf. Process."},{"issue":"4","key":"16_CR15","doi-asserted-by":"publisher","first-page":"043312","DOI":"10.1103\/PhysRevE.96.043312","volume":"96","author":"H Karimi","year":"2017","unstructured":"Karimi, H., Rosenberg, G., Katzgraber, H.G.: Effective optimization using sample persistence: a case study on quantum annealers and various monte carlo optimization methods. Phys. Rev. E 96(4), 043312 (2017)","journal-title":"Phys. Rev. E"},{"issue":"2","key":"16_CR16","first-page":"021008","volume":"4","author":"HG Katzgraber","year":"2014","unstructured":"Katzgraber, H.G., Hamze, F., Andrist, R.S.: Glassy chimeras could be blind to quantum speedup: designing better benchmarks for quantum annealing machines. Phys. Rev. X 4(2), 021008 (2014)","journal-title":"Phys. Rev. X"},{"issue":"3","key":"16_CR17","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1287\/mnsc.3.3.255","volume":"3","author":"HM Markowitz","year":"1957","unstructured":"Markowitz, H.M.: The elimination form of the inverse and its application to linear programming. Manag. Sci. 3(3), 255\u2013269 (1957)","journal-title":"Manag. Sci."},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"29","DOI":"10.3389\/fict.2017.00029","volume":"4","author":"F Neukart","year":"2017","unstructured":"Neukart, F., Compostella, G., Seidel, C., von Dollen, D., Yarkoni, S., Parney, B.: Traffic flow optimization using a quantum annealer. Front. ICT 4, 29 (2017)","journal-title":"Front. ICT"},{"issue":"4","key":"16_CR19","doi-asserted-by":"publisher","first-page":"043306","DOI":"10.1103\/PhysRevE.99.043306","volume":"99","author":"AJ Ochoa","year":"2019","unstructured":"Ochoa, A.J., Jacob, D.C., Mandr\u00e0, S., Katzgraber, H.G.: Feeding the multitude: a polynomial-time algorithm to improve sampling. Phys. Rev. E 99(4), 043306 (2019)","journal-title":"Phys. Rev. E"},{"issue":"1","key":"16_CR20","doi-asserted-by":"publisher","first-page":"6919","DOI":"10.1038\/s41598-018-25206-0","volume":"8","author":"D O\u2019Malley","year":"2018","unstructured":"O\u2019Malley, D.: An approach to quantum-computational hydrologic inverse analysis. Sci. Rep. 8(1), 6919 (2018)","journal-title":"Sci. Rep."},{"issue":"12","key":"16_CR21","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, V.V., Alexandrov, B.S., Alexandrov, L.B.: Nonnegative\/binary matrix factorization with a d-wave quantum annealer. PLoS One 13(12), e0206653 (2018)","journal-title":"PLoS One"},{"key":"16_CR22","doi-asserted-by":"publisher","first-page":"4213","DOI":"10.1038\/ncomms5213","volume":"5","author":"A Peruzzo","year":"2014","unstructured":"Peruzzo, A., et al.: A variational eigenvalue solver on a photonic quantum processor. Nat. Commun. 5, 4213 (2014)","journal-title":"Nat. Commun."},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Preskill, J.: Quantum computing in the NISQ era and beyond. arXiv preprint \narXiv:1801.00862\n\n (2018)","DOI":"10.22331\/q-2018-08-06-79"},{"key":"16_CR24","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: 1994 Proceedings of 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134. IEEE (1994)"},{"key":"16_CR25","volume-title":"Quantum Spin Glasses","author":"S Tanaka","year":"2017","unstructured":"Tanaka, S., Tamura, R., Chakrabarti, B.K.: Quantum Spin Glasses. Annealing and Computation. Cambridge University Press, Cambridge (2017)"}],"container-title":["Lecture Notes in Computer Science","Theory and Practice of Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34500-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T14:05:13Z","timestamp":1575900313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-34500-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030344993","9783030345006"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34500-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"22 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TPNC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Practice of Natural Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kingston, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 December 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tpnc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tpnc2019.irdta.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","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":"15","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":"2","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":"39% - 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","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":"2.1","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}