TL;DR本文使用少数嵌入和参数设置,通过实现 Ising 自旋 - 1/2 哈密顿量的绝热量子计算机,证明了在量子硬件图 U 中,可以解决图 G 上的 NP-hard 二次无约束二进制优化问题。
Abstract
We show that the NP-hard quadratic unconstrained binary optimization (QUBO)
problem on a graph $G$ can be solved using an adiabatic quantum computer that
implements an Ising spin-1/2 Hamiltonian, by reduction thr