{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T13:04:21Z","timestamp":1770383061238,"version":"3.49.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030105631","type":"print"},{"value":"9783030105648","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,12,21]],"date-time":"2018-12-21T00:00:00Z","timestamp":1545350400000},"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-10564-8_23","type":"book-chapter","created":{"date-parts":[[2018,12,20]],"date-time":"2018-12-20T12:40:07Z","timestamp":1545309607000},"page":"289-301","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["Analyzing the Quantum Annealing Approach for Solving Linear Least Squares Problems"],"prefix":"10.1007","author":[{"given":"Ajinkya","family":"Borle","sequence":"first","affiliation":[]},{"given":"Samuel J.","family":"Lomonaco","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,21]]},"reference":[{"key":"23_CR1","unstructured":"Quantum enhanced optimization (qeo). https:\/\/www.iarpa.gov\/index.php\/research-programs\/qeo"},{"key":"23_CR2","unstructured":"Adachi, S.H., Henderson, M.P.: Application of quantum annealing to training of deep neural networks. arXiv preprint arXiv:1510.06356 (2015)"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Aramon, M., Rosenberg, G., Miyazawa, T., Tamura, H., Katzgraber, H.G.: Physics-inspired optimization for constraint-satisfaction problems using a digital annealer. arXiv preprint arXiv:1806.08815 (2018)","DOI":"10.3389\/fphy.2019.00048"},{"issue":"3","key":"23_CR4","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1038\/nphys2900","volume":"10","author":"S Boixo","year":"2014","unstructured":"Boixo, S., et al.: Evidence for quantum annealing with more than one hundred qubits. Nat. Phys. 10(3), 218 (2014)","journal-title":"Nat. Phys."},{"issue":"1","key":"23_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1109\/TWC.2008.060497","volume":"7","author":"XW Chang","year":"2008","unstructured":"Chang, X.W., Han, Q.: Solving box-constrained integer least squares problems. IEEE Trans. Wirel. Commun. 7(1), 277\u2013287 (2008)","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"23_CR6","unstructured":"Do, Q.L.: Numerically efficient methods for solving least squares problems (2012)"},{"key":"23_CR7","unstructured":"Dorband, J.E.: Stochastic characteristics of qubits and qubit chains on the D-wave 2X. arXiv preprint arXiv:1606.05550 (2016)"},{"key":"23_CR8","unstructured":"Dorband, J.E.: A method of finding a lower energy solution to a QUBO\/Ising objective function. arXiv preprint arXiv:1801.04849 (2018)"},{"issue":"2","key":"23_CR9","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00211-010-0331-6","volume":"117","author":"P Drineas","year":"2011","unstructured":"Drineas, P., Mahoney, M.W., Muthukrishnan, S., Sarl\u00f3s, T.: Faster least squares approximation. Numer. math. 117(2), 219\u2013249 (2011)","journal-title":"Numer. math."},{"issue":"3","key":"23_CR10","doi-asserted-by":"publisher","first-page":"838","DOI":"10.1137\/S1064827594276552","volume":"18","author":"MJ Grote","year":"1997","unstructured":"Grote, M.J., Huckle, T.: Parallel preconditioning with sparse approximate inverses. SIAM J. Sci. Comput. 18(3), 838\u2013853 (1997)","journal-title":"SIAM J. Sci. Comput."},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Honjo, T., Inagaki, T., Inaba, K., Ikuta, T., Takesue, H.: Long-term stable operation of coherent Ising machine for cloud service. In: CLEO: Science and Innovations, pp. JTu2A-87. Optical Society of America (2018)","DOI":"10.1364\/CLEO_AT.2018.JTu2A.87"},{"issue":"5","key":"23_CR12","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":"1","key":"23_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s11128-011-0235-0","volume":"11","author":"K Karimi","year":"2012","unstructured":"Karimi, K., et al.: Investigating the performance of an adiabatic quantum optimization processor. Quantum Inf. Process. 11(1), 77\u201388 (2012)","journal-title":"Quantum Inf. Process."},{"issue":"1","key":"23_CR14","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1140\/epjst\/e2015-02349-9","volume":"224","author":"B OGorman","year":"2015","unstructured":"OGorman, B., Babbush, R., Perdomo-Ortiz, A., Aspuru-Guzik, A., Smelyanskiy, V.: Bayesian network structure learning using quantum annealing. Eur. Phys. J. Spec. Top. 224(1), 163\u2013188 (2015)","journal-title":"Eur. Phys. J. Spec. Top."},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"O\u2019Malley, D., Vesselinov, V.V.: ToQ. jl: A high-level programming language for D-wave machines based on Julia. In: 2016 IEEE High Performance Extreme Computing Conference (HPEC), pp. 1\u20137. IEEE (2016)","DOI":"10.1109\/HPEC.2016.7761616"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"O\u2019Malley, D., Vesselinov, V.V., Alexandrov, B.S., Alexandrov, L.B.: Nonnegative\/binary matrix factorization with a D-wave quantum annealer. arXiv preprint arXiv:1704.01605 (2017)","DOI":"10.1371\/journal.pone.0206653"},{"issue":"1","key":"23_CR17","first-page":"1842","volume":"17","author":"M Pilanci","year":"2016","unstructured":"Pilanci, M., Wainwright, M.J.: Iterative Hessian sketch: fast and accurate solution approximation for constrained least-squares. J. Mach. Learn. Res. 17(1), 1842\u20131879 (2016)","journal-title":"J. Mach. Learn. Res."},{"key":"23_CR18","volume-title":"Quantum Spin Glasses, Annealing and Computation","author":"S Tanaka","year":"2017","unstructured":"Tanaka, S., Tamura, R., Chakrabarti, B.K.: Quantum Spin Glasses, Annealing and Computation. Cambridge University Press, Cambridge (2017)"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Tsakonas, E., Jald\u00e9n, J., Ottersten, B.: Robust binary least squares: relaxations and algorithms. In: 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 3780\u20133783. IEEE (2011)","DOI":"10.1109\/ICASSP.2011.5947174"},{"issue":"4","key":"23_CR20","doi-asserted-by":"publisher","first-page":"1715","DOI":"10.1137\/10078356X","volume":"49","author":"HF Walker","year":"2011","unstructured":"Walker, H.F., Ni, P.: Anderson acceleration for fixed-point iterations. SIAM J. Numer. Anal. 49(4), 1715\u20131735 (2011)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"23_CR21","doi-asserted-by":"publisher","first-page":"012335","DOI":"10.1103\/PhysRevA.96.012335","volume":"96","author":"G Wang","year":"2017","unstructured":"Wang, G.: Quantum algorithm for linear regression. Phys. Rev. A 96(1), 012335 (2017)","journal-title":"Phys. Rev. A"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10564-8_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:51:30Z","timestamp":1709823090000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10564-8_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,21]]},"ISBN":["9783030105631","9783030105648"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10564-8_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,12,21]]},"assertion":[{"value":"21 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guwahati","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"27 February 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitg.ac.in\/walcom2019\/","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":"100","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":"30","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":"30% - 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":"9.8","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)"}}]}}