Related papers: Suggestion for a Fast Heuristic for the Hamiltonia…
Recent developments in quantum annealing techniques have been indicating potential advantage of quantum annealing for solving NP-hard optimization problems. In this article we briefly indicate and discuss the beneficial features of quantum…
An analytical solution to the Hill problem Hamiltonian expanded about the libration points has been obtained by means of perturbation techniques. In order to compute the higher orders of the perturbation solution that are needed to capture…
Quantum annealing is a continuous-time heuristic quantum algorithm for solving or approximately solving classical optimization problems. The algorithm uses a schedule to interpolate between a driver Hamiltonian with an easy-to-prepare…
We study the problem of simulating the dynamics of spin systems when the initial state is supported on a subspace of low energy of a Hamiltonian $H$. This is a central problem in physics with vast applications in many-body systems and…
We propose a new optimization method based on a demagnetization procedure well known in magnetism. We show how this procedure can be applied as a general tool to search for optimal solutions in any system where the configuration space is…
With accelerating urbanization and worsening traffic congestion, optimizing traffic signal systems to improve road throughput and alleviate congestion has become a critical issue. This study proposes a short-term traffic prediction model…
Many academic disciplines - including information systems, computer science, and operations management - face scheduling problems as important decision making tasks. Since many scheduling problems are NP-hard in the strong sense, there is a…
We propose simple heuristics for the assembly line worker assignment and balancing problem. This problem typically occurs in assembly lines in sheltered work centers for the disabled. Different from the classical simple assembly line…
We present a universal quantum Monte Carlo algorithm for simulating arbitrary high-spin (spin greater than 1/2) Hamiltonians, based on the recently developed permutation matrix representation (PMR) framework. Our approach extends a…
Quantum computing enables the efficient resolution of complex problems, often outperforming classical methods across various applications. In 2009, Harrow, Hassidim and Lloyd proposed an algorithm for solving linear systems of equations,…
The role of mental simulation in human physical reasoning is widely acknowledged, but whether it is employed across scenarios with varying simulation costs and where its boundary lies remains unclear. Using a pouring-marble task, our human…
Extremal Optimization, a recently introduced meta-heuristic for hard optimization problems, is analyzed on a simple model of jamming. The model is motivated first by the problem of finding lowest energy configurations for a disordered spin…
We propose a method to produce fast transitionless dynamics for finite-dimensional quantum systems without requiring additional Hamiltonian components not included in the initial control setup, remaining close to the true adiabatic path at…
An interpretation of the ``halo problem'' in accelerators based on quantum-like diffraction is given. Comparison between this approach and the others based on classical mechanics equations is discussed.
We introduce a hybrid classical-quantum algorithm for simulating a Hamiltonian of the form $H= \sum_{i=1}^K H_i = \sum_{i=1}^K H_{i_1} \otimes H_{i_2} \otimes \cdots \otimes H_{i_M}$. Given that the entries of all $\{ H_{i_1}, H_{i_2} ,…
In a realistic scenario, the evolution of the rotational dynamics of a celestial or artificial body is subject to dissipative effects. Time-varying non-conservative forces can be due to, for example, a variation of the moments of inertia or…
In this series of papers, the primary goal is to enumerate Hamiltonian cycles (HC's) on the grid cylinder graphs $P_{m+1}\times C_n$, where $n$ is allowed to grow whilst $m$ is fixed. In Part~I, we studied the so-called non-contractible…
The Hamiltonian formalism is extremely elegant and convenient to mechanics problems. However, its application to the classical field theories is a difficult task. In fact, you can set one to one correspondence between the Lagrangian and…
We study feedback control of classical Hamiltonian systems with the controlling parameter varying slowly in time. The control aims to change system's energy. We show that the control problems can be solved with help of an adiabatic…
We generalize a recently proposed approach for the construction of pseudo-Hermitian Hamiltonians with real spectra. Present technique is based on a simple and straightforward similarity transformation of the coordinate and momentum.