Abstract: Nuclear matrix elements (NME) are a crucial input for the interpretation of neutrinoless double beta decay data. We consider a representative set of recent NME calculations from different methods and investigate the impact on the present bound on the effective Majorana mass m(& beta;& beta;) by performing a combined analysis of the available data as well as on the sensitivity reach of future projects. A crucial role is played by the recently discovered short-range contribution to the NME, induced by light Majorana neutrino masses. Depending on the NME model and the relative sign of the long- and short-range contributions, the current 3 & sigma; bound can change between m(& beta;& beta;)< 40 meV and 600 meV. The sign-uncertainty may either boost the sensitivity of next-generation experiments beyond the region for m(& beta;& beta;) predicted for inverted mass ordering or prevent even advanced setups to reach this region. Furthermore, we study the possibility to distinguish between different NME calculations by assuming a positive signal and by combining measurements from different isotopes. Such a discrimination will be impossible if the relative sign of the long- and short-range contribution remains unknown, but can become feasible if m(& beta;& beta;) & GSIM; 40 meV and if the relative sign is known to be positive. Sensitivities will be dominated by the advanced Ge-76 and Xe-136 setups assumed here, but NME model-discrimination improves if data from a third isotope is added, e.g., from Te-130 or Mo-100.

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).