Narrow Results

We show that numerical quasi-one-dimensional renormalization group allows accurate study of weakly coupled spin chains with modest computational effort. We perform a systematic comparison with exact diagonalization results in two- and three-leg spin ladders with a transverse Hamiltonian that can involve frustration. Due to the variational nature of the algorithm, the accuracy can be arbitrarily improved enlarging the basis of eigenstates in the transverse direction. We observe that the precision of the algorithm is directly correlated to the binding of the chains. We also show that the method performs especially well in magnetically frustrated systems.

The use of graphics processing units (GPUs) in scientific computing has gathered considerable momentum in the past five years. While GPUs in general promise high performance and excellent performance per Watt ratios, not every class of problems is equally well suitable for exploiting the massively parallel architecture they provide. Lattice spin models appear to be prototypic examples of problems suitable for this architecture, at least as long as local update algorithms are employed. In this review, I summarize our recent experience with the simulation of a wide range of spin models on GPU employing an equally wide range of update algorithms, ranging from Metropolis and heat bath updates, over cluster algorithms to generalized ensemble simulations.

We review Monte Carlo computer simulations of spin models — both discrete and continuous. We explain the phenomenon of critical slowing which seriously degrades the efficiency of standard local Monte Carlo algorithms such as the Metropolis algorithm near phase transitions. We then go onto describe in detail the new algorithms which ameliorate the problem of critical slowing down, and give their dynamical critical exponent values.

The Wolff single-cluster algorithm is the most efficient method known for Monte Carlo simulation of many spin models. Due to the irregular size, shape and position of the Wolff clusters, this method does not easily lend itself to efficient parallel implementation, so that simulations using this method have thus far been confined to workstations and vector machines. Here we present two parallel implementations of this algorithm, and show that one gives fairly good performance on a MIMD parallel computer.

We perform Monte–Carlo simulations of a three-dimensional spin system with a Hamiltonian which contains only four-spin interaction term. This system describes random surfaces with extrinsic curvature – gonihedric action. We study the anisotropic model when the coupling constants β_S for the space-like plaquettes and β_T for the transverse-like plaquettes are different. In the two limits β_S = 0 and β_T = 0 the system has been solved exactly and the main interest is to see what happens when we move away from these points towards the isotropic point, where we recover the original model. We find that the phase transition is of first order for β_T = β_S ≈ 0.25, while away from this point it becomes weaker and eventually turns to a crossover. The conclusion which can be drawn from this result is that the exact solution at the point β_S = 0 in terms of 2D-Ising model should be considered as a good zero-order approximation in the description of the system also at the isotropic point β_S = β_T and clearly confirms the earlier findings that at the isotropic point the original model shows a first-order phase transition.

The interaction of a two-level XYn-spin system with a two-mode cavity field is investigated through a generalized Jaynes-Cummings model in the rotating wave approximation. The spontaneous decay of a spin level was treated by considering the interaction of the two-level spin system with the modes of the universe in the vacuum state. The different cases of interest, characterized in terms of a detuning parameter for each mode, which emerge from the nonvanishing of certain commutation relations between interaction picture Hamiltonians associated with each mode, were analytically implemented and numerically discussed for various values of the initial mean photon number and spin-photon coupling constants. Photon distribution, time evolution of the spin population inversion, as well as the statistical properties of the field leading to the possible production of nonclassical states, such as antibunched light and violations of the Cauchy-Schwartz inequality are examined for an excited initial state. It was assumed that the two modes are initially in coherent states and have the same photon distribution. The case of zero detuning of both modes was treated in terms of a linearization of the expansion of the time evolution operator, while in other three cases, the computations were conducted via second- and third-order Dyson perturbation expansion of the time evolution operator matrix elements for the excited and ground states respectively.

In the present paper, an influence of the anisotropic antisymmetric exchange interaction, the Dzialoshinskii–Moriya (DM) interaction, on entanglement of two qubits in various magnetic spin models, including the pure DM model and the most general XYZ model, are studied. We find that the time evolution generated by DM interaction can implement the SWAP gate and discuss realistic quasi-one-dimensional magnets where it can be realized. It is shown that inclusion of the DM interaction to any Heisenberg model creates, when it does not exist, or strengthens, when it exists, the entanglement. We give physical explanation of these results by studying the ground state of the systems at T = 0. Nonanalytic dependence of the concurrence on the DM interaction and its relation with quantum phase transition is indicated. Our results show that spin models with the DM coupling have some potential applications in quantum computations and the DM interaction could be an efficient control parameter of entanglement.

Some of the recent developments concerning the propagation of quantum correlations across spin channels are reviewed. In particular, we focus on the improvement of the transport efficiency obtained by the manipulation of few energy parameters (either end-bond strengths or local magnetic fields) near the sending and receiving sites. We give a physically insightful description of various such schemes and discuss the transfer of both entanglement and of quantum discord.

Inspired by asynchronous cooperative Parrondo's games we introduce two new types of games in which all players simultaneously play game A or game B or a combination of these two games. These two types of games differ in the way a combination of games A and B is played. In the first type of synchronous games, all players simultaneously play the same game (either A or B), while in the second type players simultaneously play the game of their choice, i.e. A or B. We show that for these games, as in the case of asynchronous games, occurrence of the paradox depends on the number of players. An analytical result and an algorithm are derived for the probability distribution of these games.

We discuss two athermal types of dynamics suitable for spin-models designed to model repeated tapping of a granular assembly. These dynamics are applied to a range of models characterized by a 3-spin Hamiltonian aiming to capture the geometric frustration in packings of granular matter.

We discuss two athermal types of dynamics suitable for spin-models designed to model repeated tapping of a granular assembly. These dynamics are applied to a range of models characterized by a 3-spin Hamiltonian aiming to capture the geometric frustration in packings of granular matter.