Spin fluctuations and superconductivity in powders of Fe_1+xTe_0.7Se_0.3 as a function of interstitial iron concentration

Using neutron inelastic scattering, we investigate the role of interstitial iron on the low-energy spin fluctuations in powder samples of Fe_{1+x}Te_{0.7}Se_{0.3}. We demonstrate how combining the principle of detailed balance along with measurements at several temperatures allows us to subtract both temperature-independent and phonon backgrounds from S(Q,\omega) to obtain purely magnetic scattering. For small values of interstitial iron (x=0.009(3)), the sample is superconducting (T_{c}=14 K) and displays a spin gap of 7 meV peaked in momentum at wave vector q_{0}=(\pi,\pi) consistent with single crystal results. On populating the interstitial iron sites, the superconducting volume fraction decreases and we observe a filling in of the low-energy magnetic fluctuations and a decrease of the characteristic wave vector of the magnetic fluctuations. For large concentrations of interstitial iron (x=0.048(2)) where the superconducting volume fraction is minimal, we observe the presence of gapless spin fluctuations at a wave vector of q_{0}=(\pi,0). We estimate the absolute total moment for the various samples and find that the amount of interstitial iron does not change the total magnetic spectral weight significantly, but rather has the effect of shifting the spectral weight in Q and energy. These results show that the superconducting and magnetic properties can be tuned by doping small amounts of iron and are suggestive that interstitial iron concentration is also a controlling dopant in the Fe_{1+x}Te_{1-y}Se_{y} phase diagram in addition to the Te/Se ratio.Comment: (10 pages, 8 figures, to be published in Phys. Rev. B

The Gremlin Graph Traversal Machine and Language

Gremlin is a graph traversal machine and language designed, developed, and distributed by the Apache TinkerPop project. Gremlin, as a graph traversal machine, is composed of three interacting components: a graph $G$, a traversal $\Psi$, and a set of traversers $T$. The traversers move about the graph according to the instructions specified in the traversal, where the result of the computation is the ultimate locations of all halted traversers. A Gremlin machine can be executed over any supporting graph computing system such as an OLTP graph database and/or an OLAP graph processor. Gremlin, as a graph traversal language, is a functional language implemented in the user's native programming language and is used to define the $\Psi$ of a Gremlin machine. This article provides a mathematical description of Gremlin and details its automaton and functional properties. These properties enable Gremlin to naturally support imperative and declarative querying, host language agnosticism, user-defined domain specific languages, an extensible compiler/optimizer, single- and multi-machine execution models, hybrid depth- and breadth-first evaluation, as well as the existence of a Universal Gremlin Machine and its respective entailments.Comment: To appear in the Proceedings of the 2015 ACM Database Programming Languages Conferenc

τ\tau-Flavour Violation at the LHC

We study the conditions required for $\chi_2 \to \chi + \tau^\pm \mu^\mp$ decays to yield observable tau flavour violation at the LHC, for cosmologically interesting values of the neutralino relic density. These condition can be achieved in the framework of a SU(5) model with a see-saw mechanism that allows a possible coexistence of a LHC signal a low prediction for radiative LFV decays.Comment: 7 pages, 5 figures, Prepared for the proceedings of the workshop: "LC09: $e^+ e^-$ Physics at the TeV Scale and the Dark Matter Connection", 21-24 September 2009, Perugia, Ital

Nature of Decoupling in the Mixed Phase of Extremely Type-II Layered Superconductors

The uniformly frustrated layered XY model is analyzed in its Villain form. A decouple pancake vortex liquid phase is identified. It is bounded by both first-order and second-order decoupling lines in the magnetic field versus temperature plane. These transitions, respectively, can account for the flux-lattice melting and for the flux-lattice depinning observed in the mixed phase of clean high-temperature superconductors.Comment: 11 pages of PLAIN TeX, 1 postscript figure, published version, many change

Quantum Artificial Life in an IBM Quantum Computer

We present the first experimental realization of a quantum artificial life algorithm in a quantum computer. The quantum biomimetic protocol encodes tailored quantum behaviors belonging to living systems, namely, self-replication, mutation, interaction between individuals, and death, into the cloud quantum computer IBM ibmqx4. In this experiment, entanglement spreads throughout generations of individuals, where genuine quantum information features are inherited through genealogical networks. As a pioneering proof-of-principle, experimental data fits the ideal model with accuracy. Thereafter, these and other models of quantum artificial life, for which no classical device may predict its quantum supremacy evolution, can be further explored in novel generations of quantum computers. Quantum biomimetics, quantum machine learning, and quantum artificial intelligence will move forward hand in hand through more elaborate levels of quantum complexity