Abstract: The Dresden-II reactor experiment has recently reported a suggestive evidence for the observation of coherent elastic neutrino-nucleus scattering, using a germanium detector. Given the low recoil energy threshold, these data are particularly interesting for a low-energy determination of the weak mixing angle and for the study of new physics leading to spectral distortions at low momentum transfer. Using two hypotheses for the quenching factor, we study the impact of the data on: (i) The weak mixing angle at a renormalization scale of similar to 10 MeV, (ii) neutrino generalized interactions with light mediators, (iii) the sterile neutrino dipole portal. The results for the weak mixing angle show a strong dependence on the quenching factor choice. Although still with large uncertainties, the Dresden-II data provide for the first time a determination of sin(2)theta(W) at such scale using coherent elastic neutrino-nucleus scattering data. Tight upper limits are placed on the light vector, scalar and tensor mediator scenarios. Kinematic constraints implied by the reactor anti-neutrino flux and the ionization energy threshold allow the sterile neutrino dipole portal to produce up-scattering events with sterile neutrino masses up to similar to 8 MeV. In this context, we find that limits are also sensitive to the quenching factor choice, but in both cases competitive with those derived from XENON1T data and more stringent that those derived with COHERENT data, in the same sterile neutrino mass range.

Abstract: This article describes the setup and performance of the near and far detectors in the Double Chooz experiment. The electron antineutrinos of the Chooz nuclear power plant were measured in two identically designed detectors with different average baselines of about 400 m and 1050 m from the two reactor cores. Over many years of data taking the neutrino signals were extracted from interactions in the detectors with the goal of measuring a fundamental parameter in the context of neutrino oscillation, the mixing angle 013. The central part of the Double Chooz detectors was a main detector comprising four cylindrical volumes filled with organic liquids. From the inside towards the outside there were volumes con- taining gadolinium-loaded scintillator, gadolinium-free scintillator, a buffer oil and, optically separated, another liquid scintillator acting as veto system. Above this main detector an additional outer veto system using plastic scintillator strips was installed. The technologies developed in Double Chooz were inspiration for several other antineutrino detectors in the field. The detector design allowed implementation of efficient background rejection techniques including use of pulse shape information provided by the data acquisition system. The Double Chooz detectors featured remarkable stability, in particular for the detected photons, as well as high radiopurity of the detector components.

Abstract: Clustering is one of the most frequent problems in many domains, in particular, in particle physics where jet reconstruction is central in experimental analyses. Jet clustering at the CERN's Large Hadron Collider (LHC) is computationally expensive and the difficulty of this task will increase with the upcoming High-Luminosity LHC (HL-LHC). In this paper, we study the case in which quantum computing algorithms might improve jet clustering by considering two novel quantum algorithms which may speed up the classical jet clustering algorithms. The first one is a quantum subroutine to compute a Minkowski-based distance between two data points, whereas the second one consists of a quantum circuit to track the maximum into a list of unsorted data. The latter algorithm could be of value beyond particle physics, for instance in statistics. When one or both of these algorithms are implemented into the classical versions of well-known clustering algorithms (K-means, affinity propagation, and k(T) -jet) we obtain efficiencies comparable to those of their classical counterparts. Even more, exponential speed-up could be achieved, in the first two algorithms, in data dimensionality and data length when the distance algorithm or the maximum searching algorithm are applied.