Hamiltonian Problem Research Articles

What do Eulerian and Hamiltonian cycles have to do with genome assembly?

Many students are taught about genome assembly using the dichotomy between the complexity of finding Eulerian and Hamiltonian cycles (easy versus hard, respectively). This dichotomy is sometimes used to motivate the use of de Bruijn graphs in practice. In this paper, we explain that while de Bruijn graphs have indeed been very useful, the reason has nothing to do with the complexity of the Hamiltonian and Eulerian cycle problems. We give 2 arguments. The first is that a genome reconstruction is never unique and hence an algorithm for finding Eulerian or Hamiltonian cycles is not part of any assembly algorithm used in practice. The second is that even if an arbitrary genome reconstruction was desired, one could do so in linear time in both the Eulerian and Hamiltonian paradigms.

A Fourth Order Symplectic and Conjugate-Symplectic Extension of the Midpoint and Trapezoidal Methods

The paper presents fourth order Runge–Kutta methods derived from symmetric Hermite–Obreshkov schemes by suitably approximating the involved higher derivatives. In particular, starting from the multi-derivative extension of the midpoint method we have obtained a new symmetric implicit Runge–Kutta method of order four, for the numerical solution of first-order differential equations. The new method is symplectic and is suitable for the solution of both initial and boundary value Hamiltonian problems. Moreover, starting from the conjugate class of multi-derivative trapezoidal schemes, we have derived a new method that is conjugate to the new symplectic method.

Efficient phase-factor evaluation in quantum signal processing

Quantum signal processing (QSP) is a powerful quantum algorithm to exactly implement matrix polynomials on quantum computers. Asymptotic analysis of quantum algorithms based on QSP has shown that asymptotically optimal results can in principle be obtained for a range of tasks, such as Hamiltonian simulation and the quantum linear system problem. A further benefit of QSP is that it uses a minimal number of ancilla qubits, which facilitates its implementation on near-to-intermediate term quantum architectures. However, there is so far no classically stable algorithm allowing computation of the phase factors that are needed to build QSP circuits. Existing methods require the use of variable precision arithmetic and can only be applied to polynomials of a relatively low degree. We present here an optimization-based method that can accurately compute the phase factors using standard double precision arithmetic operations. We demonstrate the performance of this approach with applications to Hamiltonian simulation, eigenvalue filtering, and quantum linear system problems. Our numerical results show that the optimization algorithm can find phase factors to accurately approximate polynomials of a degree larger than $10\phantom{\rule{0.16em}{0ex}}000$ with errors below ${10}^{\ensuremath{-}12}$.

Backtracking Algorithms for Constructing the Hamiltonian Decomposition of a 4-regular Multigraph

We consider a Hamiltonian decomposition problem of partitioning a regular graph into edge-disjoint Hamiltonian cycles. It is known that verifying vertex non-adjacency in the 1-skeleton of the symmetric and asymmetric traveling salesperson polytopes is an NP-complete problem. On the other hand, a suffcient condition for two vertices to be non-adjacent can be formulated as a combinatorial problem of finding a Hamiltonian decomposition of a 4-regular multigraph. We present two backtracking algorithms for verifying vertex non-adjacency in the 1-skeleton of the traveling salesperson polytope and constructing a Hamiltonian decomposition: an algorithm based on a simple path extension and an algorithm based on the chain edge fixing procedure. Based on the results of the computational experiments for undirected multigraphs, both backtracking algorithms lost to the known heuristic general variable neighborhood search algorithm. However, for directed multigraphs, the algorithm based on chain fixing of edges showed comparable results with heuristics on instances with existing solutions, and better results on instances of the problem where the Hamiltonian decomposition does not exist.

Perturbative analysis of stochastic Hamiltonian problems under time discretizations

In this work we focus on the study of stochastic Hamiltonian problem driven by additive Wiener noise. In particular, we aim to analyse the behaviour of discretizations to these problems, motivated by some results on stochastic Runge–Kutta methods (SRK) developed by Burrage and Burrage (2012). In fact, SRK methods present a remarkable error that increases with the parameter of the diffusive part of the problem. Through a perturbative analysis, we investigate the reason of this behaviour, leading to a negative answer: retaining the main features of stochastic Hamiltonian problems does not happen straightforwardly for any time discretization. This analysis is also numerically confirmed.

Feasible Bases for a Polytope Related to the Hamilton Cycle Problem

