Related papers: Simulated annealing algorithm for finding periodic…
We present a systematic methodology to determine and locate analytically isolated periodic points of discrete and continuous dynamical systems with algebraic nature. We apply this method to a wide range of examples, including a…
We study the simulated annealing algorithm based on the kinetic Langevin dynamics, in order to find the global minimum of a non-convex potential function. For both the continuous time formulation and a discrete time analogue, we obtain the…
An improved algorithm to evaluate the nonrelativistic three-electron Hylleraas-Configuration Interaction (Hy-CI) kinetic energy integrals over Slater orbitals and the Hamiltonian in Hylleraas coordinates is shown. The resulting analytical…
Periodic orbit quantization requires an analytic continuation of non-convergent semiclassical trace formulae. We propose a method for semiclassical quantization based upon the Pade approximant to the periodic orbit sums. The Pade…
We reconsider the classical problem of the continuation of degenerate periodic orbits in Hamiltonian systems. In particular we focus on periodic orbits that arise from the breaking of a completely resonant maximal torus. We here propose a…
A new approach to combinatorial optimization based on systematic move-class deflation is proposed. The algorithm combines heuristics of genetic algorithms and simulated annealing, and is mainly entropy-driven. It is tested on two problems…
We investigate quantum inspired algorithms to compute physical observables of quantum many-body systems at finite energies. They are based on the quantum algorithms proposed in [Lu et al. PRX Quantum 2, 020321 (2021)], which use the quantum…
A many-body Hamiltonian can be block-diagonalized by expressing it in terms of symmetry-adapted basis states. Finding the group orbit representatives of these basis states and their corresponding symmetries is currently a…
Quantum repeaters and satellite-based optical links are complementary technological approaches to overcome the exponential photon loss in optical fibers and thus allow quantum communication on a global scale. We analyze architectures which…
We present a quantum algorithm based on repeated measurement to solve initial-value problems for nonlinear ordinary differential equations (ODEs), which may be generated from partial differential equations in plasma physics. We map a…
In this paper, we propose an orbital iteration based parallel approach for electronic structure calculations. This approach is based on our understanding of the single-particle equations of independent particles that move in an effective…
We perform a quantum simulation of the Ising model with a transverse field using a collection of three trapped atomic ion spins. By adiabatically manipulating the Hamiltonian, we directly probe the ground state for a wide range of fields…
We study the forms of the orbits in a symmetric configuration of a realistic model of the H2O molecule with particular emphasis on the periodic orbits. We use an appropriate Poincar\'e surface of section (PSS) and study the distribution of…
Electron orbits are calculated in solitary two-dimensional axisymmetric electrostatic potential structures, typical of plasma electron holes, in order to establish the conditions for the particles to remain trapped. Analytic calculations of…
We calculate numerically the periodic orbits of pseudointegrable systems of low genus numbers $g$ that arise from rectangular systems with one or two salient corners. From the periodic orbits, we calculate the spectral rigidity…
We present an efficient algorithm for twirling a multi-qudit quantum state. The algorithm can be used for approximating the twirling operation in an ensemble of physical systems in which the systems cannot be individually accessed. It can…
We present a new methodology to analyze complicated multi-physics simulations by introducing a fictitious parameter. Using the method, we study quantum mechanical aspects of an organic molecule in water. The simulation is variationally…
We report on the implementation of an algorithm for computing the set of all regular triangulations of finitely many points in Euclidean space. This algorithm, which we call down-flip reverse search, can be restricted, e.g., to computing…
Although quantum annealing is usually considered as a method for locating the ground states of difficult spin-glass and optimization problems, its use in approximate optimization -- finding low- but not zero-energy states in a reasonably…
We developed a non-Hermitian quantum optimization algorithm to find the ground state of the ferromagnetic Ising model with up to 1024 spins (qubits). Our approach leads to significant reduction of the annealing time. Analytical and…