Local time-reversal-symmetry breaking indx2−y2superconductors
نویسندگان
چکیده
منابع مشابه
Breaking time reversal symmetry in chaotic driven Rydberg atoms
We consider the dynamics of Rydberg states of the hydrogen atom driven by a microwave field of elliptical polarization, with a possible additional static electric field. We concentrate on the effect of a resonant weak field whose frequency is close to the Kepler frequency of the electron around the nucleus which essentially produces no ionization of the atom, but completely mixes the various st...
متن کاملInduced time-reversal symmetry breaking observed in microwave billiards.
Using reciprocity, we investigate the breaking of time-reversal (T) symmetry due to a ferrite embedded in a flat microwave billiard. Transmission spectra of isolated single resonances are not sensitive to T violation, whereas those of pairs of nearly degenerate resonances do depend on the direction of time. For their theoretical description a scattering matrix model from nuclear physics is used...
متن کاملQuantum Transport Enhancement by Time-Reversal Symmetry Breaking
Quantum mechanics still provides new unexpected effects when considering the transport of energy and information. Models of continuous time quantum walks, which implicitly use time-reversal symmetric Hamiltonians, have been intensely used to investigate the effectiveness of transport. Here we show how breaking time-reversal symmetry of the unitary dynamics in this model can enable directional c...
متن کاملTime-reversal symmetry-breaking superconductivity in epitaxial bismuth/nickel bilayers
Superconductivity that spontaneously breaks time-reversal symmetry (TRS) has been found, so far, only in a handful of three-dimensional (3D) crystals with bulk inversion symmetry. We report an observation of spontaneous TRS breaking in a 2D superconducting system without inversion symmetry: the epitaxial bilayer films of bismuth and nickel. The evidence comes from the onset of the polar Kerr ef...
متن کاملLocal Coordination and Symmetry Breaking
This article gives a short survey of recent lower bounds for distributed graph algorithms. There are many classical graph problems (e.g., maximal matching) that can be solved in O(∆ + log∗ n) or O(∆) communication rounds, where n is the number of nodes and ∆ is the maximum degree of the graph. In these algorithms, the key bottleneck seems to be a form of local coordination, which gives rise to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review B
سال: 2000
ISSN: 0163-1829,1095-3795
DOI: 10.1103/physrevb.61.3255