SearcharxivSearch

arXiv subjects

M. Leone

Publications and source records attributed to M. Leone.

14 recordsLinked to original sources

First observation of antimatter wave interference

In 1924 Louis de Broglie introduced the concept of wave-particle duality: the Planck constant $h$ relates the momentum $p$ of a massive particle to its de Broglie wavelength $λ=h/p$. The superposition principle is one of the main postulates of quantum mechanics; diffraction and interference phenomena are therefore predicted and have been observed on objects of increasing complexity, from electrons to neutrons and molecules. Beyond the early electron diffraction experiments, the demonstration of single-electron double-slit-like interference was a highly sought-after result. Initially proposed by Richard Feynman as a thought experiment it was finally carried out in 1976. A few years later, positron diffraction was first observed. However, an analog of the double-slit experiment has not been performed to date on any system containing antimatter. Here we present the first observation of matter wave interference of single positrons, by using a period-magnifying Talbot-Lau interferometer based on material diffraction gratings. Individual positrons in the 8-14 keV energy range from a monochromatic beam were detected by high-resolution nuclear emulsions. The observed energy dependence of fringe contrast proves the quantum-mechanical origin of the detected periodic pattern and excludes classical projective effects. Talbot-Lau interferometers are well-suited to the experimental challenges posed by low intensity antimatter beams and represent a promising option for measuring the gravitational acceleration of neutral antimatter.

quant-ph

A new study of $^{25}$Mg($α$,n)$^{28}$Si angular distributions at $E_α$ = 3 - 5 MeV

The observation of $^{26}$Al gives us the proof of active nucleosynthesis in the Milky Way. However the identification of the main producers of $^{26}$Al is still a matter of debate. Many sites have been proposed, but our poor knowledge of the nuclear processes involved introduces high uncertainties. In particular, the limited accuracy on the $^{25}$Mg($α$,n)$^{28}$Si reaction cross section has been identified as the main source of nuclear uncertainty in the production of $^{26}$Al in C/Ne explosive burning in massive stars, which has been suggested to be the main source of $^{26}$Al in the Galaxy. We studied this reaction through neutron spectroscopy at the CN Van de Graaff accelerator of the Legnaro National Laboratories. Thanks to this technique we are able to discriminate the ($α$,n) events from possible contamination arising from parasitic reactions. In particular, we measured the neutron angular distributions at 5 different beam energies (between 3 and 5 MeV) in the \ang{17.5}-\ang{106} laboratory system angular range. The presented results disagree with the assumptions introduced in the analysis of a previous experiment.

nucl-ex

Electrical detection of optically pumped spin polarization in Ge

Here we show the room temperature integrated detection of the helicity of photons with 1300 nm wavelength, via spin- photodiodes based on fully epitaxial Fe/MgO/Ge(001) heterostructures. These devices convert the photon helicity in a variation of the photocurrent (ΔI) for opposite orientations of the Fe magnetization. We found ΔI on the order of 5.9% for 100% circularly polarized light, both in the forward and the reverse bias, with a contribution of 0.8% from the Fe dichroic light absorption and of 5.1% from the spin filtering of photo-generated carriers crossing the Fe/MgO/Ge tunneling barrier.

cond-mat.mtrl-sci

Criticality on networks with topology-dependent interactions

Weighted scale-free networks with topology-dependent interactions are studied. It is shown that the possible universality classes of critical behaviour, which are known to depend on topology, can also be explored by tuning the form of the interactions at fixed topology. For a model of opinion formation, simple mean field and scaling arguments show that a mapping $γ'=(γ-μ)/(1-μ)$ describes how a shift of the standard exponent $γ$ of the degree distribution can absorb the effect of degree-dependent pair interactions $J_{ij} \propto (k_ik_j)^{-μ}$, where $k_i$ stands for the degree of vertex $i$. This prediction is verified by extensive numerical investigations using the cavity method and Monte Carlo simulations. The critical temperature of the model is obtained through the Bethe-Peierls approximation and with the replica technique. The mapping can be extended to nonequilibrium models such as those describing the spreading of a disease on a network.

cond-mat.stat-mech

Computational core and fixed-point organisation in Boolean networks

In this paper, we analyse large random Boolean networks in terms of a constraint satisfaction problem. We first develop an algorithmic scheme which allows to prune simple logical cascades and under-determined variables, returning thereby the computational core of the network. Second we apply the cavity method to analyse number and organisation of fixed points. We find in particular a phase transition between an easy and a complex regulatory phase, the latter one being characterised by the existence of an exponential number of macroscopically separated fixed-point clusters. The different techniques developed are reinterpreted as algorithms for the analysis of single Boolean networks, and they are applied to analysis and in silico experiments on the gene-regulatory networks of baker's yeast (saccaromices cerevisiae) and the segment-polarity genes of the fruit-fly drosophila melanogaster.

cond-mat.stat-mech

Core percolation and onset of complexity in Boolean networks

The determination and classification of fixed points of large Boolean networks is addressed in terms of constraint satisfaction problem. We develop a general simplification scheme that, removing all those variables and functions belonging to trivial logical cascades, returns the computational core of the network. The onset of an easy-to-complex regulatory phase is introduced as a function of the parameters of the model, identifying both theoretically and algorithmically the relevant regulatory variables.

cond-mat.dis-nn

Trading interactions for topology in scale-free networks

