skip to main content

Title: Electrically and magnetically switchable nonlinear photocurrent in РТ-symmetric magnetic topological quantum materials

Nonlinear photocurrent in time-reversal invariant noncentrosymmetric systems such as ferroelectric semimetals sparked tremendous interest of utilizing nonlinear optics to characterize condensed matter with exotic phases. Here we provide a microscopic theory of two types of second-order nonlinear direct photocurrents, magnetic shift photocurrent (MSC) and magnetic injection photocurrent (MIC), as the counterparts of normal shift current (NSC) and normal injection current (NIC) in time-reversal symmetry and inversion symmetry broken systems. We show that MSC is mainly governed by shift vector and interband Berry curvature, and MIC is dominated by absorption strength and asymmetry of the group velocity difference at time-reversed ±kpoints. Taking$${\cal{P}}{\cal{T}}$$PT-symmetric magnetic topological quantum material bilayer antiferromagnetic (AFM) MnBi2Te4as an example, we predict the presence of large MIC in the terahertz (THz) frequency regime which can be switched between two AFM states with time-reversed spin orderings upon magnetic transition. In addition, external electric field breaks$${\cal{P}}{\cal{T}}$$PTsymmetry and enables large NSC response in bilayer AFM MnBi2Te4, which can be switched by external electric field. Remarkably, both MIC and NSC are highly tunable under varying electric field due to the field-induced large Rashba and Zeeman splitting, resulting in large nonlinear photocurrent response down to a few THz regime, suggesting bilayer AFM-zMnBi2Te4as a more » tunable platform with rich THz and magneto-optoelectronic applications. Our results reveal that nonlinear photocurrent responses governed by NSC, NIC, MSC, and MIC provide a powerful tool for deciphering magnetic structures and interactions which could be particularly fruitful for probing and understanding magnetic topological quantum materials.

