BEGIN:VCALENDAR VERSION:2.0 PRODID:-//linuxsoftware.nz//NONSGML Joyous v1.4//EN BEGIN:VEVENT SUMMARY:Quantum Algorithms for Experimental High-Energy Physics Data Proce ssing DTSTART:20220726T140000Z DTEND:20220726T160000Z DTSTAMP:20260625T124005Z UID:6a288b12-1a7a-4fc9-95fc-83d5688f7843 SEQUENCE:2 CREATED:20220722T075210Z DESCRIPTION: Abstract:Quantum computers can solve various problems more ef ficiently than classical computers. While there are still no large-scale q uantum computers\, one can study the complexity of quantum algorithms and understand which ones have a theoretical advantage over their classical co unterparts. In this presentation\, I propose new quantum algorithms for th e object reconstruction problems of tracking and clustering\, which occur frequently in the context of particle physics data analysis. The goal of t hese problems is to group the data points according to some specified geom etrical rule. Using amplitude amplification routines\, I show that a polyn omial quantum speedup is reachable assuming coherent access to the classic al input data. I will finish the presentation by mentioning undergoing wor k on other object reconstruction problems\, both in fault-tolerant and res tricted-depth settings. LAST-MODIFIED:20220725T110848Z LOCATION:Online URL:http://df.vps.tecnico.ulisboa.pt/pt/eventos/quantum-algorithms-for-exp erimental-high-energy-physics-data-processing/ X-ALT-DESC;FMTTYPE=text/html:

Abstract:Quantum computers can solve various problems more efficiently than clas sical computers. While there are still no large-scale quantum computers\, one can study the complexity of quantum algorithms and understand which on es have a theoretical advantage over their classical counterparts. In this presentation\, I propose new quantum algorithms for the object reconstruc tion problems of tracking and clustering\, which occur frequently in the c ontext of particle physics data analysis. The goal of these problems is to group the data points according to some specified geometrical rule. Using amplitude amplification routines\, I show that a polynomial quantum speed up is reachable assuming coherent access to the classical input data. I wi ll finish the presentation by mentioning undergoing work on other object r econstruction problems\, both in fault-tolerant and restricted-depth setti ngs.

END:VEVENT END:VCALENDAR