Related papers: Simulated annealing algorithm for finding periodic…
Providing an optimal path to a quantum annealing algorithm is key to finding good approximate solutions to computationally hard optimization problems. Reinforcement is one of the strategies that can be used to circumvent the exponentially…
A semi-numerical method is used in order to locate the position and calculate the period of periodic orbits in a 3D composite bisymmetrical potential, in a number of resonant cases. The potential consists of a 3D harmonic oscillator and a…
We introduce a novel Simulated Quantum Annealing (SQA) algorithm which employs a multispin quantum fluctuation operator. At variance with the usual transverse field, short-range two-spin flip interactions are included in the driver…
Nonintegrable dynamical systems have complex structures in their phase space. Motion of a test charged particle in a dipole magnetic field can be reduced to a 2 degree-of-freedom (2 d.o.f.) nonintegrable Hamiltonian system. We carried out a…
We present a method that generalizes the periodic orbit dividing surface construction for Hamiltonian systems with three or more degrees of freedom. We construct a torus using as a basis a periodic orbit and we extend this to a $2n-2$…
Quantum annealing may provide advantages over simulated annealing on solving some problems such as Kth order binary optimization problem. No feasible architecture exists to implement the high-order optimization problem (K > 2) on current…
Polynomial systems over the binary field have important applications, especially in symmetric and asymmetric cryptanalysis, multivariate-based post-quantum cryptography, coding theory, and computer algebra. In this work, we study the…
We consider an autonomous differential system in $\mathbb{R}^n$ with a periodic orbit and we give a new method for computing the characteristic multipliers associated to it. Our method works when the periodic orbit is given by the…
The existence of periodic orbit bunches is proven for the diamagnetic Kepler problem. Members of each bunch are reconnected differently at self-encounters in phase space but have nearly equal classical action and stability parameters.…
Variational quantum eigensolver ans\"atze hold considerable promise for ground-state energy calculations on near-term quantum hardware, yet most promising ansatz designs currently strongly depend on how well the molecular orbital basis…
A new efficient approach for searching three-body periodic equal-mass collisionless orbits passing through Eulerian configuration is presented. The approach is based on a symmetry property of the solutions at the half period. Depending on…
Quantum annealing aims at solving optimization problems efficiently by preparing the ground state of an Ising spin-Hamiltonian quantum mechanically. A prerequisite of building a quantum annealer is the implementation of programmable…
Features of the residual energy after the quantum annealing are investigated. The quantum annealing method exploits quantum fluctuations to search the ground state of classical disordered Hamiltonian. If the quantum fluctuation is reduced…
Symmetries are ubiquitous in a wide range of nonlinear systems. Particularly in systems whose dynamics are determined by a Lagrangian or Hamiltonian function. For hybrid systems which possess a continuous-time dynamics determined by a…
The performance of basis sets made of numerical atomic orbitals is explored in density-functional calculations of solids and molecules. With the aim of optimizing basis quality while maintaining strict localization of the orbitals, as…
Quantum annealing is analogous to simulated annealing with a tunneling mechanism substituting for thermal activation. Its performance has been tested in numerical simulation with mixed conclusions. There is a class of optimization problems…
We present a new theory for partitioning simulations of periodic and solid-state systems into physically sound atomic contributions at the level of Kohn-Sham density functional theory. Our theory is based on spatially localized linear…
Recently authors have introduced the idea of training discrete weights neural networks using a mix between classical simulated annealing and a replica ansatz known from the statistical physics literature. Among other points, they claim…
The chemical dynamics scene is the most important application of computer simulation. We show that electrons jump between potential holes of different depths (new molecular orbits, hybrid atomic orbits with different energies) under the…
In this paper decomposition of periodic orbits in bifurcation diagrams are derived in unidimensional dynamics system $x_{n+1}=f(x_{n};r)$, being $f$ an unimodal function. We proof a theorem which states the necessary and sufficient…