Coherent Graphene Devices: Movable Mirrors, Buffers and Memories

We theoretically report that, at a sharp electrostatic step potential in graphene, massless Dirac fermions can obtain Goos-H\"{a}nchen-like shifts under total internal reflection. Based on these results, we study the coherent propagation of the quasiparticles along a sharp graphene \emph{p-n-p} waveguide and derive novel dispersion relations for the guided modes. Consequently, coherent graphene devices (e.g. movable mirrors, buffers and memories) induced only by the electric field effect can be proposed.Comment: 12 pages, 5 figure

One-shot rates for entanglement manipulation under non-entangling maps

We obtain expressions for the optimal rates of one- shot entanglement manipulation under operations which generate a negligible amount of entanglement. As the optimal rates for entanglement distillation and dilution in this paradigm, we obtain the max- and min-relative entropies of entanglement, the two logarithmic robustnesses of entanglement, and smoothed versions thereof. This gives a new operational meaning to these entanglement measures. Moreover, by considering the limit of many identical copies of the shared entangled state, we partially recover the recently found reversibility of entanglement manipu- lation under the class of operations which asymptotically do not generate entanglement.Comment: 7 pages; no figure

Efficient implementation of the nonequilibrium Green function method for electronic transport calculations

An efficient implementation of the nonequilibrium Green function (NEGF) method combined with the density functional theory (DFT) using localized pseudo-atomic orbitals (PAOs) is presented for electronic transport calculations of a system connected with two leads under a finite bias voltage. In the implementation, accurate and efficient methods are developed especially for evaluation of the density matrix and treatment of boundaries between the scattering region and the leads. Equilibrium and nonequilibrium contributions in the density matrix are evaluated with very high precision by a contour integration with a continued fraction representation of the Fermi-Dirac function and by a simple quadratureon the real axis with a small imaginary part, respectively. The Hartree potential is computed efficiently by a combination of the two dimensional fast Fourier transform (FFT) and a finite difference method, and the charge density near the boundaries is constructed with a careful treatment to avoid the spurious scattering at the boundaries. The efficiency of the implementation is demonstrated by rapid convergence properties of the density matrix. In addition, as an illustration, our method is applied for zigzag graphene nanoribbons, a Fe/MgO/Fe tunneling junction, and a LaMnO$_3/$SrMnO$_3$ superlattice, demonstrating its applicability to a wide variety of systems.Comment: 20 pages, 11 figure

Rapidly rotating strange stars for a new equation of state of strange quark matter

For a new equation of state of strange quark matter, we construct equilibrium sequences of rapidly rotating strange stars in general relativity. The sequences are the normal and supramassive evolutionary sequences of constant rest mass. We also calculate equilibrium sequences for a constant value of $\Omega$ corresponding to the most rapidly rotating pulsar PSR 1937 + 21. In addition to this, we calculate the radius of the marginally stable orbit and its dependence on $\Omega$, relevant for modeling of kilo-Hertz quasi-periodic oscillations in X-ray binaries.Comment: Two figures, uses psbox.tex and emulateapj5.st

Self-Stabilizing Token Distribution with Constant-Space for Trees

Self-stabilizing and silent distributed algorithms for token distribution in rooted tree networks are given. Initially, each process of a graph holds at most l tokens. Our goal is to distribute the tokens in the whole network so that every process holds exactly k tokens. In the initial configuration, the total number of tokens in the network may not be equal to nk where n is the number of processes in the network. The root process is given the ability to create a new token or remove a token from the network. We aim to minimize the convergence time, the number of token moves, and the space complexity. A self-stabilizing token distribution algorithm that converges within O(n l) asynchronous rounds and needs Theta(nh epsilon) redundant (or unnecessary) token moves is given, where epsilon = min(k,l-k) and h is the height of the tree network. Two novel ideas to reduce the number of redundant token moves are presented. One reduces the number of redundant token moves to O(nh) without any additional costs while the other reduces the number of redundant token moves to O(n), but increases the convergence time to O(nh l). All algorithms given have constant memory at each process and each link register