Related papers: Recursive Generation of The Semi-Classical Expansi…
Making use of a recursive approach, derivative dispersion relations are generalized for an arbitrary number of subtractions. The results for both cross even and odd amplitudes are theoretically consistent at sufficiently high energies and…
We describe an iterative approach to computing long-time semiclassical dynamics in the presence of chaos, which eliminates the need for summing over an exponentially large number of classical paths, and has good convergence properties even…
Recent breakthroughs in generative machine learning, powered by massive computational resources, have demonstrated unprecedented human-like capabilities. While beyond-classical quantum experiments can generate samples from classically…
The quantum partition function at finite temperature requires computing the trace of the imaginary time propagator. For numerical and Monte Carlo calculations, the propagator is usually split into its kinetic and potential parts. A higher…
We study the semiclassical expansion of the effective action for a Regge state-sum model and its dependence on the choice of the path-integral measure and the spectrum of the edge lengths. If the positivity of the edge lengths is imposed in…
In this work, we describe a self-replication-based mechanism for designing agents of increasing complexity. We demonstrate the validity of this approach by solving simple, standard evolutionary computation problems in simulation. In the…
The vacuum action for the gravitational field admits a known expansion in powers of the Ricci tensor with nonlocal operator coefficients (form factors). We show that going over to a different basis of curvature invariants makes possible a…
In this work we present a coupled-cluster theory for the propagation of multireference electronic systems initiating at general quantum mechanical states. Our formalism is based on the infinitesimal analysis of modified cluster operators,…
Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with…
In this paper, we develop a formalism describing in a relativistic way a system which consists of a classical and a quantum part being coupled. The formalism models one particle with spin 1/2 and it is a possible relativistic extension of…
We introduce a quantum extension of dynamic programming, a fundamental computational method that efficiently solves recursive problems using memory. Our innovation lies in showing how to coherently generate recursion step unitaries by using…
We construct perturbative frameworks for studying nonequilibrium spin-polarized quark matter. We employ the closed-time-path formalism and use the gradient approximation in the derivative expansion. After constructing self-energy-part…
In this paper, we study mixed power-exponential moment functionals of nonlinearly perturbed semi-Markov processes in discrete time. Conditions under which the moment functionals of interest can be expanded in asymptotic power series with…
We present a diagonalization method for generic matrix valued Hamiltonians based on a formal expansion in power of $\hbar $. Considering $\hbar $ as a running parameter, a differential equation connecting two diagonalization processes for…
We study the resonances of the quantum kicked rotor subjected to an excitation that follows a deterministic time-dependent prescription. For the primary resonances we find an analytical relation between the long-time behavior of the…
We construct off-shell recursion relations for arbitrary loop-level scattering amplitudes beyond the conventional tree-level recursion relations for $\phi^{4}$-theory and the Yang-Mills theory. We define a quantum perturbiner expansion that…
We investigate a connection between a property of the distribution and a conserved quantity for the reversible cellular automaton derived from a discrete-time quantum walk in one dimension. As a corollary, we give a detailed information of…
We present a method for constructing a quantum Markov partition. Its elements are obtained by quantizing the characteristic function of the classical rectangles. The result is a set of quantum operators which behave asymptotically as…
Quantum computers can efficiently sample from probability distributions that are believed to be classically intractable, providing a foundation for quantum generative modeling. However, practical training of such models remains challenging,…
We study a new type of sequences whose elements are defined in terms of the position, sign and magnitude of another element of the sequence. The name ultra-recursive comes from the fact that these sequences possess terms that are generated…