{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T14:29:26Z","timestamp":1770820166864,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T00:00:00Z","timestamp":1575849600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T00:00:00Z","timestamp":1575849600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100006208","name":"High Energy Physics","doi-asserted-by":"publisher","award":["DE-AC02-05CH11231"],"award-info":[{"award-number":["DE-AC02-05CH11231"]}],"id":[{"id":"10.13039\/100006208","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006208","name":"High Energy Physics","doi-asserted-by":"publisher","award":["KA2401032"],"award-info":[{"award-number":["KA2401032"]}],"id":[{"id":"10.13039\/100006208","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Softw Big Sci"],"published-print":{"date-parts":[[2020,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The reconstruction of charged particles will be a key computing challenge for the high-luminosity Large Hadron Collider (HL-LHC) where increased data rates lead to a large increase in running time for current pattern recognition algorithms. An alternative approach explored here expresses pattern recognition as a quadratic unconstrained binary optimization (QUBO), which allows algorithms to be run on classical and quantum annealers. While the overall timing of the proposed approach and its scaling has still to be measured and studied, we demonstrate that, in terms of efficiency and purity, the same physics performance of the LHC tracking algorithms can be achieved. More research will be needed to achieve comparable performance in HL-LHC conditions, as increasing track density decreases the purity of the QUBO track segment classifier.<\/jats:p>","DOI":"10.1007\/s41781-019-0032-5","type":"journal-article","created":{"date-parts":[[2019,12,9]],"date-time":"2019-12-09T13:02:58Z","timestamp":1575896578000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":37,"title":["A Pattern Recognition Algorithm for Quantum Annealers"],"prefix":"10.1007","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8160-9368","authenticated-orcid":false,"given":"Fr\u00e9d\u00e9ric","family":"Bapst","sequence":"first","affiliation":[]},{"given":"Wahid","family":"Bhimji","sequence":"additional","affiliation":[]},{"given":"Paolo","family":"Calafiura","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5293-4716","authenticated-orcid":false,"given":"Heather","family":"Gray","sequence":"additional","affiliation":[]},{"given":"Wim","family":"Lavrijsen","sequence":"additional","affiliation":[]},{"given":"Lucy","family":"Linder","sequence":"additional","affiliation":[]},{"given":"Alex","family":"Smith","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,9]]},"reference":[{"key":"32_CR1","unstructured":"D-Wave systems. https:\/\/www.dwavesys.com. Accessed 7 Dec 2019"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Preskill J (2018) Quantum computing in the NISQ era and beyond. arXiv e-print arXiv:1801.00862","DOI":"10.22331\/q-2018-08-06-79"},{"issue":"3","key":"32_CR3","doi-asserted-by":"publisher","first-page":"032014","DOI":"10.1088\/1742-6596\/119\/3\/032014","volume":"119","author":"T Cornelissen","year":"2008","unstructured":"Cornelissen T, Elsing M, Gavrilenko I, Liebig W, Moyse E, Salzburger A (2008) The new ATLAS track reconstruction (NEWT). J Phys Conf Ser 119(3):032014. https:\/\/doi.org\/10.1088\/1742-6596\/119\/3\/032014","journal-title":"J Phys Conf Ser"},{"issue":"10","key":"32_CR4","doi-asserted-by":"publisher","first-page":"P10009","DOI":"10.1088\/1748-0221\/9\/10\/P10009","volume":"9","author":"CMS Collaboration","year":"2014","unstructured":"Collaboration CMS (2014) Description and performance of track and primary-vertex reconstruction with the CMS tracker. JINST 9(10):P10009. https:\/\/doi.org\/10.1088\/1748-0221\/9\/10\/P10009","journal-title":"JINST"},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/0010-4655(91)90048-P","volume":"64","author":"G Stimpfl-Abele","year":"1991","unstructured":"Stimpfl-Abele G, Garrido L (1991) Fast track finding with neural networks. Comput Phys Commun 64:46. https:\/\/doi.org\/10.1016\/0010-4655(91)90048-P","journal-title":"Comput Phys Commun"},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/0010-4655(88)90004-5","volume":"49","author":"BH Denby","year":"1988","unstructured":"Denby BH (1988) Neural networks and cellular automata in experimental high-energy physics. Comput Phys Commun 49:429. https:\/\/doi.org\/10.1016\/0010-4655(88)90004-5","journal-title":"Comput Phys Commun"},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1016\/0168-9002(89)91300-4","volume":"A279","author":"C Peterson","year":"1989","unstructured":"Peterson C (1989) Track finding with neural networks. Nucl Instrum Meth A279:537. https:\/\/doi.org\/10.1016\/0168-9002(89)91300-4","journal-title":"Nucl Instrum Meth"},{"issue":"12","key":"32_CR8","doi-asserted-by":"publisher","first-page":"125210","DOI":"10.1063\/1.2995837","volume":"49","author":"S Morita","year":"2008","unstructured":"Morita S, Nishimori H (2008) Mathematical foundation of quantum annealing. J Math Phys 49(12):125210. https:\/\/doi.org\/10.1063\/1.2995837","journal-title":"J Math Phys"},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"026701","DOI":"10.1103\/PhysRevE.72.026701","volume":"72","author":"A Das","year":"2005","unstructured":"Das A, Chakrabarti BK, Stinchcombe RB (2005) Quantum annealing in a kinetically constrained system. Phys Rev E 72:026701. https:\/\/doi.org\/10.1103\/PhysRevE.72.026701","journal-title":"Phys Rev E"},{"key":"32_CR10","unstructured":"Kaggle (2018) Trackml particle challenge. https:\/\/www.kaggle.com\/c\/trackml-particle-identification. Accessed 7 Dec 2019"},{"key":"32_CR11","unstructured":"Delgado AT, Emeliyanov D (2016) Nuclear science symposium, medical imaging conference and room-temperature semiconductor detector workshop (NSS\/MIC\/RTSD). IEEE, pp 1\u20136"},{"key":"32_CR12","unstructured":"Booth M, Reinhardt S, Roy A (2017) Partitioning optimization problems for hybrid classical\/quantum execution. D-Wave Technical Report. https:\/\/www.dwavesys.com\/sites\/default\/files\/partitioning_QUBOs_for_quantum_acceleration-2.pdf. Accessed 7 Dec 2019"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Glover F (1986) Future paths for integer programming and links to artificial intelligence","DOI":"10.1016\/0305-0548(86)90048-1"},{"key":"32_CR14","unstructured":"D-Wave neal. https:\/\/docs.ocean.dwavesys.com\/projects\/neal. Accessed 7 Dec 2019"},{"key":"32_CR15","unstructured":"Cori. https:\/\/www.nersc.gov\/systems\/cori. Accessed 7 Dec 2019"},{"key":"32_CR16","unstructured":"Linder L (2019) Hepqpr.qallse repository. https:\/\/github.com\/derlin\/hepqpr-qallse. Accessed 7 Dec 2019"},{"key":"32_CR17","unstructured":"Headquarters C (2013) Programming with D-Wave: map coloring problem"},{"key":"32_CR18","doi-asserted-by":"publisher","DOI":"10.3389\/fphy.2014.00079","author":"H Seddiqi","year":"2014","unstructured":"Seddiqi H, Humble T (2014) Adiabatic quantum optimization for associative memory recall. Front Phys. https:\/\/doi.org\/10.3389\/fphy.2014.00079","journal-title":"Front Phys"},{"issue":"1","key":"32_CR19","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/S0020-0255(99)00101-2","volume":"124","author":"D Ventura","year":"2000","unstructured":"Ventura D, Martinez T (2000) Quantum associative memory. Inf Sci 124(1):273","journal-title":"Inf Sci"},{"key":"32_CR20","unstructured":"Shapoval I, Calafiura P (2019) 23rd International conference on computing in high energy and nuclear physics (CHEP 2018), Sofia, Bulgaria, July 9\u201313, 2018"}],"container-title":["Computing and Software for Big Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41781-019-0032-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41781-019-0032-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41781-019-0032-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,28]],"date-time":"2020-12-28T13:07:23Z","timestamp":1609160843000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s41781-019-0032-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,9]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["32"],"URL":"https:\/\/doi.org\/10.1007\/s41781-019-0032-5","relation":{},"ISSN":["2510-2036","2510-2044"],"issn-type":[{"value":"2510-2036","type":"print"},{"value":"2510-2044","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,9]]},"assertion":[{"value":"1 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 December 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with Ethical Standards"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"1"}}