Abstract: The exploration of the universe has recently entered a new era thanks to the multi-messenger paradigm, characterized by a continuous increase in the quantity and quality of experimental data that is obtained by the detection of the various cosmic messengers (photons, neutrinos, cosmic rays and gravitational waves) from numerous origins. They give us information about their sources in the universe and the properties of the intergalactic medium. Moreover, multi-messenger astronomy opens up the possibility to search for phenomenological signatures of quantum gravity. On the one hand, the most energetic events allow us to test our physical theories at energy regimes which are not directly accessible in accelerators; on the other hand, tiny effects in the propagation of very high energy particles could be amplified by cosmological distances. After decades of merely theoretical investigations, the possibility of obtaining phenomenological indications of Planck-scale effects is a revolutionary step in the quest for a quantum theory of gravity, but it requires cooperation between different communities of physicists (both theoretical and experimental). This review, prepared within the COST Action CA18108 “Quantum gravity phenomenology in the multi-messenger approach”, is aimed at promoting this cooperation by giving a state-of-the art account of the interdisciplinary expertise that is needed in the effective search of quantum gravity footprints in the production, propagation and detection of cosmic messengers.

Abstract: We present a novel benchmark application of a quantum algorithm to Feynman loop integrals. The two on-shell states of a Feynman propagator are identified with the two states of a qubit and a quantum algorithm is used to unfold the causal singular configurations of multiloop Feynman diagrams. To identify such configurations, we exploit Grover's algorithm for querying multiple solutions over unstructured datasets, which presents a quadratic speed-up over classical algorithms when the number of solutions is much smaller than the number of possible configurations. A suitable modification is introduced to deal with topologies in which the number of causal states to be identified is nearly half of the total number of states. The output of the quantum algorithm in IBM Quantum and QUTE Testbed simulators is used to bootstrap the causal representation in the loop-tree duality of representative multiloop topologies. The algorithm may also find application and interest in graph theory to solve problems involving directed acyclic graphs.

Abstract: The issue of pulse pile-up is frequently encountered in nuclear experiments involving high counting rates, which will distort the pulse shapes and the energy spectra. A digital method of off-line processing of pile-up pulses is presented. The pile-up pulses were firstly identified by detecting the downward-going zero-crossings in the first-order derivative of the original signal, and then the constituent pulses were reconstructed based on comparing the pile-up pulse with four models that are generated by combining pairs of neutron and.. standard pulses together with a controllable time interval. The accuracy of this method in resolving the pile-up events was investigated as a function of the time interval between two pulses constituting a pile-up event. The obtained results show that the method is capable of disentangling two pulses with a time interval among them down to 20 ns, as well as classifying them as neutrons or gamma rays. Furthermore, the error of reconstructing pile-up pulses could be kept below 6% when successive peaks were separated by more than 50 ns. By applying the method in a high counting rate of pile-up events measurement of the NEutron Detector Array (NEDA), it was empirically found that this method can reconstruct the pile-up pulses and perform neutron-gamma discrimination quite accurately. It can also significantly correct the distorted pulse height spectrum due to pile-up events.