Quantum annealing algorithms for track pattern recognition
The High-Luminosity Large Hadron Collider (HL-LHC) starts from 2027 to extend the physics discovery potential at the energy frontier. The HL-LHC produces experimental data with a much higher luminosity, requiring a large amount of computing resources mainly due to the complexity of a track pattern r...
| Main Authors: | , , , , , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
EDP Sciences
2020-01-01
|
| Series: | EPJ Web of Conferences |
| Online Access: | https://www.epj-conferences.org/articles/epjconf/pdf/2020/21/epjconf_chep2020_10006.pdf |
| _version_ | 1818653137934745600 |
|---|---|
| author | Saito Masahiko Calafiura Paolo Gray Heather Lavrijsen Wim Linder Lucy Okumura Yasuyuki Sawada Ryu Smith Alex Tanaka Junichi Terashi Koji |
| author_facet | Saito Masahiko Calafiura Paolo Gray Heather Lavrijsen Wim Linder Lucy Okumura Yasuyuki Sawada Ryu Smith Alex Tanaka Junichi Terashi Koji |
| author_sort | Saito Masahiko |
| collection | DOAJ |
| description | The High-Luminosity Large Hadron Collider (HL-LHC) starts from 2027 to extend the physics discovery potential at the energy frontier. The HL-LHC produces experimental data with a much higher luminosity, requiring a large amount of computing resources mainly due to the complexity of a track pattern recognition algorithm. Quantum annealing might be a solution for an efficient track pattern recognition in the HL-LHC environment. We demonstrated to perform the track pattern recognition by using the D-Wave annealing machine and the Fujitsu Digital Annealer. The tracking efficiency and purity for the D-Wave quantum annealer are comparable with those for a classical simulated annealing at a low pileup condition, while a drop in performance is found at a high pileup condition, corresponding to the HL-LHC pileup environment. The tracking efficiency and purity for the Fujitsu Digital Annealer are nearly the same as the classical simulated annealing. |
| first_indexed | 2024-12-17T02:33:08Z |
| format | Article |
| id | doaj.art-aaf6f38bf0994c5880f8b0ef54eddbc4 |
| institution | Directory Open Access Journal |
| issn | 2100-014X |
| language | English |
| last_indexed | 2024-12-17T02:33:08Z |
| publishDate | 2020-01-01 |
| publisher | EDP Sciences |
| record_format | Article |
| series | EPJ Web of Conferences |
| spelling | doaj.art-aaf6f38bf0994c5880f8b0ef54eddbc42022-12-21T22:06:56ZengEDP SciencesEPJ Web of Conferences2100-014X2020-01-012451000610.1051/epjconf/202024510006epjconf_chep2020_10006Quantum annealing algorithms for track pattern recognitionSaito Masahiko0Calafiura Paolo1Gray HeatherLavrijsen Wim2Linder LucyOkumura Yasuyuki3Sawada Ryu4Smith Alex5Tanaka Junichi6Terashi Koji7International Center for Elementary Particle Physics (ICEPP), The University of TokyoLawrence Berkeley National LaboratoryLawrence Berkeley National LaboratoryInternational Center for Elementary Particle Physics (ICEPP), The University of TokyoInternational Center for Elementary Particle Physics (ICEPP), The University of TokyoDepartment of Physics, University of CaliforniaInternational Center for Elementary Particle Physics (ICEPP), The University of TokyoInternational Center for Elementary Particle Physics (ICEPP), The University of TokyoThe High-Luminosity Large Hadron Collider (HL-LHC) starts from 2027 to extend the physics discovery potential at the energy frontier. The HL-LHC produces experimental data with a much higher luminosity, requiring a large amount of computing resources mainly due to the complexity of a track pattern recognition algorithm. Quantum annealing might be a solution for an efficient track pattern recognition in the HL-LHC environment. We demonstrated to perform the track pattern recognition by using the D-Wave annealing machine and the Fujitsu Digital Annealer. The tracking efficiency and purity for the D-Wave quantum annealer are comparable with those for a classical simulated annealing at a low pileup condition, while a drop in performance is found at a high pileup condition, corresponding to the HL-LHC pileup environment. The tracking efficiency and purity for the Fujitsu Digital Annealer are nearly the same as the classical simulated annealing.https://www.epj-conferences.org/articles/epjconf/pdf/2020/21/epjconf_chep2020_10006.pdf |
| spellingShingle | Saito Masahiko Calafiura Paolo Gray Heather Lavrijsen Wim Linder Lucy Okumura Yasuyuki Sawada Ryu Smith Alex Tanaka Junichi Terashi Koji Quantum annealing algorithms for track pattern recognition EPJ Web of Conferences |
| title | Quantum annealing algorithms for track pattern recognition |
| title_full | Quantum annealing algorithms for track pattern recognition |
| title_fullStr | Quantum annealing algorithms for track pattern recognition |
| title_full_unstemmed | Quantum annealing algorithms for track pattern recognition |
| title_short | Quantum annealing algorithms for track pattern recognition |
| title_sort | quantum annealing algorithms for track pattern recognition |
| url | https://www.epj-conferences.org/articles/epjconf/pdf/2020/21/epjconf_chep2020_10006.pdf |
| work_keys_str_mv | AT saitomasahiko quantumannealingalgorithmsfortrackpatternrecognition AT calafiurapaolo quantumannealingalgorithmsfortrackpatternrecognition AT grayheather quantumannealingalgorithmsfortrackpatternrecognition AT lavrijsenwim quantumannealingalgorithmsfortrackpatternrecognition AT linderlucy quantumannealingalgorithmsfortrackpatternrecognition AT okumurayasuyuki quantumannealingalgorithmsfortrackpatternrecognition AT sawadaryu quantumannealingalgorithmsfortrackpatternrecognition AT smithalex quantumannealingalgorithmsfortrackpatternrecognition AT tanakajunichi quantumannealingalgorithmsfortrackpatternrecognition AT terashikoji quantumannealingalgorithmsfortrackpatternrecognition |