Experimental Analysis of Quantum Annealers and Hybrid Solvers Using Benchmark Optimization Problems

Mathematics

Theodore Andronikos¹  Christos Papalitsas¹  Evangelos Stogiannos¹ 

[1]Department of Informatics, Ionian University, 7 Tsirigoti Square, 49100 Corfu, Greece

关键词: optimization;    metaheuristics;    Hamiltonian cycle;    TSP;    quantum annealing;    QUBO;   

DOI  :  10.3390/math10081294

来源: DOAJ

【 摘 要 】

This paper studies the Hamiltonian cycle problem (HCP) and the traveling salesman problem (TSP) on D-Wave quantum systems. Motivated by the fact that most libraries present their benchmark instances in terms of adjacency matrices, we develop a novel matrix formulation for the HCP and TSP Hamiltonians, which enables the seamless and automatic integration of benchmark instances in quantum platforms. We also present a thorough mathematical analysis of the precise number of constraints required to express the HCP and TSP Hamiltonians. This analysis explains quantitatively why, almost always, running incomplete graph instances requires more qubits than complete instances. It turns out that QUBO models for incomplete graphs require more quadratic constraints than complete graphs, a fact that has been corroborated by a series of experiments. Moreover, we introduce a technique for the min-max normalization for the coefficients of the TSP Hamiltonian to address the problem of invalid solutions produced by the quantum annealer, a trend often observed. Our extensive experimental tests have demonstrated that the D-Wave Advantage_system4.1 is more efficient than the Advantage_system1.1, both in terms of qubit utilization and the quality of solutions. Finally, we experimentally establish that the D-Wave hybrid solvers always provide valid solutions, without violating the given constraints, even for arbitrarily big problems up to 120 nodes.

【 授权许可】

Unknown