相关论文: Shift techniques for Quasi-Birth and Death process…

We study the distribution of the Schmidt coefficients of the reduced density matrix of a quantum system in a pure state. By applying general methods of statistical mechanics, we introduce a fictitious temperature and a partition function…

The phase transition calculations are utilized for an in-depth understanding of the thermodynamics of the deconfinement transition to perform the best analysis of the QCD phase diagram. The phenomenological justifications for a mathematical…

Modern adiabatic quantum computers (AQC) are already used to solve difficult combinatorial optimisation problems in various domains of science. Currently, only a few applications of AQC in computer vision have been demonstrated. We review…

In this article, we derive the state probabilities of different type of space- and time-fractional Poisson processes using z-transform. We work on tempered versions of time-fractional Poisson process and space-fractional Poisson processes.…

By means of the recently proposed algorithm based on the tensor product states, the magnetization process of the spin-1/2 anti-ferromagnetic XXZ model on a square lattice is investigated. In the large spin-anisotropy limit, clear evidence…

This paper concerns the existence of multiple rotating quasi-periodic solutions for second order Hamiltonian systems with sub-quadratic potential. Such solutions have the form $x(t+T)=Qx(t)$ for some orthogonal matrix $Q$. To deal with such…

We study the decay of survival probability at quantum phase transitions (QPT). The semiclassical theory is found applicable in the vicinities of critical points with infinite degeneracy. The theory predicts a power law decay of the survival…

Quantum algorithms offer the potential for significant computational advantages; however, in many cases, it remains unclear how these advantages can be practically realized. Causal Set Theory is a discrete, Lorentz-invariant approach to…

In topologically-protected quantum computation, quantum gates can be carried out by adiabatically braiding two-dimensional quasiparticles, reminiscent of entangled world lines. Bonesteel et al. [Phys. Rev. Lett. 95, 140503 (2005)], as well…

We propose a new method for simulating QCD at finite density, where interesting phases such as the color superconductivity phase is conjectured to appear. The method is based on a general factorization property of distribution functions of…

We analyse the matrix factorization problem. Given a noisy measurement of a product of two matrices, the problem is to estimate back the original matrices. It arises in many applications such as dictionary learning, blind matrix…

In this contribution, we summarize and discuss recent theoretical progress on the Standard-Model calculation of joint polarized cross sections of massive multi-boson processes with fully leptonic decays. The topics include fixed-order…

We consider the QCD factorization of DIS structure functions at small x and amplitudes of 2->2 -hadronic forward scattering at high energy. We show that both collinear and k_T-factorization for these processes can be obtained approximately…

The Factorial Basis method, initially designed for quasi-triangular, shift-compatible factorial bases, provides solutions to linear recurrence equations in the form of definite-sums. This paper extends the Factorial Basis method to its…

We discuss the nature of the phase transition for lattice QCD at finite temperature and density. We propose a method to calculate the canonical partition function by fixing the total quark number introducing approximations allowed in the…

Omics technologies are powerful tools for analyzing patterns in gene expression data for thousands of genes. Due to a number of systematic variations in experiments, the raw gene expression data is often obfuscated by undesirable technical…

In this article, we introduce fractional Poisson felds of order k in n-dimensional Euclidean space $R_n^+$. We also work on time-fractional Poisson process of order k, space-fractional Poisson process of order k and tempered version of…

Pendry and MacKinnon meaningful discretization of Maxwell's equations was put forward specifically as part of a finite-element numerical algorithm. By contrast with a numerical approach, in the same spirit evoked by the relationships…

The elementary theory of bivariate linear Diophantine equations over polynomial rings is used to construct causal lifting factorizations (elementary matrix decompositions) for causal two-channel FIR perfect reconstruction transfer matrices…

The fast Fourier transform (FFT) is one of the most successful numerical algorithms of the 20th century and has found numerous applications in many branches of computational science and engineering. The FFT algorithm can be derived from a…