SearcharxivSearch

arXiv subjects

Xidi Wang

Publications and source records attributed to Xidi Wang.

6 recordsLinked to original sources

Sign-Free Evidence for a d-Wave Superfluid Stiffness Dome in the Doped Hubbard Model

We construct an effective single-particle Hamiltonian $K_{\mathrm{eff}}$ from Monte Carlo--averaged matrix logarithms of the imaginary-time propagator in determinant quantum Monte Carlo (DQMC). The logarithm maps the multiplicative sign problem into an additive framework where the central limit theorem guarantees convergence, rendering $K_{\mathrm{eff}}$ sign-problem-free: both sign sectors yield identical dispersions to $<1\%$. $K_{\mathrm{eff}}$ captures the exact correlated single-particle spectrum, incorporating all self-energy effects non-perturbatively. Applied to the Hubbard model ($t'/t = -0.30$, $U/t = 4$), $K_{\mathrm{eff}}$ reveals a $d$-wave pseudogap with strong nodal-antinodal dichotomy below a computational phase transition at $T^*$. Three sign-free observables provide evidence consistent with spin-fluctuation pairing: (i) the gap ratio $R_g > 1$ confirms $d$-wave symmetry -- a temperature-independent property of the correlated band structure that provides the medium for pairing; (ii) the superfluid stiffness $\rho_s$ forms a dome across doping at $L = 8$, $10$, and $12$, exceeding the Berezinskii-Kosterlitz-Thouless threshold by $5$-$7\times$ at the dome peak; (iii) $S(\pi,\pi)$ is approximately flat across doping, establishing that the dome originates from Fermi-surface geometry responding to uniform spin-fluctuation glue. The pseudogap grows monotonically toward half-filling while $\rho_s$ forms a dome, mirroring cuprate phenomenology where $T_c$ is limited by the superfluid density (Uemura relation). Vertex corrections remain to be quantified.

cond-mat.str-el

Path Integral Solution for Dissipative Generative Dynamics

Can purely mechanical systems generate intelligent language? We prove that dissipative quantum dynamics with analytically tractable non-local context aggregation produce coherent text generation, while conservation laws cause fundamental failure. Employing Koopman operators with closed-form path integral propagators, we show irreversible computation fundamentally requires both controlled information dissipation and causal context aggregation. Spectral analysis reveals emergent eigenvalue structure, separating into decay modes (forgetting), growth modes (amplification), and neutral modes (preservation) -- the essential ingredients for directed information flow. Hamiltonian constraints force the elimination of these dissipative modes and degrading performance despite unchanged model capacity. This establishes language generation as dissipative quantum field theory, proving mechanical systems acquire intelligence through the combination of dissipation and non-locality, not through conservation.

cs.LG

Decoherence as Detector of the Unruh Effect

We propose a new type of the Unruh-DeWitt detector which measures the decoherence of the reduced density matrix of the detector interacting with the massless quantum scalar field. We find that the decoherence decay rates are different in the inertial and accelerated reference frames. We show that the exponential phase decay can be observed for relatively low accelerations, that can significantly improve the conditions for measuring the Unruh effect.

gr-qc

Dark Matter Spin-Spin Interaction through the Pseudo-Scalar Vacuum Field

We suggest that the pseudo-scalar vacuum field (PSV) in the dark matter (DM) sector of the Universe may be as important as the electromagnetic vacuum field in the baryonic sector. In particular, the spin-spin interaction between the DM fermions, mediated by PSV, may represent the strongest interaction between the DM fermions due to the absence of the electric charge and the magnetic dipole moment. Based on this assumption, we consider the influence of the spin-spin interaction, mediated by PSV, on the spin precession of the DM fermions (e. g. neutralino). In the secular approximation, we obtain the exact expression describing the frequency of the precession and estimate the decoherence rate.

hep-ph

Irreducible Frequent Patterns in Transactional Databases

Irreducible frequent patters (IFPs) are introduced for transactional databases. An IFP is such a frequent pattern (FP),(x1,x2,...xn), the probability of which, P(x1,x2,...xn), cannot be represented as a product of the probabilities of two (or more) other FPs of the smaller lengths. We have developed an algorithm for searching IFPs in transactional databases. We argue that IFPs represent useful tools for characterizing the transactional databases and may have important applications to bio-systems including the immune systems and for improving vaccination strategies. The effectiveness of the IFPs approach has been illustrated in application to a classification problem.

cs.DS

Iterative Algorithm for Finding Frequent Patterns in Transactional Databases

A high-performance algorithm for searching for frequent patterns (FPs) in transactional databases is presented. The search for FPs is carried out by using an iterative sieve algorithm by computing the set of enclosed cycles. In each inner cycle of level FPs composed of elements are generated. The assigned number of enclosed cycles (the parameter of the problem) defines the maximum length of the desired FPs. The efficiency of the algorithm is produced by (i) the extremely simple logical searching scheme, (ii) the avoidance of recursive procedures, and (iii) the usage of only one-dimensional arrays of integers.

cs.DB