« less
Award ID(s):
Publication Date:
Journal Name:
npj Computational Materials
Nature Publishing Group
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract

    Two-dimensional (2D) Dirac states with linear dispersion have been observed in graphene and on the surface of topological insulators. 2D Dirac states discovered so far are exclusively pinned at high-symmetry points of the Brillouin zone, for example, surface Dirac states at$$\overline{{{\Gamma }}}$$Γ¯in topological insulators Bi2Se(Te)3and Dirac cones atKand$$K^{\prime}$$Kpoints in graphene. The low-energy dispersion of those Dirac states are isotropic due to the constraints of crystal symmetries. In this work, we report the observation of novel 2D Dirac states in antimony atomic layers with phosphorene structure. The Dirac states in the antimony films are located at generic momentum points. This unpinned nature enables versatile ways such as lattice strains to control the locations of the Dirac points in momentum space. In addition, dispersions around the unpinned Dirac points are highly anisotropic due to the reduced symmetry of generic momentum points. The exotic properties of unpinned Dirac states make antimony atomic layers a new type of 2D Dirac semimetals that are distinct from graphene.

  2. Abstract

    Complete theoretical understanding of the most complex superconductors requires a detailed knowledge of the symmetry of the superconducting energy-gap$${\mathrm{{\Delta}}}_{\mathbf{k}}^\alpha$$Δkα, for all momentakon the Fermi surface of every bandα. While there are a variety of techniques for determining$$|{\mathrm{{\Delta}}}_{\mathbf{k}}^\alpha |$$Δkα, no general method existed to measure the signed values of$${\mathrm{{\Delta}}}_{\mathbf{k}}^\alpha$$Δkα. Recently, however, a technique based on phase-resolved visualization of superconducting quasiparticle interference (QPI) patterns, centered on a single non-magnetic impurity atom, was introduced. In principle, energy-resolved and phase-resolved Fourier analysis of these images identifies wavevectors connecting allk-space regions where$${\mathrm{{\Delta}}}_{\mathbf{k}}^\alpha$$Δkαhas the same or opposite sign. But use of a single isolated impurity atom, from whose precise location the spatial phase of the scattering interference pattern must be measured, is technically difficult. Here we introduce a generalization of this approach for use with multiple impurity atoms, and demonstrate its validity by comparing the$${\mathrm{{\Delta}}}_{\mathbf{k}}^\alpha$$Δkαit generates to the$${\mathrm{{\Delta}}}_{\mathbf{k}}^\alpha$$Δkαdetermined from single-atom scattering in FeSe where s±energy-gap symmetry is established. Finally, to exemplify utility, we use the multi-atom technique on LiFeAs and find scattering interference between the hole-like and electron-like pockets as predicted for$${\mathrm{{\Delta}}}_{\mathbf{k}}^\alpha$$Δkαof opposite sign.

  3. Abstract

    The Coulomb-free1S0proton-proton (p-p) scattering length relies heavily on numerous and distinct theoretical techniques to remove the Coulomb contribution. Here, it has been determined from the half-off-the-energy-shellp-pscattering cross section measured at center-of-mass energies below 1 MeV using the quasi-freep + d → p + p + nreaction. A Bayesian data-fitting approach using the expression of the s-wave nucleon-nucleon scattering cross section returned ap-pscattering length$${a}_{pp}=-18.1{7}_{-0.58}^{+0.52}{| }_{stat}\pm 0.0{1}_{syst}$$app=18.170.58+0.52stat±0.01systfm and effective ranger0 = 2.80 ± 0.05stat ± 0.001systfm. A model based on universality concepts has been developed to interpret this result. It accounts for the short-range interaction as a whole, nuclear and residual electromagnetic, according to what the s-wave phase-shiftδdoes in the description of low-energy nucleon-nucleon scattering data. We conclude that our parameters are representative of the short-range physics and propose to assess the charge symmetry breaking of the short-range interaction instead of just the nuclear interaction. This is consistent with the current understanding that the charge dependence of nuclear forces is due to different masses of up-down quarks and their electromagnetic interactions. This achievement suggests that these properties have a lesser than expected impact in the context of the charge symmetry breaking.

  4. Abstract

    We continue the program of proving circuit lower bounds via circuit satisfiability algorithms. So far, this program has yielded several concrete results, proving that functions in$\mathsf {Quasi}\text {-}\mathsf {NP} = \mathsf {NTIME}[n^{(\log n)^{O(1)}}]$Quasi-NP=NTIME[n(logn)O(1)]and other complexity classes do not have small circuits (in the worst case and/or on average) from various circuit classes$\mathcal { C}$C, by showing that$\mathcal { C}$Cadmits non-trivial satisfiability and/or#SAT algorithms which beat exhaustive search by a minor amount. In this paper, we present a new strong lower bound consequence of having a non-trivial#SAT algorithm for a circuit class${\mathcal C}$C. Say that a symmetric Boolean functionf(x1,…,xn) issparseif it outputs 1 onO(1) values of${\sum }_{i} x_{i}$ixi. We show that for every sparsef, and for all “typical”$\mathcal { C}$C, faster#SAT algorithms for$\mathcal { C}$Ccircuits imply lower bounds against the circuit class$f \circ \mathcal { C}$fC, which may bestrongerthan$\mathcal { C}$Citself. In particular:

    #SAT algorithms fornk-size$\mathcal { C}$C-circuits running in 2n/nktime (for allk) implyNEXPdoes not have$(f \circ \mathcal { C})$(fC)-circuits of polynomial size.

    #SAT algorithms for$2^{n^{{\varepsilon }}}$2nε-size$\mathcal { C}$C-circuits running in$2^{n-n^{{\varepsilon }}}$2nnεtime (for someε> 0) implyQuasi-NPdoes not have$(f \circ \mathcal { C})$(fC)-circuits of polynomial size.

    Applying#SAT algorithms from the literature, one immediate corollary of our results is thatQuasi-NPdoes not haveEMAJACC0THRcircuits of polynomialmore »size, whereEMAJis the “exact majority” function, improving previous lower bounds againstACC0[Williams JACM’14] andACC0THR[Williams STOC’14], [Murray-Williams STOC’18]. This is the first nontrivial lower bound against such a circuit class.

    « less
  5. Abstract

    In this paper, we study multistage stochastic mixed-integer nonlinear programs (MS-MINLP). This general class of problems encompasses, as important special cases, multistage stochastic convex optimization withnon-Lipschitzianvalue functions and multistage stochastic mixed-integer linear optimization. We develop stochastic dual dynamic programming (SDDP) type algorithms with nested decomposition, deterministic sampling, and stochastic sampling. The key ingredient is a new type of cuts based on generalized conjugacy. Several interesting classes of MS-MINLP are identified, where the new algorithms are guaranteed to obtain the global optimum without the assumption of complete recourse. This significantly generalizes the classic SDDP algorithms. We also characterize the iteration complexity of the proposed algorithms. In particular, for a$$(T+1)$$(T+1)-stage stochastic MINLP satisfyingL-exact Lipschitz regularization withd-dimensional state spaces, to obtain an$$\varepsilon $$ε-optimal root node solution, we prove that the number of iterations of the proposed deterministic sampling algorithm is upper bounded by$${\mathcal {O}}((\frac{2LT}{\varepsilon })^d)$$O((2LTε)d), and is lower bounded by$${\mathcal {O}}((\frac{LT}{4\varepsilon })^d)$$O((LT4ε)d)for the general case or by$${\mathcal {O}}((\frac{LT}{8\varepsilon })^{d/2-1})$$O((LT8ε)d/2-1)for the convex case. This shows that the obtained complexity bounds are rather sharp. It also reveals that the iteration complexity dependspolynomiallyon the number of stages. We further show that the iteration complexity dependslinearlyonT, if all the state spaces are finite sets, or ifmore »we seek a$$(T\varepsilon )$$(Tε)-optimal solution when the state spaces are infinite sets, i.e. allowing the optimality gap to scale withT. To the best of our knowledge, this is the first work that reports global optimization algorithms as well as iteration complexity results for solving such a large class of multistage stochastic programs. The iteration complexity study resolves a conjecture by the late Prof. Shabbir Ahmed in the general setting of multistage stochastic mixed-integer optimization.

    « less