arXiv subjects

Quanlin Jie

Publications and source records attributed to Quanlin Jie.

9 recordsLinked to original sources

arXiv2020

Higgsino Asymmetry and Direct-Detection Constraints of Light Dark Matter in the NMSSM with Non-Universal Higgs Masses

In this work, we study the direct-detection constraints of light dark matter in the next-to minimal supersymmetric standard model (NMSSM) with non-universal Higgs masses (NUHM), especially the correlation between higgsino asymmetry and spin-dependent cross section. Finally, we get the following conclusions: (i) The spin-dependent cross section is proportional to the square of higgsino asymmetry in dark matter $\tildeχ^0_1$ in the NMSSM-NUHM. (ii) For highly singlino-dominated dark matter $\tildeχ^0_1$, the relic density can be sufficient, but the higgsino asymmetry and spin-dependent cross section is always small. (iii) With a sizeable higgsino component in the light dark matter, the higgsino asymmetry and spin-dependent cross section can be sizeable, but dark matter relic density is always small, thus it can escape the direct detections. (iv) Light dark matter in the $h_2$- and $Z$-funnel annihilation channels with sufficient relic density can be covered by future LUX-ZEPLIN (LZ) 7-ton in spin-dependent detections.

hep-ph↗

arXiv2018

The semi-constrained NMSSM in light of muon g-2, LHC, and dark matter constraints

The semi-constrained NMSSM (scNMSSM) extends the MSSM by a singlet field, and requires unification of the soft SUSY breaking terms in the squark and slepton sectors, while it allows that in the Higgs sector to be different. We try to interpret the muon g-2 in the scNMSSM, under the constraints of 125 GeV Higgs data, B physics, searches for low and high mass resonances, searches for SUSY particles at the LHC, dark matter relic density by WMAP/Planck, and direct searches for dark matter by LUX, XENON1T, and PandaX-II. We find that under the above constraints, the scNMSSM can still (i) satisfy muon g-2 at 1$σ$ level, with a light muon sneutrino and light chargino; (ii) predict a highly-singlet-dominated 95~GeV Higgs, with a diphoton rate as hinted at by CMS data, because of a light higgsino-like chargino and moderate $λ$; (iii) get low fine tuning from the GUT scale with small $μ_{\rm eff},\, M_0,\, M_{1/2},\, {\rm and}\, A_0$, with a lighter stop mass which can be as low as about 500 GeV, which can be further checked in future studies with search results from the 13~TeV LHC; (iv) have the lightest neutralino be singlino-dominated or higgsino-dominated, while the bino and wino are heavier because of high gluino bounds at the LHC and universal gaugino conditions at the GUT scale; (v) satisfy all the above constraints, although it is not easy for the lightest neutralino, as the only dark matter candidate, to get enough relic density. Several ways to increase relic density are discussed.

hep-ph↗

arXiv2015

Cluster Density Matrix Embedding Theory for Quantum Spin Systems

We applied cluster density matrix embedding theory, with some modifications, to a spin lattice system. The reduced density matrix of the impurity cluster is embedded in the bath states, which are a set of block-product states. The ground state of the impurity model is formulated using a variational wave function. We tested this theory in a two-dimensional (2-D) spin-1/2 J1-J2 model for a square lattice. The ground-state energy (GSE) and the location of the phase boundaries agree well with the most accurate previous results obtained using the quantum Monte Carlo and coupled cluster methods. Moreover, this cluster density matrix embedding theory is cost-effective and convenient for calculating the von Neumann entropy, which is related to the quantum phase transition.

cond-mat.str-el↗

arXiv2014

Parameterized excitation operators for coupled cluster method

We present a coupled cluster method (CCM) with optimized excitation operators. The efficiency comes from a parameterized form of excitation operators. The parameters are found by variational optimization procedure. The resultant number of excitation operators is much smaller than that of the conventional CCM theory. This property makes it possible to apply the method in systems of solid state physics. Starting from Hartree-Fock state as the reference state, i.e., the Fermi sea, we search for particle-hole excitation operators such that the wave function of configuration interaction in terms of these excitation operators spans a good approximation to the ground state. The Match-pursuit algorithm is capable of doing the search of the excitation operators. The resultant operators are our excitation operators for the CCM wave function. We test the method by two dimensional fermionic Hubbard model on a square lattice.

cond-mat.str-el↗

arXiv2008

Approximating the ground state of fermion system by multiple determinant states: matching pursuit approach

We present a simple and stable numerical method to approximate the ground state of a quantum many-body system by multiple determinant states. This method searches these determinant states one by one according to the matching pursuit algorithm. The first determinant state is identical to that of the Hartree-Fock theory. Calculations for two-dimensional Hubbard model serve as a demonstration.

cond-mat.str-el↗

arXiv2006

Decoherence and localization in tunneling process under influence of one external degree of freedom

We investigate numerically the tunneling effect under influence of another particle in a double well system. Such influence from only one degree of freedom makes decoherence and quantum-classical transition, i.e., suppression of the tunneling effect. The decoherence happens even for cases that the influence is from a particle of very small mass, and it has virtually no effect in the corresponding classical dynamics. There are cases similar to dynamical localization that the suppressed tunneling rate is several times smaller than the classical counterpart. This result is relevant for understanding quantitatively the dynamical process of decoherence and quantum to classical transition.

quant-ph↗

arXiv2006

An alternative implementation of the Lanczos algorithm for wave function propagation

We reformulate the Lanczos algorithm for quantum wave function propagation in terms of variational principle. By including some basis states of previous time steps into the variational subspace, the resultant accuracy increases by several orders. Numerical errors of the alternative method accumulate much slower than that of the original Lanczos method. There is almost no extra numeric cost for the gaining of the accuracy, i.e., the accuracy increase needs no extra operations of the Hamiltonian acting on state vectors, which are the major numeric cost for wave function propagation. A wave packet moving in a 2-dimensional Hénon-Heiles model serves as an illustration. This method is suitable for small time step propagation of quantum wave functions in large scale time dependent calculations where the operations of the Hamiltonian acting on state vectors are expensive.

quant-ph↗

arXiv2005

Modification to the pre-factor of the semiclassical propagator

We modify the pre-factor of the semiclassical propagator to improve its efficiency in practical implementations. The new pre-factor represents the smooth portion of an orbit's contribution, and leads to fast convergence in numerical calculations. As an illustration of the accuracy and efficiency of the resultant propagator, we numerically calculate overlaps between quantum and semiclassical wave functions, as well as low-lying spectrum density in a 10-dimensional system contains unstable classical orbits. This sheds light on applying semiclassical propagator to high dimensional systems.

cond-mat.other↗

arXiv2003

Modified conjugated gradient method for diagonalising large matrices

We present an iterative method to diagonalise large matrices. The basic idea is the same as the conjugated gradient (CG) method, i.e, minimizing the Rayleigh quotient via its gradient and avoiding reintroduce errors to the directions of previous gradients. Each iteration step is to find lowest eigenvector of the matrix in a subspace spanned by the current trial vector and the corresponding gradient of the Rayleigh quotient, as well as some previous trial vectors. The gradient, together with the previous trail vectors, play a similar role of the conjugated gradient of the original CG algorithm. Our numeric tests indicate that this method converges significantly faster than the original CG method. And the computational cost of one iteration step is about the same as the original CG method. It is suitably for first principle calculations.

physics.comp-ph↗