...
首页> 外文期刊>International journal of unconventional computing >An Equivalent QUBO Model to the Minimum Multi-Way Cut Problem
【24h】

An Equivalent QUBO Model to the Minimum Multi-Way Cut Problem

机译:An Equivalent QUBO Model to the Minimum Multi-Way Cut Problem

获取原文
获取原文并翻译 | 示例
           

摘要

Motivated by an application in Computer Vision, we present an efficient QUBO solution for the minimum multi-way cut problem. For an edge-weighted input graph G = (V, E) and a set of terminals T = {t_1, t_2,...,} ? V we want to find a subset of edges E_c of minimum total cost such that G' = GE_c separates T. QUBO representations are useful for solving problems on an adiabatic quantum computer like those produced by D-Wave Systems. Our reduction from the multi-way cut problem requires only O(kV) binary variables/qubits. The main result of this paper is a proof of correctness of this model. Furthermore, our reduction is small enough to be able to empirically test it with an existing D-Wave hybrid quantum-classical solver, which is illustrated at the end of this paper.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号