Spin waves in the (0,pi) and (0,pi,pi) ordered SDW states of the t-t' Hubbard model: Application to doped iron pnictides

Spin waves in (0,pi) and (0,pi,pi) ordered spin-density-wave (SDW) states of the t-t' Hubbard model are investigated at finite doping. In the presence of small t', these composite ferro-antiferromagnetic (F-AF) states are found to be strongly stabilized at finite hole doping due to enhanced carrier-induced ferromagnetic spin couplings as in metallic ferromagnets. Anisotropic spin-wave velocities, spin-wave energy scale of around 200meV, reduced magnetic moment, and rapid suppression of magnetic order with electron doping x (corresponding to F substitution of O atoms in La O_{1-x} F_x Fe As or Ni substitution of Fe atoms in Ba Fe_{2-x} Ni_x As_2) obtained in this model are in agreement with observed magnetic properties of doped iron pnictides.Comment: 13 pages, 3 figure

Frustrated multiband superconductivity

We show that a clean multiband superconductor may display one or several phase transitions with increasing temperature from or to frustrated configurations of the relative phases of the superconducting order parameters. These transitions may occur when more than two bands are involved in the formation of the superconducting phase and when the number of repulsive interband interactions is odd. These transitions are signalled by slope changes in the temperature dependence of the superconducting gaps.Comment: 5 pages, 3 figure

A Measure of Segregation Based on Social Interactions

We develop an index of segregation based on two premises: (1) a measure of segregation should disaggregate to the level of individuals, and (2) an individual is more segregated the more segregated are the agents with whom she interacts. We present an index that satisfies (1) and (2) and that is based on agents' social interactions: the extent to which blacks interact with blacks, whites with whites, etc. We use the index to measure school and residential segregation. Using detailed data on friendship networks, we calculate levels of within-school racial segregation in a sample of U. S. schools. We also calculate residential segregation across major U. S. cities, using block-level data from the 2000 U. S. Census

Spin-1/2 particles moving on a 2D lattice with nearest-neighbor interactions can realize an autonomous quantum computer

What is the simplest Hamiltonian which can implement quantum computation without requiring any control operations during the computation process? In a previous paper we have constructed a 10-local finite-range interaction among qubits on a 2D lattice having this property. Here we show that pair-interactions among qutrits on a 2D lattice are sufficient, too, and can also implement an ergodic computer where the result can be read out from the time average state after some post-selection with high success probability. Two of the 3 qutrit states are given by the two levels of a spin-1/2 particle located at a specific lattice site, the third state is its absence. Usual hopping terms together with an attractive force among adjacent particles induce a coupled quantum walk where the particle spins are subjected to spatially inhomogeneous interactions implementing holonomic quantum computing. The holonomic method ensures that the implemented circuit does not depend on the time needed for the walk. Even though the implementation of the required type of spin-spin interactions is currently unclear, the model shows that quite simple Hamiltonians are powerful enough to allow for universal quantum computing in a closed physical system.Comment: More detailed explanations including description of a programmable version. 44 pages, 12 figures, latex. To appear in PR

The Local Time Distribution of a Particle Diffusing on a Graph

We study the local time distribution of a Brownian particle diffusing along the links on a graph. In particular, we derive an analytic expression of its Laplace transform in terms of the Green's function on the graph. We show that the asymptotic behavior of this distribution has non-Gaussian tails characterized by a nontrivial large deviation function.Comment: 8 pages, two figures (included

Application of semidefinite programming to maximize the spectral gap produced by node removal

The smallest positive eigenvalue of the Laplacian of a network is called the spectral gap and characterizes various dynamics on networks. We propose mathematical programming methods to maximize the spectral gap of a given network by removing a fixed number of nodes. We formulate relaxed versions of the original problem using semidefinite programming and apply them to example networks.Comment: 1 figure. Short paper presented in CompleNet, Berlin, March 13-15 (2013

Theory of Andreev reflection in a two-orbital model of iron-pnictide superconductors

A recently developed theory for the problem of Andreev reflection between a normal metal (N) and a multiband superconductor (MBS) assumes that the incident wave from the normal metal is coherently transmitted through several bands inside the superconductor. Such splitting of the probability amplitude into several channels is the analogue of a quantum waveguide. Thus, the appropriate matching conditions for the wave function at the N/MBS interface are derived from an extension of quantum waveguide theory. Interference effects between the transmitted waves inside the superconductor manifest themselves in the conductance. We provide results for a FeAs superconductor, in the framework of a recently proposed effective two-band model and two recently proposed gap symmetries: in the sign-reversed s-wave ($\Delta\cos(k_x)\cos(k_y)$) scenario resonant transmission through surface Andreev bound states (ABS) at nonzero energy is found as well as destructive interference effects that produce zeros in the conductance; in the extended s-wave ($\Delta[\cos(k_x)+\cos(k_y)]$) scenario no ABS at finite energy are found.Comment: 4 pages, 5 figure

A complete characterization of plateaued Boolean functions in terms of their Cayley graphs

In this paper we find a complete characterization of plateaued Boolean functions in terms of the associated Cayley graphs. Precisely, we show that a Boolean function $f$ is $s$-plateaued (of weight $=2^{(n+s-2)/2}$) if and only if the associated Cayley graph is a complete bipartite graph between the support of $f$ and its complement (hence the graph is strongly regular of parameters $e=0,d=2^{(n+s-2)/2}$). Moreover, a Boolean function $f$ is $s$-plateaued (of weight $\neq 2^{(n+s-2)/2}$) if and only if the associated Cayley graph is strongly $3$-walk-regular (and also strongly $\ell$-walk-regular, for all odd $\ell\geq 3$) with some explicitly given parameters.Comment: 7 pages, 1 figure, Proceedings of Africacrypt 201

Quantum Graphs II: Some spectral properties of quantum and combinatorial graphs

The paper deals with some spectral properties of (mostly infinite) quantum and combinatorial graphs. Quantum graphs have been intensively studied lately due to their numerous applications to mesoscopic physics, nanotechnology, optics, and other areas. A Schnol type theorem is proven that allows one to detect that a point belongs to the spectrum when a generalized eigenfunction with an subexponential growth integral estimate is available. A theorem on spectral gap opening for ``decorated'' quantum graphs is established (its analog is known for the combinatorial case). It is also shown that if a periodic combinatorial or quantum graph has a point spectrum, it is generated by compactly supported eigenfunctions (``scars'').Comment: 4 eps figures, LATEX file, 21 pages Revised form: a cut-and-paste blooper fixe