We study a certain polytope depending on a graph G and a parameter β ∈ (0,1) that arises from embedding the Hamiltonian cycle problem in a discounted Markov decision process. Literature suggests a conjecture a lower bound on the proportion of feasible bases corresponding to Hamiltonian cycles in the set of all feasible bases. We make progress toward a proof of the conjecture by proving results about the structure of feasible bases. In particular, we prove three main results: (1) the set of feasible bases is independent of the parameter β when the parameter is close to one, (2) the polytope can be interpreted as a generalized network flow polytope, and (3) we deduce a combinatorial interpretation of the feasible bases. We also provide a full characterization for a special class of feasible bases, and we apply this to provide some computational support for the conjecture.

Gradient algorithm for Hamiltonian identification of open quantum systems

In this paper, we present a gradient algorithm for identifying unknown parameters in an open quantum system from the measurements of time traces of local observables. The open system dynamics is described by a general Markovian master equation based on which the Hamiltonian identification problem can be formulated as minimizing the distance between the real time traces of the observables and those predicted by the master equation. The unknown parameters can then be learned with a gradient descent algorithm from the measurement data. We verify the effectiveness of our algorithm in a circuit QED system described by a Jaynes-Cumming model whose Hamiltonian identification has been rarely considered. We also show that our gradient algorithm can learn the spectrum of a non-Markovian environment based on an augmented system model.

A symplectic indirect approach for a class of nonlinear optimal control problems of differential‐algebraic systems

AbstractDifferential‐algebraic equations (DAEs) can model constrained dynamical systems and processes from practical engineering. Therefore, research on nonlinear optimal control problems of DAEs is of theoretical significance for optimal control of constrained systems, which can generate reference trajectories and control inputs for online control strategies. In terms of the numerical solution of this type of problem, research on indirect numerical methods is still insufficient and less research focuses on symplectic‐preserving methods. In this article, a symplectic indirect approach is proposed for optimal control problems subject to index‐1 DAEs. Necessary conditions of the optimal control problem constitute a Hamiltonian boundary value problem (HBVP) and there exists a symplectic structure in the Hamiltonian system. In the proposed approach, based on specified properties of generating functions, discrete equations can preserve the symplectic structure of the Hamiltonian system. In the iterative solution, the Jacobian matrices of the discrete equations are sparse and symmetric, which are very significant to save memory and improve efficiency in practical computation. In numerical examples, the proposed approach can provide highly accurate state variables and control inputs with fewer iterations. More accurate cost functional can be obtained. Problems from the chemistry process also can be solved effectively, it verifies the problem‐solving ability of the proposed approach.

Pontryagin’s minimum principle based fuzzy adaptive energy management for hybrid electric vehicle using real-time traffic information

Pontryagin's minimum principle (PMP) based energy management strategy, which describes the optimal power distribution of hybrid electric vehicle as Hamiltonian minimization problem, gains the ability to ensure real-time performance and near-optimal solutions, but demonstrates poor cycle adaptability. Therefore, this paper proposes a novel fuzzy adaptive method for the PMP-based optimal strategy by utilizing real-time traffic information that is described by the average velocity and the standard deviation of the velocity on different road segments. The two velocity feature parameters are derived by the data of floating vehicles. A three-layer back-propagation neural network (BP-NN) is constructed to predict the average power with the velocity feature parameters. On the basis of battery charging sustainability, the fuzzy adaptive law is designed to calculate the co-state of the PMP-based strategy using the predicted average power and the actual battery SOC. Finally, the performance of the proposed strategy is evaluated by comparative simulation studies. It is validated that the average velocity and the standard deviation of the velocity can be well evaluated by the information of floating vehicles. Tested by the standard and practical sampled driving cycles, the BP-NN demonstrates good performance in predicting the average power with the selected velocity feature parameters. Compared with the strategy whose co-state is just corrected by the battery SOC in the feed-back manner, the proposed PMP-based fuzzy adaptive method demonstrates superiority in improving the vehicle fuel economy and maintaining the battery charging sustainability under various driving cycles.

Pinned quantum Merlin-Arthur: The power of fixing a few qubits in proofs

What could happen if we pinned a single qubit of a system and fixed it in a particular state? First, we show that this can greatly increase the complexity of static questions -- ground state properties of local Hamiltonian problems with restricted types of terms. In particular, we show that the Pinned commuting and Pinned Stoquastic Local Hamiltonian problems are QMA complete. Second, we show that pinning a single qubit via often repeated measurements also results in universal quantum computation already with commuting and stoquastic Hamiltonians. Finally, we discuss variants of the Ground State Connectivity (GSCON) problem in light of pinning, and show that Stoquastic GSCON is QCMA complete. We hence identify a comprehensive picture of the computational power of pinning, reminiscent of the power of the one clean qubit model.

