Space-time Torsion and Neutrino Oscillations in Vacuum

The objective of this study is to verify the consistency of the prescription of alternative minimum coupling (connection) proposed by the Teleparallel Equivalent to General Relativity (TEGR) for the Dirac equation. With this aim, we studied the problem of neutrino oscillations in Weitzenbock space-time in the Schwarzschild metric. In particular, we calculate the phase dynamics of neutrinos. The relation of spin of the neutrino with the space-time torsion is clarified through the determination of the phase differences between spin eigenstates of the neutrinos.Comment: 07 pages, no figure

Nonviolation of Bell's Inequality in Translation Invariant Systems

The nature of quantum correlations in strongly correlated systems has been a subject of intense research. In particular, it has been realized that entanglement and quantum discord are present at quantum phase transitions and able to characterize it. Surprisingly, it has been shown for a number of different systems that qubit pairwise states, even when highly entangled, do not violate Bell's inequalities, being in this sense local. Here we show that such a local character of quantum correlations is in fact general for translation invariant systems and has its origins in the monogamy trade-off obeyed by tripartite Bell correlations. We illustrate this result in a quantum spin chain with a soft breaking of translation symmetry. In addition, we extend the monogamy inequality to the $N$-qubit scenario, showing that the bound increases with $N$ and providing examples of its saturation through uniformly generated random pure states.Comment: Published erratum added at the en

Protecting, Enhancing and Reviving Entanglement

We propose a strategies not only to protect but also to enhance and revive the entanglement in a double Jaynes-Cummings model. We show that such surprising features arises when Zeno-like measurements are performed during the dynamical process

Synchronization in the presence of memory

We study the effect of memory on synchronization of identical chaotic systems driven by common external noises. Our examples show that while in general synchronization transition becomes more difficult to meet when memory range increases, for intermediate ranges the synchronization tendency of systems can be enhanced. Generally the synchronization transition is found to depend on the memory range and the ratio of noise strength to memory amplitude, which indicates on a possibility of optimizing synchronization by memory. We also point out on a close link between dynamics with memory and noise, and recently discovered synchronizing properties of networks with delayed interactions

How hole defects modify vortex dynamics in ferromagnetic nanodisks

Defects introduced in ferromagnetic nanodisks may deeply affect the structure and dynamics of stable vortex-like magnetization. Here, analytical techniques are used for studying, among other dynamical aspects, how a small cylindrical cavity modify the oscillatory modes of the vortex. For instance, we have realized that if the vortex is nucleated out from the hole its gyrotropic frequencies are shifted below. Modifications become even more pronounced when the vortex core is partially or completely captured by the hole. In these cases, the gyrovector can be partially or completely suppressed, so that the associated frequencies increase considerably, say, from some times to several powers. Possible relevance of our results for understanding other aspects of vortex dynamics in the presence of cavities and/or structural defects are also discussed.Comment: 9 pages, 4 page

Efficient algorithms for tensor scaling, quantum marginals and moment polytopes

We present a polynomial time algorithm to approximately scale tensors of any format to arbitrary prescribed marginals (whenever possible). This unifies and generalizes a sequence of past works on matrix, operator and tensor scaling. Our algorithm provides an efficient weak membership oracle for the associated moment polytopes, an important family of implicitly-defined convex polytopes with exponentially many facets and a wide range of applications. These include the entanglement polytopes from quantum information theory (in particular, we obtain an efficient solution to the notorious one-body quantum marginal problem) and the Kronecker polytopes from representation theory (which capture the asymptotic support of Kronecker coefficients). Our algorithm can be applied to succinct descriptions of the input tensor whenever the marginals can be efficiently computed, as in the important case of matrix product states or tensor-train decompositions, widely used in computational physics and numerical mathematics. We strengthen and generalize the alternating minimization approach of previous papers by introducing the theory of highest weight vectors from representation theory into the numerical optimization framework. We show that highest weight vectors are natural potential functions for scaling algorithms and prove new bounds on their evaluations to obtain polynomial-time convergence. Our techniques are general and we believe that they will be instrumental to obtain efficient algorithms for moment polytopes beyond the ones consider here, and more broadly, for other optimization problems possessing natural symmetries