1,298 research outputs found

    Training Induced Positive Exchange Bias in NiFe/IrMn Bilayers

    Full text link
    Positive exchange bias has been observed in the Ni81_{81}Fe19_{19}/Ir20_{20}Mn80_{80} bilayer system via soft x-ray resonant magnetic scattering. After field cooling of the system through the blocking temperature of the antiferromagnet, an initial conventional negative exchange bias is removed after training i. e. successive magnetization reversals, resulting in a positive exchange bias for a temperature range down to 30 K below the blocking temperature (450 K). This new manifestation of magnetic training is discussed in terms of metastable magnetic disorder at the magnetically frustrated interface during magnetization reversal.Comment: 4 pages, 3 figure

    On the zig-zag pilot-wave approach for fermions

    Full text link
    We consider a pilot-wave approach for the Dirac theory that was recently proposed by Colin and Wiseman. In this approach, the particles perform a zig-zag motion, due to stochastic jumps of their velocity. We respectively discuss the one-particle theory, the many-particle theory and possible extensions to quantum field theory. We also discuss the non-relativistic limit of the one-particle theory. For a single particle, the motion is always luminal, a feature that persists in the non-relativistic limit. For more than one particle the motion is in general subluminal.Comment: 23 pages, no figures, LaTe

    Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision

    Full text link
    The quantum query complexity of Boolean matrix multiplication is typically studied as a function of the matrix dimension, n, as well as the number of 1s in the output, \ell. We prove an upper bound of O (n\sqrt{\ell}) for all values of \ell. This is an improvement over previous algorithms for all values of \ell. On the other hand, we show that for any \eps < 1 and any \ell <= \eps n^2, there is an \Omega(n\sqrt{\ell}) lower bound for this problem, showing that our algorithm is essentially tight. We first reduce Boolean matrix multiplication to several instances of graph collision. We then provide an algorithm that takes advantage of the fact that the underlying graph in all of our instances is very dense to find all graph collisions efficiently

    Experimental detection of quantum coherent evolution through the violation of Leggett-Garg-type inequalities

    Full text link
    We discuss the use of inequalities of the Leggett-Garg type (LGtI) to witness quantum coherence and present the first experimental violation of this type of inequalities using a light-matter interfaced system. By separately benchmarking the Markovian character of the evolution and the translational invariance of the conditional probabilities, the observed violation of a LGtI is attributed to the quantum coherent character of the process. These results provide a general method to benchmark `quantumness' when the absence of memory effects can be independently certified and confirm the persistence of quantum coherent features within systems of increasing complexity.Comment: published version, including supplementary materia

    Quantum Algorithm for Dynamic Programming Approach for DAGs. Applications for Zhegalkin Polynomial Evaluation and Some Problems on DAGs

    Full text link
    In this paper, we present a quantum algorithm for dynamic programming approach for problems on directed acyclic graphs (DAGs). The running time of the algorithm is O(n^mlogn^)O(\sqrt{\hat{n}m}\log \hat{n}), and the running time of the best known deterministic algorithm is O(n+m)O(n+m), where nn is the number of vertices, n^\hat{n} is the number of vertices with at least one outgoing edge; mm is the number of edges. We show that we can solve problems that use OR, AND, NAND, MAX and MIN functions as the main transition steps. The approach is useful for a couple of problems. One of them is computing a Boolean formula that is represented by Zhegalkin polynomial, a Boolean circuit with shared input and non-constant depth evaluating. Another two are the single source longest paths search for weighted DAGs and the diameter search problem for unweighted DAGs.Comment: UCNC2019 Conference pape

    Manifestation of fundamental quantum complementarities in time-domain interference experiments with quantum dots: A theoretical analysis

    Full text link
    A theoretical analysis is presented showing that fundamental complementarity between the particle-like properties of an exciton confined in a semiconductor quantum dot and the ability of the same system to show interference may be studied in a time domain interference experiment, similar to those currently performed. The feasibility of such an experiment, including required pulse parameters and the dephasing effect of the environment, is studied.Comment: Final, considerably extended version; 8 pages, 3 figure

    Dual Behavior of Antiferromagnetic Uncompensated Spins in NiFe/IrMn Exchange Biased Bilayers

    Full text link
    We present a comprehensive study of the exchange bias effect in a model system. Through numerical analysis of the exchange bias and coercive fields as a function of the antiferromagnetic layer thickness we deduce the absolute value of the averaged anisotropy constant of the antiferromagnet. We show that the anisotropy of IrMn exhibits a finite size effect as a function of thickness. The interfacial spin disorder involved in the data analysis is further supported by the observation of the dual behavior of the interfacial uncompensated spins. Utilizing soft x-ray resonant magnetic reflectometry we have observed that the antiferromagnetic uncompensated spins are dominantly frozen with nearly no rotating spins due to the chemical intermixing, which correlates to the inferred mechanism for the exchange bias.Comment: 4 pages, 3 figure

    Weak Convergence of the Scaled Median of Independent Brownian Motions

    Full text link
    We consider the median of n independent Brownian motions, and show that this process, when properly scaled, converges weakly to a centered Gaussian process. The chief difficulty is establishing tightness, which is proved through direct estimates on the increments of the median process. An explicit formula is given for the covariance function of the limit process. The limit process is also shown to be Holder continuous with exponent gamma for all gamma < 1/4.Comment: to appear in Probability Theory and Related Field
    corecore