Abstract: Compton cameras are gamma-ray imaging systems which have been proposed for a wide variety of applications such as medical imaging, nuclear decommissioning or homeland security. In the design and optimization of such a system Monte Carlo simulations play an essential role. In this work, we propose a generic module to perform Monte Carlo simulations and analyses of Compton Camera imaging which is included in the open-source GATE/Geant4 platform. Several digitization stages have been implemented within the module to mimic the performance of the most commonly employed detectors (e.g. monolithic blocks, pixelated scintillator crystals, strip detectors...). Time coincidence sorter and sequence coincidence reconstruction are also available in order to aim at providing modules to facilitate the comparison and reproduction of the data taken with different prototypes. All processing steps may be performed during the simulation (on-the-fly mode) or as a post-process of the output files (offline mode). The predictions of the module have been compared with experimental data in terms of energy spectra, angular resolution, efficiency and back-projection image reconstruction. Consistent results within a 3-sigma interval were obtained for the energy spectra except for low energies where small differences arise. The angular resolution measure for incident photons of 1275 keV was also in good agreement between both data sets with a value close to 13 degrees. Moreover, with the aim of demonstrating the versatility of such a tool the performance of two different Compton camera designs was evaluated and compared.

Abstract: Cosmological observations and cold dark matter N-body simulations indicate that our Universe is populated by numerous halos, where dark matter particles annihilate, potentially producing Standard Model particles. In this paper we calculate the contribution to the diffuse neutrino background from dark matter annihilations in halos at all redshifts and we estimate the future sensitivity to the annihilation cross section of neutrino telescopes such as IceCube or ANTARES. We consider various parametrizations to describe the internal halo properties and for the halo mass function in order to bracket the theoretical uncertainty in the limits from the modeling of the cosmological annihilation flux. We find that observations of the cosmic diffuse neutrino flux at large angular distances from the galactic center lead to constraints on the dark matter annihilation cross section which are complementary to ( and for some extrapolations of the astrophysical parameters, better than) those stemming from observations of the Milky Way halo, especially for neutrino telescopes not pointing directly to the Milky Way center, as is the case of IceCube.

Abstract: The aim of this paper is to build quantum circuits that implement discrete-time quantum walks having an arbitrary position-dependent coin operator. The position of the walker is encoded in base 2: with n wires, each corresponding to one qubit, we encode 2(n) position states. The data necessary to define an arbitrary position-dependent coin operator is therefore exponential in n. Hence, the exponentiality will necessarily appear somewhere in our circuits. We first propose a circuit implementing the position-dependent coin operator, that is naive, in the sense that it has exponential depth and implements sequentially all appropriate position-dependent coin operators. We then propose a circuit that “transfers” all the depth into ancillae, yielding a final depth that is linear in n at the cost of an exponential number of ancillae. Themain idea of this linear-depth circuit is to implement in parallel all coin operators at the different positions. Reducing the depth exponentially at the cost of having an exponential number of ancillae is a goal which has already been achieved for the problem of loading classical data on a quantum circuit (Araujo in Sci Rep 11:6329, 2021) (notice that such a circuit can be used to load the initial state of the walker). Here, we achieve this goal for the problem of applying a position-dependent coin operator in a discrete-time quantum walk. Finally, we extend the result of Welch (New J Phys 16:033040, 2014) from position-dependent unitaries which are diagonal in the position basis to position-dependent 2 x 2-block-diagonal unitaries: indeed, we show that for a position dependence of the coin operator (the block-diagonal unitary) which is smooth enough, one can find an efficient quantum-circuit implementation approximating the coin operator up to an error epsilon (in terms of the spectral norm), the depth and size of which scale as O(1/epsilon). A typical application of the efficient implementation would be the quantum simulation of a relativistic spin-1/2 particle on a lattice, coupled to a smooth external gauge field; notice that recently, quantum spatial-search schemes have been developed which use gauge fields as the oracle, to mark the vertex to be found (Zylberman in Entropy 23:1441, 2021), (Fredon arXiv:2210.13920). A typical application of the linear-depth circuit would be when there is spatial noise on the coin operator (and hence a non-smooth dependence in the position).