The Jamio{\l}kowski isomorphism and a conceptionally simple proof for the correspondence between vectors having Schmidt number kk and kk-positive maps

Positive maps which are not completely positive are used in quantum information theory as witnesses for convex sets of states, in particular as entanglement witnesses and more generally as witnesses for states having Schmidt number not greater than k. It is known that such witnesses are related to k-positive maps. In this article we propose a new proof for the correspondence between vectors having Schmidt number k and k-positive maps using Jamiolkowski's criterion for positivity of linear maps; to this aim, we also investigate the precise notion of the term "Jamiolkowski isomorphism". As consequences of our proof we get the Jamiolkowski criterion for complete positivity, and we find a special case of a result by Choi, namely that k-positivity implies complete positivity, if k is the dimension of the smaller one of the Hilbert spaces on which the operators act.Comment: 9 page

Permutation-Symmetric Multicritical Points in Random Antiferromagnetic Spin Chains

The low-energy properties of a system at a critical point may have additional symmetries not present in the microscopic Hamiltonian. This letter presents the theory of a class of multicritical points that provide an interesting example of this in the phase diagrams of random antiferromagnetic spin chains. One case provides an analytic theory of the quantum critical point in the random spin-3/2 chain, studied in recent work by Refael, Kehrein and Fisher (cond-mat/0111295).Comment: Revtex, 4 pages (2 column format), 2 eps figure

Spin nematics and magnetization plateau transition in anisotropic Kagome magnets

We study S=1 kagome antiferromagnets with isotropic Heisenberg exchange $J$ and strong easy axis single-ion anisotropy $D$. For $D \gg J$, the low-energy physics can be described by an effective $S=1/2$ $XXZ$ model with antiferromagnetic $J_z \sim J$ and ferromagnetic $J_\perp \sim J^2/D$. Exploiting this connection, we argue that non-trivial ordering into a "spin-nematic" occurs whenever $D$ dominates over $J$, and discuss its experimental signatures. We also study a magnetic field induced transition to a magnetization plateau state at magnetization 1/3 which breaks lattice translation symmetry due to ordering of the $S^z$ and occupies a lobe in the $B/J_z$-$J_z/J_\perp$ phase diagram.Comment: 4pages, two-column format, three .eps figure

An analytical study of transport, mixing and chaos in an unsteady vortical flow

We examine the transport properties of a particular two-dimensional, inviscid incompressible flow using dynamical systems techniques. The velocity field is time periodic and consists of the field induced by a vortex pair plus an oscillating strainrate field. In the absence of the strain-rate field the vortex pair moves with a constant velocity and carries with it a constant body of fluid. When the strain-rate field is added the picture changes dramatically; fluid is entrained and detrained from the neighbourhood of the vortices and chaotic particle motion occurs. We investigate the mechanism for this phenomenon and study the transport and mixing of fluid in this flow. Our work consists of both numerical and analytical studies. The analytical studies include the interpretation of the invariant manifolds as the underlying structure which govern the transport. For small values of strain-rate amplitude we use Melnikov's technique to investigate the behaviour of the manifolds as the parameters of the problem change and to prove the existence of a horseshoe map and thus the existence of chaotic particle paths in the flow. Using the Melnikov technique once more we develop an analytical estimate of the flux rate into and out of the vortex neighbourhood. We then develop a technique for determining the residence time distribution for fluid particles near the vortices that is valid for arbitrary strainrate amplitudes. The technique involves an understanding of the geometry of the tangling of the stable and unstable manifolds and results in a dramatic reduction in computational effort required for the determination of the residence time distributions. Additionally, we investigate the total stretch of material elements while they are in the vicinity of the vortex pair, using this quantity as a measure of the effect of the horseshoes on trajectories passing through this region. The numerical work verifies the analytical predictions regarding the structure of the invariant manifolds, the mechanism for entrainment and detrainment and the flux rate

Random Coulomb antiferromagnets: from diluted spin liquids to Euclidean random matrices

We study a disordered classical Heisenberg magnet with uniformly antiferromagnetic interactions which are frustrated on account of their long-range Coulomb form, {\em i.e.} $J(r)\sim -A\ln r$ in $d=2$ and $J(r)\sim A/r$ in $d=3$. This arises naturally as the $T\rightarrow 0$ limit of the emergent interactions between vacancy-induced degrees of freedom in a class of diluted Coulomb spin liquids (including the classical Heisenberg antiferromagnets on checkerboard, SCGO and pyrochlore lattices) and presents a novel variant of a disordered long-range spin Hamiltonian. Using detailed analytical and numerical studies we establish that this model exhibits a very broad paramagnetic regime that extends to very large values of $A$ in both $d=2$ and $d=3$. In $d=2$, using the lattice-Green function based finite-size regularization of the Coulomb potential (which corresponds naturally to the underlying low-temperature limit of the emergent interactions between orphan-spins), we only find evidence that freezing into a glassy state occurs in the limit of strong coupling, $A=\infty$, while no such transition seems to exist at all in $d=3$. We also demonstrate the presence and importance of screening for such a magnet. We analyse the spectrum of the Euclidean random matrices describing a Gaussian version of this problem, and identify a corresponding quantum mechanical scattering problem.Comment: two-column PRB format; 17 pages; 24 .eps figure

Symmetry breaking perturbations and strange attractors

The asymmetrically forced, damped Duffing oscillator is introduced as a prototype model for analyzing the homoclinic tangle of symmetric dissipative systems with \textit{symmetry breaking} disturbances. Even a slight fixed asymmetry in the perturbation may cause a substantial change in the asymptotic behavior of the system, e.g. transitions from two sided to one sided strange attractors as the other parameters are varied. Moreover, slight asymmetries may cause substantial asymmetries in the relative size of the basins of attraction of the unforced nearly symmetric attracting regions. These changes seems to be associated with homoclinic bifurcations. Numerical evidence indicates that \textit{strange attractors} appear near curves corresponding to specific secondary homoclinic bifurcations. These curves are found using analytical perturbational tools

Error tolerance of two-basis quantum key-distribution protocols using qudits and two-way classical communication

We investigate the error tolerance of quantum cryptographic protocols using $d$-level systems. In particular, we focus on prepare-and-measure schemes that use two mutually unbiased bases and a key-distillation procedure with two-way classical communication. For arbitrary quantum channels, we obtain a sufficient condition for secret-key distillation which, in the case of isotropic quantum channels, yields an analytic expression for the maximally tolerable error rate of the cryptographic protocols under consideration. The difference between the tolerable error rate and its theoretical upper bound tends slowly to zero for sufficiently large dimensions of the information carriers.Comment: 10 pages, 1 figur

Simple and Fast Biased Locks

Locks are used to ensure exclusive access to shared memory locations. Unfortunately, lock operations are expensive, so much work has been done on optimizing their performance for common access patterns. One such pattern is found in networking applications, where there is a single thread dominating lock accesses. An important special case arises when a single-threaded program calls a thread-safe library that uses locks. An effective way to optimize the dominant-thread pattern is to "bias" the lock implementation so that accesses by the dominant thread have negligible overhead. We take this approach in this work: we simplify and generalize existing techniques for biased locks, producing a large design space with many trade-offs. For example, if we assume the dominant process acquires the lock infinitely often (a reasonable assumption for packet processing), it is possible to make the dominant process perform a lock operation without expensive fence or compare-and-swap instructions. This gives a very low overhead solution; we confirm its efficacy by experiments. We show how these constructions can be extended for lock reservation, re-reservation, and to reader-writer situations