vix.ing · top · new · best · stats · spec

Performance of hybrid quantum/classical variational heuristics for combinatorial optimization

2018/05/31 by Giacomo Nannicini · 1 citation
Physics and Astronomy · Computer Science · #quant-ph #cs.DM #msc:90C27

paper · pdf · doi:10.1103/physreve.99.013304

published as Phys. Rev. E 99, 013304 (2019) · Additional experiments to quantify the effect of entanglement, or lack thereof

arxiv created 2018/12/13 · arxiv updated 2019/01/23

Abstract

The recent literature on near-term applications for quantum computers contains several examples of the applications of hybrid quantum/classical variational approaches. This methodology can be applied to a variety of optimization problems, but its practical performance is not well studied yet. This paper moves some steps in the direction of characterizing the practical performance of the methodology, in the context of finding solutions to classical combinatorial optimization problems. Our study is based on numerical results obtained applying several classical nonlinear optimization algorithms to Hamiltonians for six combinatorial optimization problems; the experiments are conducted via noise-free classical simulation of the quantum circuits implemented in Qiskit. We empirically verify that: (1) finding the ground state is harder for Hamiltonians with many Pauli terms; (2) classical global optimization methods are more successful than local methods due to their ability of avoiding the numerous local optima; (3) there does not seem to be a clear advantage in introducing entanglement in the variational form.

Cited by