Application of an improved genetic algorithm to Hamiltonian circuit problem

In the last few years, there has been an increasing interest in Random Constraint Satisfaction Problems (CSP) from both experimental and theoretical points of view. To consider a variant instance of the problems, we used a random benchmark. In the present paper, some work has been done to find the shortest Hamiltonian circuit among specified nodes in each superimposed graph (SGs). The Hamiltonian circuit is a circuit that visits each node in the graph exactly once. The Hamiltonian path may be constructed and adjusted according to specific constraints such as time limits. A new constraint satisfaction optimization problem model for the circuit Hamiltonian circuit problem in a superimposed graph has been presented. To solve this issue, we propose amelioration for the genetic algorithm using Dijkstra’s algorithm, where we create the improved genetic algorithm (IGA). To evaluate this approach, we compare the CPU and fitness values of the IGA to the results provided by an adapted genetic algorithm to find the shortest Hamiltonian circuit in a superimposed graph.

The Oscillation Numbers and the Abramov Method of Spectral Counting for Linear Hamiltonian Systems

In this paper we consider linear Hamiltonian differential systems which depend in general nonlinearly on the spectral parameter and with Dirichlet boundary conditions. For the Hamiltonian problems we do not assume any controllability and strict normality assumptions which guarantee that the classical eigenvalues of the problems are isolated. We also omit the Legendre condition for their Hamiltonians. We show that the Abramov method of spectral counting can be modified for the more general case of finite eigenvalues of the Hamiltonian problems and then the constructive ideas of the Abramov method can be used for stable calculations of the oscillation numbers and finite eigenvalues of the Hamiltonian problems.

An efficient numerical solution for time switching optimal control problems

In this paper, an efficient computational algorithm for the solution of Hamiltonian boundary value problems arising from bang-bang optimal control problems is presented. For this purpose, at first, based on the Pontryagin’s minimum principle, the first order necessary conditions of optimality are derived. Then, an indirect shooting method with control parameterization, in which the control function is replaced with a piecewise constant function with values and switching points taken as unknown parameters, is presented. Thereby, the problem is converted to the solution of the shooting equation, in which the values of the control function and the switching points as well the initial values of the costate variables are unknown parameters. The important advantages of this method are that, the obtained solution satisfies the first order optimality conditions, further the switching points can be captured accurately which is led to an accurate solution of the bangbang problem. However, solving the shooting equation is nearly impossible without a very good initial guess. So, in order to cope with the difficulty of the initial guess, a homotopic approach is combined with the presented method. Consequently, no priori assumptions are made on the optimal control structure and number of the switching points, and sensitivity to the initial guess for the unknown parameters is resolved too. Illustrative examples are included at the end and efficiency of the method is reported.

Analysis of a Greedy Reconstruction Algorithm

A novel and detailed convergence analysis is presented for a greedy algorithm that was previously introduced for operator reconstruction problems in the field of quantum mechanics. This algorithm is based on an offline/online decomposition of the reconstruction process and on an ansatz for the unknown operator obtained by an a priori chosen set of linearly independent matrices. The presented convergence analysis focuses on linear-quadratic (optimization) problems governed by linear differential systems and reveals the strong dependence of the performance of the greedy algorithm on the observability properties of the system and on the ansatz of the basis elements. Moreover, the analysis allows us to use a precise (and in some sense optimal) choice of basis elements for the linear case and led to the introduction of a new and more robust optimized greedy reconstruction algorithm. This optimized approach also applies to nonlinear Hamiltonian reconstruction problems, and its efficiency is demonstrated by numerical experiments.

Bifurcation preserving discretisations of optimal control problems

The first order optimality conditions of optimal control problems (OCPs) can be regarded as boundary value problems for Hamiltonian systems. Variational or symplectic discretisation methods are classically known for their excellent long term behaviour. As boundary value problems are posed on intervals of fixed, moderate length, it is not immediately clear whether methods can profit from structure preservation in this context. When parameters are present, solutions can undergo bifurcations, for instance, two solutions can merge and annihilate one another as parameters are varied. We will show that generic bifurcations of an OCP are preserved under discretisation when the OCP is either directly discretised to a discrete OCP (direct method) or translated into a Hamiltonian boundary value problem using first order necessary conditions of optimality which is then solved using a symplectic integrator (indirect method). Moreover, certain bifurcations break when a non-symplectic scheme is used. The general phenomenon is illustrated on the example of a cut locus of an ellipsoid.

