Entanglement in the quantum Ising model

We study the asymptotic scaling of the entanglement of a block of spins for the ground state of the one-dimensional quantum Ising model with transverse field. When the field is sufficiently strong, the entanglement grows at most logarithmically in the number of spins. The proof utilises a transformation to a model of classical probability called the continuum random-cluster model, and is based on a property of the latter model termed ratio weak-mixing. Our proof applies equally to a large class of disordered interactions

Crossover and self-averaging in the two-dimensional site-diluted Ising model

Using the newly proposed probability-changing cluster (PCC) Monte Carlo algorithm, we simulate the two-dimensional (2D) site-diluted Ising model. Since we can tune the critical point of each random sample automatically with the PCC algorithm, we succeed in studying the sample-dependent $T_c(L)$ and the sample average of physical quantities at each $T_c(L)$ systematically. Using the finite-size scaling (FSS) analysis for $T_c(L)$, we discuss the importance of corrections to FSS both in the strong-dilution and weak-dilution regions. The critical phenomena of the 2D site-diluted Ising model are shown to be controlled by the pure fixed point. The crossover from the percolation fixed point to the pure Ising fixed point with the system size is explicitly demonstrated by the study of the Binder parameter. We also study the distribution of critical temperature $T_c(L)$. Its variance shows the power-law $L$ dependence, $L^{-n}$, and the estimate of the exponent $n$ is consistent with the prediction of Aharony and Harris [Phys. Rev. Lett. {\bf 77}, 3700 (1996)]. Calculating the relative variance of critical magnetization at the sample-dependent $T_c(L)$, we show that the 2D site-diluted Ising model exhibits weak self-averaging.Comment: 6 pages including 6 eps figures, RevTeX, to appear in Phys. Rev.

Constructing Exactly Solvable Pseudo-hermitian Many-particle Quantum Systems by Isospectral Deformation

A class of non-Dirac-hermitian many-particle quantum systems admitting entirely real spectra and unitary time-evolution is presented. These quantum models are isospectral with Dirac-hermitian systems and are exactly solvable. The general method involves a realization of the basic canonical commutation relations defining the quantum system in terms of operators those are hermitian with respect to a pre-determined positive definite metric in the Hilbert space. Appropriate combinations of these operators result in a large number of pseudo-hermitian quantum systems admitting entirely real spectra and unitary time evolution. Examples of a pseudo-hermitian rational Calogero model and XXZ spin-chain are considered.Comment: To appear in the Special Issue PHHQP 2010, International Journal of Theoretical Physics; 16 pages, LateX, no figur

Automated Structure Solution with the PHENIX Suite

Significant time and effort are often required to solve and complete a macromolecular crystal structure. The development of automated computational methods for the analysis, solution and completion of crystallographic structures has the potential to produce minimally biased models in a short time without the need for manual intervention. The PHENIX software suite is a highly automated system for macromolecular structure determination that can rapidly arrive at an initial partial model of a structure without significant human intervention, given moderate resolution and good quality data. This achievement has been made possible by the development of new algorithms for structure determination, maximum-likelihood molecular replacement (PHASER), heavy-atom search (HySS), template and pattern-based automated model-building (RESOLVE, TEXTAL), automated macromolecular refinement (phenix.refine), and iterative model-building, density modification and refinement that can operate at moderate resolution (RESOLVE, AutoBuild). These algorithms are based on a highly integrated and comprehensive set of crystallographic libraries that have been built and made available to the community. The algorithms are tightly linked and made easily accessible to users through the PHENIX Wizards and the PHENIX GUI