Related papers: Efficient $6j$ symbol evaluations for atomic calcu…
This paper proposed a framework based on quantum computing for reliability assessment of complex systems. The 'Quantum Twin' concept was also proposed. The framework can be used to accelerate the reliability assessment of large-scale…
With the rapid progress in quantum hardware and software, the need for verification of quantum systems becomes increasingly crucial. While model checking is a dominant and very successful technique for verifying classical systems, its…
In this paper, we explain a procedure based on a classical result of Sturm that can be used to determine rigorously whether a given trigonometric polynomial is nonnegative in a certain interval or not. Many examples are given. This…
We present an efficient moment-based perturbation scheme for evaluating polarizability tensors of small molecules at a fraction of the computational cost of conventional energy-based approaches. Rather than applying explicit electric…
Influence diagrams provide a compact graphical representation of decision problems. Several algorithms for the quick computation of their associated expected utilities are available in the literature. However, often they rely on a full…
Seven-particle scattering amplitudes in planar super-Yang-Mills theory are believed to belong to a special class of generalised polylogarithm functions called heptagon functions. These are functions with physical branch cuts whose symbols…
The significance of both Coulomb and nuclear couplings and their interference effects in the breakup processes of 6,7Li with a non-spherical nucleus 232Th has been evaluated. The continuum discretized coupled channel(CDCC) calculations are…
The $6j$-symbols for representations of the $\mathrm{SU}(2)$ quantum group are given by Hahn-Exton $q$-Bessel functions. This interpretation leads to several summation identities for the $q$-Bessel functions. Multivariate $q$-Bessel…
Performance evaluations on the deterministic algorithms for 6-D problems are rarely found in literatures except some recent advances in the Vlasov and Boltzmann community [Dimarco et al. (2018), Kormann et al. (2019)], due to the extremely…
We propose a scheme for efficient cluster state quantum computation by using imperfect polarization-entangled photon-pair sources, linear optical elements and inefficient non-photon-number-resolving detectors. The efficiency threshold for…
A program RCFP will be presented for calculating standard quantities in the decomposition of many-electron matrix elements in atomic structure theory. The list of quantities wich are supported by the present program includes the…
We compute how the initial energy density and produced gluon, quark and antiquark numbers scale with atomic number and beam energy in ultrarelativistic heavy ion collisions. The computation is based on the argument that the effect of all…
The current study introduces a novel adaptation of speculative decoding, repurposed from generation to classification tasks. We propose a multi-model framework employing up to three lightweight worker models and a single, more robust judge…
In this paper, we consider an extension of Jacobi's symbol, the so called rational $2^k$-th power residue symbol. In Section 3, we prove a novel generalization of Zolotarev's lemma. In Sections 4, 5 and 6, we show that several hard…
Recently, the Dodgson's determinant condensation algorithm was revisited in many papers [College Math. Journal 42(1)(2011): 43--54, College Math. Journal 38(2)(2007): 85--95, Math Horizons 14(2)(2006): 12--15},etc.]. This method is…
The development of accurate and fast numerical schemes for the five fold Boltzmann collision integral represents a challenging problem in scientific computing. For a particular class of interactions, including the so-called hard spheres…
The 1+1D O(3) non-linear {\sigma}-model is a model system for future quantum lattice simulations of other asymptotically-free theories, such as non-Abelian gauge theories. We find that utilizing dimensional reduction can make efficient use…
The distinguishable cluster approximation applied to coupled cluster doubles equations greatly improves absolute and relative energies. We apply the same approximation to the triples equations and demonstrate that it can also improve…
A simple yet efficient computational algorithm for computing the continuous optimal experimental design for linear models is proposed. An alternative proof the monotonic convergence for $D$-optimal criterion on continuous design spaces are…
Since simulating quantum computers requires exponentially more classical resources, efficient algorithms are extremely helpful. We analyze algorithms that create single qubit and specific controlled qubit matrix representations of gates.…