اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدField moment expansion method for interacting Bosonic systems
87
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We introduce a numerical method and python package, https://github.com/andillio/CHiMES, that simulates quantum systems initially well approximated by mean field theory using a second order extension of the classical field approach. We call this the field moment expansion method. In this way, we can accurately approximate the evolution of first and second field moments beyond where the mean field theory breaks down. This allows us to estimate the quantum breaktime of a classical approximation without any calculations external to the theory. We investigate the accuracy of the field moment expansion using a number of well studied quantum test problems. Interacting Bosonic systems similar to scalar field dark matter are chosen as test problems. We find that successful application of this method depends on two conditions: the quantum system must initially be well described by the classical theory, and that the growth of the higher order moments be hierarchical.
قيم البحث
اقرأ أيضاً
We explore the use of field solvers as approximations of classical Vlasov-Poisson systems. This correspondence is investigated in both electrostatic and gravitational contexts. We demonstrate the ability of field solvers to be excellent approximation
s of problems with cold initial condition into the non linear regime. We also investigate extensions of the Schrodinger-Poisson system that employ multiple stacked cold streams, and the von Neumann-Poisson equation as methods that can successfully reproduce the classical evolution of warm initial conditions. We then discuss how appropriate simulation parameters need to be chosen to avoid interference terms, aliasing, and wave behavior in the field solver solutions. We present a series of criteria clarifying how parameters need to be chosen in order to effectively approximate classical solutions.
Building on the framework of Zhang & Shu cite{zhangShu_2010a,zhangShu_2010b}, we develop a realizability-preserving method to simulate the transport of particles (fermions) through a background material using a two-moment model that evolves the angul
ar moments of a phase space distribution function $f$. The two-moment model is closed using algebraic moment closures; e.g., as proposed by Cernohorsky & Bludman cite{cernohorskyBludman_1994} and Banach & Larecki cite{banachLarecki_2017a}. Variations of this model have recently been used to simulate neutrino transport in nuclear astrophysics applications, including core-collapse supernovae and compact binary mergers. We employ the discontinuous Galerkin (DG) method for spatial discretization (in part to capture the asymptotic diffusion limit of the model) combined with implicit-explicit (IMEX) time integration to stably bypass short timescales induced by frequent interactions between particles and the background. Appropriate care is taken to ensure the method preserves strict algebraic bounds on the evolved moments (particle density and flux) as dictated by Paulis exclusion principle, which demands a bounded distribution function (i.e., $fin[0,1]$). This realizability-preserving scheme combines a suitable CFL condition, a realizability-enforcing limiter, a closure procedure based on Fermi-Dirac statistics, and an IMEX scheme whose stages can be written as a convex combination of forward Euler steps combined with a backward Euler step. Numerical results demonstrate the realizability-preserving properties of the scheme. We also demonstrate that the use of algebraic moment closures not based on Fermi-Dirac statistics can lead to unphysical moments in the context of fermion transport.
The decomposition method which makes the parallel solution of the block-tridiagonal matrix systems possible is presented. The performance of the method is analytically estimated based on the number of elementary multiplicative operations for its para
llel and serial parts. The computational speedup with respect to the conventional sequential Thomas algorithm is assessed for various types of the application of the method. It is observed that the maximum of the analytical speedup for a given number of blocks on the diagonal is achieved at some finite number of parallel processors. The values of the parameters required to reach the maximum computational speedup are obtained. The benchmark calculations show a good agreement of analytical estimations of the computational speedup and practically achieved results. The application of the method is illustrated by employing the decomposition method to the matrix system originated from a boundary value problem for the two-dimensional integro-differential Faddeev equations. The block-tridiagonal structure of the matrix arises from the proper discretization scheme including the finite-differences over the first coordinate and spline approximation over the second one. The application of the decomposition method for parallelization of solving the matrix system reduces the overall time of calculation up to 10 times.
Quantum simulation of quantum field theory is a flagship application of quantum computers that promises to deliver capabilities beyond classical computing. The realization of quantum advantage will require methods to accurately predict error scaling
as a function of the resolution and parameters of the model that can be implemented efficiently on quantum hardware. In this paper, we address the representation of lattice bosonic fields in a discretized field amplitude basis, develop methods to predict error scaling, and present efficient qubit implementation strategies. A low-energy subspace of the bosonic Hilbert space, defined by a boson occupation cutoff, can be represented with exponentially good accuracy by a low-energy subspace of a finite size Hilbert space. The finite representation construction and the associated errors are directly related to the accuracy of the Nyquist-Shannon sampling and the Finite Fourier transforms of the boson number states in the field and the conjugate-field bases. We analyze the relation between the boson mass, the discretization parameters used for wavefunction sampling and the finite representation size. Numerical simulations of small size $Phi^4$ problems demonstrate that the boson mass optimizing the sampling of the ground state wavefunction is a good approximation to the optimal boson mass yielding the minimum low-energy subspace size. However, we find that accurate sampling of general wavefunctions does not necessarily result in accurate representation. We develop methods for validating and adjusting the discretization parameters to achieve more accurate simulations.
The moment-of-fluid method (MOF) is an extension of the volume-of-fluid method with piecewise linear interface construction (VOF-PLIC). In MOF reconstruction, the optimized normal vector is determined from the reference centroid and the volume fracti
on by iteration. The state-of-art work by citet{milcent_moment--fluid_2020} proposed an analytic gradient of the objective function, which greatly reduces the computational cost. In this study, we further accelerate the MOF reconstruction algorithm by using Gauss-Newton iteration instead of Broyden-Fletcher-Goldfarb-Shanno (BFGS) iteration. We also propose an improved initial guess for MOF reconstruction, which improves the efficiency and the robustness of the MOF reconstruction algorithm. Our implementation of the code and test cases are available on our Github repository.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
