Quantum Monte Carlo scheme for frustrated Heisenberg antiferromagnets

When one tries to simulate quantum spin systems by the Monte Carlo method, often the 'minus-sign problem' is encountered. In such a case, an application of probabilistic methods is not possible. In this paper the method has been proposed how to avoid the minus sign problem for certain class of frustrated Heisenberg models. The systems where this method is applicable are, for instance, the pyrochlore lattice and the $J_1-J_2$ Heisenberg model. The method works in singlet sector. It relies on expression of wave functions in dimer (pseudo)basis and writing down the Hamiltonian as a sum over plaquettes. In such a formulation, matrix elements of the exponent of Hamiltonian are positive.Comment: 19 LaTeX pages, 6 figures, 1 tabl

Neutron-proton analyzing power at 12 MeV and inconsistencies in parametrizations of nucleon-nucleon data

We present the most accurate and complete data set for the analyzing power Ay(theta) in neutron-proton scattering. The experimental data were corrected for the effects of multiple scattering, both in the center detector and in the neutron detectors. The final data at En = 12.0 MeV deviate considerably from the predictions of nucleon-nucleon phase-shift analyses and potential models. The impact of the new data on the value of the charged pion-nucleon coupling constant is discussed in a model study.Comment: Six pages, four figures, one table, to be published in Physics Letters

Chaos, containment and change: responding to persistent offending by young people

This article reviews policy developments in Scotland concerning 'persistent young offenders' and then describes the design of a study intended to assist a local planning group in developing its response. The key findings of a review of casefiles of young people involved in persistent offending are reported. It emerges that youth crime and young people involved in offending are more complex and heterogeneous than is sometimes assumed. This, along with a review of some literature about desistance from offending, reaffirms the need for properly individualised interventions. Studies of 'desisters' suggest the centrality of effective and engaging working relationships in this process. However, these studies also re-assert the significance of the social contexts of workers’ efforts to bring 'change' out of 'chaos'. We conclude therefore that the 'new correctionalism' must be tempered with appreciation of the social exclusion of young people who offend

Experimental implementation of an adiabatic quantum optimization algorithm

We report the realization of a nuclear magnetic resonance computer with three quantum bits that simulates an adiabatic quantum optimization algorithm. Adiabatic quantum algorithms offer new insight into how quantum resources can be used to solve hard problems. This experiment uses a particularly well suited three quantum bit molecule and was made possible by introducing a technique that encodes general instances of the given optimization problem into an easily applicable Hamiltonian. Our results indicate an optimal run time of the adiabatic algorithm that agrees well with the prediction of a simple decoherence model.Comment: REVTeX, 5 pages, 4 figures, improved lay-out; accepted for publication in Physical Review Letter

Upon the existence of short-time approximations of any polynomial order for the computation of density matrices by path integral methods

In this article, I provide significant mathematical evidence in support of the existence of short-time approximations of any polynomial order for the computation of density matrices of physical systems described by arbitrarily smooth and bounded from below potentials. While for Theorem 2, which is ``experimental'', I only provide a ``physicist's'' proof, I believe the present development is mathematically sound. As a verification, I explicitly construct two short-time approximations to the density matrix having convergence orders 3 and 4, respectively. Furthermore, in the Appendix, I derive the convergence constant for the trapezoidal Trotter path integral technique. The convergence orders and constants are then verified by numerical simulations. While the two short-time approximations constructed are of sure interest to physicists and chemists involved in Monte Carlo path integral simulations, the present article is also aimed at the mathematical community, who might find the results interesting and worth exploring. I conclude the paper by discussing the implications of the present findings with respect to the solvability of the dynamical sign problem appearing in real-time Feynman path integral simulations.Comment: 19 pages, 4 figures; the discrete short-time approximations are now treated as independent from their continuous version; new examples of discrete short-time approximations of order three and four are given; a new appendix containing a short review on Brownian motion has been added; also, some additional explanations are provided here and there; this is the last version; to appear in Phys. Rev.

Continuity of Local Time: An applied perspective

Continuity of local time for Brownian motion ranks among the most notable mathematical results in the theory of stochastic processes. This article addresses its implications from the point of view of applications. In particular an extension of previous results on an explicit role of continuity of (natural) local time is obtained for applications to recent classes of problems in physics, biology and finance involving discontinuities in a dispersion coefficient. The main theorem and its corollary provide physical principles that relate macro scale continuity of deterministic quantities to micro scale continuity of the (stochastic) local time.Comment: To appear in: "The fascination of Probability, Statistics and Their Applications. In honour of Ole E. Barndorff-Nielsen on his 80th birthday

Stochastic Light-Cone CTMRG: a new DMRG approach to stochastic models

We develop a new variant of the recently introduced stochastic transfer-matrix DMRG which we call stochastic light-cone corner-transfer-matrix DMRG (LCTMRG). It is a numerical method to compute dynamic properties of one-dimensional stochastic processes. As suggested by its name, the LCTMRG is a modification of the corner-transfer-matrix DMRG (CTMRG), adjusted by an additional causality argument. As an example, two reaction-diffusion models, the diffusion-annihilation process and the branch-fusion process, are studied and compared to exact data and Monte-Carlo simulations to estimate the capability and accuracy of the new method. The number of possible Trotter steps of more than 10^5 shows a considerable improvement to the old stochastic TMRG algorithm.Comment: 15 pages, uses IOP styl