Scale-free networks with topology-dependent interactions are studied. It is shown that the universality classes of critical behavior, which conventionally depend only on topology, can also be explored by tuning the interactions. A mapping, $γ' = (γ- μ)/(1-μ)$, describes how a shift of the standard exponent $γ$ of the degree distribution $P(q)$ can absorb the effect of degree-dependent pair interactions $J_{ij} \propto (q_iq_j)^{-μ}$. Replica technique, cavity method and Monte Carlo simulation support the physical picture suggested by Landau theory for the critical exponents and by the Bethe-Peierls approximation for the critical temperature. The equivalence of topology and interaction holds for equilibrium and non-equilibrium systems, and is illustrated with interdisciplinary applications.

cond-mat.dis-nn

Predicting protein functions with message passing algorithms

Motivation: In the last few years a growing interest in biology has been shifting towards the problem of optimal information extraction from the huge amount of data generated via large scale and high-throughput techniques. One of the most relevant issues has recently become that of correctly and reliably predicting the functions of observed but still functionally undetermined proteins starting from information coming from the network of co-observed proteins of known functions. Method: The method proposed in this article is based on a message passing algorithm known as Belief Propagation, which takes as input the network of proteins physical interactions and a catalog of known proteins functions, and returns the probabilities for each unclassified protein of having one chosen function. The implementation of the algorithm allows for fast on-line analysis, and can be easily generalized to more complex graph topologies taking into account hyper-graphs, {\em i.e.} complexes of more than two interacting proteins.

q-bio.QM

Complexity transitions in global algorithms for sparse linear systems over finite fields

We study the computational complexity of a very basic problem, namely that of finding solutions to a very large set of random linear equations in a finite Galois Field modulo q. Using tools from statistical mechanics we are able to identify phase transitions in the structure of the solution space and to connect them to changes in performance of a global algorithm, namely Gaussian elimination. Crossing phase boundaries produces a dramatic increase in memory and CPU requirements necessary to the algorithms. In turn, this causes the saturation of the upper bounds for the running time. We illustrate the results on the specific problem of integer factorization, which is of central interest for deciphering messages encrypted with the RSA cryptosystem.

cond-mat.stat-mech

Hiding solutions in random satisfiability problems: A statistical mechanics approach

A major problem in evaluating stochastic local search algorithms for NP-complete problems is the need for a systematic generation of hard test instances having previously known properties of the optimal solutions. On the basis of statistical mechanics results, we propose random generators of hard and satisfiable instances for the 3-satisfiability problem (3SAT). The design of the hardest problem instances is based on the existence of a first order ferromagnetic phase transition and the glassy nature of excited states. The analytical predictions are corroborated by numerical results obtained from complete as well as stochastic local algorithms.

cond-mat.dis-nn

Ferromagnetic ordering in graphs with arbitrary degree distribution

We present a detailed study of the phase diagram of the Ising model in random graphs with arbitrary degree distribution. By using the replica method we compute exactly the value of the critical temperature and the associated critical exponents as a function of the minimum and maximum degree, and the degree distribution characterizing the graph. As expected, there is a ferromagnetic transition provided <= < \infty. However, if the fourth moment of the degree distribution is not finite then non-trivial scaling exponents are obtained. These results are analyzed for the particular case of power-law distributed random graphs.

cond-mat.stat-mech

Exact solutions for diluted spin glasses and optimization problems

We study the low temperature properties of p-spin glass models with finite connectivity and of some optimization problems. Using a one-step functional replica symmetry breaking Ansatz we can solve exactly the saddle-point equations for graphs with uniform connectivity. The resulting ground state energy is in perfect agreement with numerical simulations. For fluctuating connectivity graphs, the same Ansatz can be used in a variational way: For p-spin models (known as p-XOR-SAT in computer science) it provides the exact configurational entropy together with the dynamical and static critical connectivities (for p=3, γ_d=0.818 and γ_s=0.918 resp.), whereas for hard optimization problems like 3-SAT or Bicoloring it provides new upper bounds for their critical thresholds (γ_c^{var}=4.396 and γ_c^{var}=2.149 resp.).

cond-mat.dis-nn

Phase coexistence and finite-size scaling in random combinatorial problems

We study an exactly solvable version of the famous random Boolean satisfiability problem, the so called random XOR-SAT problem. Rare events are shown to affect the combinatorial ``phase diagram'' leading to a coexistence of solvable and unsolvable instances of the combinatorial problem in a certain region of the parameters characterizing the model. Such instances differ by a non-extensive quantity in the ground state energy of the associated diluted spin-glass model. We also show that the critical exponent $ν$, controlling the size of the critical window where the probability of having solutions vanishes, depends on the model parameters, shedding light on the link between random hyper-graph topology and universality classes. In the case of random satisfiability, a similar behavior was conjectured to be connected to the onset of computational intractability.

cond-mat.dis-nn

The dual sector of the ϕ^4 Theory in 4D

The one-component $λϕ^4$ theory in four dimensions in the spontaneously broken symmetry phase has a non-trivial, non-perturbative sector which can be studied by means of a duality transformation of its Ising limit. Duality maps this theory to a model of interacting membranes. Physical states correspond to membrane excitations. The way this non-perturbative behaviour can be reconciled with the triviality of the theory in its continuum limit is discussed.

hep-lat