Semianalytical Solutions to the Lighthill–Whitham–Richards Equation With Time-Switched Triangular Diagrams: Application to Variable Speed Limit Traffic Control

This article proposes a new approach for computing a semiexplicit form of the solution to a class of traffic flow problems encoded by a Hamilton-Jacobi (HJ) partial differential equation (PDE), with time-switched Hamiltonian. Using a characterization of the problem derived from viability theory, we show that the solution associated with the problem can be formulated as a minimization problem involving the trajectory of an auxiliary dynamical system. A generalized Lax-Hopf formula for the switched Hamiltonian problem is derived, which enables us to compute the solution associated with affine initial or boundary conditions as a linear program involving the control function of the auxiliary dynamical system. This formulation allows us to compute the solution to the original problem exactly, unlike dynamic programming methods. In addition, this method allows one to very efficiently recompute the boundary conditions associated with an initial condition problem, allowing large-scale variable speed limit traffic control problems to be solved.

Electronic structure with direct diagonalization on a D-wave quantum annealer

Quantum chemistry is regarded to be one of the first disciplines that will be revolutionized by quantum computing. Although universal quantum computers of practical scale may be years away, various approaches are currently being pursued to solve quantum chemistry problems on near-term gate-based quantum computers and quantum annealers by developing the appropriate algorithm and software base. This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. The approach is based on the matrix formulation, efficiently uses qubit resources based on a power-of-two encoding scheme and is hardware-dominant relying on only one classically optimized parameter. We demonstrate the use of D-Wave hardware for obtaining ground and excited electronic states across a variety of small molecular systems. The approach can be adapted for use by a vast majority of electronic structure methods currently implemented in conventional quantum-chemical packages. The results of this work will encourage further development of software such as qbsolv which has promising applications in emerging quantum information processing hardware and has expectation to address large and complex optimization problems intractable for classical computers.

Self-Consistent Calculation of the Localized Orbital Scaling Correction for Correct Electron Densities and Energy-Level Alignments in Density Functional Theory.

The recently developed localized orbital scaling correction (LOSC) method shows the ability to systematically and size-consistently reduce the delocalization error existing in conventional density functional approximations (DFAs). However, the application of LOSC to DFAs was mainly through a post self-consistent field (SCF) manner, and few results from applying LOSC to DFAs in an SCF manner have been reported. The reason is that the originally proposed SCF approach to SCF-LOSC calculation uses an approximate Hamiltonian and encounters convergence problems easily in practice. In this work, we develop a new SCF approach with a correct Hamiltonian and achieve reliable SCF-LOSC calculations. We demonstrate the capability of the new SCF approach for SCF-LOSC to correctly describe the electron densities, total energies, and energy-level alignment for the molecular dissociation process, while conventional DFAs or LOSC-DFAs with post-SCF calculations show large errors. This work demonstrates that the new SCF approach for SCF-LOSC would be a promising method for studying problems for correct electron densities and energy-level alignments in large systems.

Quantum speed limit for robust state characterization and engineering

In this paper, we propose a concept to use a quantum speed limit (QSL) as a measure of robustness of states, defining that a state with bigger QSL is more robust. In this perspective, it is important to have an explicitly-computable QSL, because then we can formulate an engineering problem of Hamiltonian that makes a target state robust against decoherence. Hence we derive a new explicitly-computable QSL that is applicable to general Markovian open quantum systems. This QSL is tighter than another explicitly-computable QSL, in an important setup such that decoherence is small. Also the Hamiltonian engineering problem with this QSL is a quadratic convex optimization problem, and thus it is efficiently solvable. The idea of robust state characterization and the Hamiltonian engineering, in terms of QSL, is demonstrated with several examples.

Hamiltonian decomposition and verifying vertex adjacency in 1-skeleton of the traveling salesperson polytope by variable neighborhood search

We consider a Hamiltonian decomposition problem of partitioning a regular graph into edge-disjoint Hamiltonian cycles. A sufficient condition for vertex adjacency in the 1-skeleton of the traveling salesperson polytope can be formulated as the Hamiltonian decomposition problem in a 4-regular multigraph. We introduce a heuristic general variable neighborhood search algorithm for this problem based on finding a vertex-disjoint cycle cover of the multigraph through reduction to perfect matching and several cycle merging operations. The algorithm has a one-sided error: the answer "not adjacent" is always correct, and was tested on random directed and undirected Hamiltonian cycles and on pyramidal tours.