Long-lived particles (LLPs) are very challenging to search for with current detectors and computing requirements due to their very displaced vertices. In this talk, we evaluate the ability of the trigger algorithms used in the LHCb experiment to detect LLPs, and attempt to adapt them to enhance the sensitivity of this experiment to undiscovered LLPs. One of the challenges in the track reconstruction is dealing with the large amount of combinatorics of hits, especially during Run 3. A dedicated algorithm has been developed to cope with the large data output. This algorithm will greatly increase the available statistics for any LLP search in the forward region, for the Standard Model of particle physics, and beyond.
|