• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Computational Science >Revisiting Old Combinatorial Beasts in the Quantum Age: Quantum Annealing Versus Maximal Matching
【24h】

Revisiting Old Combinatorial Beasts in the Quantum Age: Quantum Annealing Versus Maximal Matching

机译：重温量子时代的旧组合野兽：量子退火与最大匹配

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper experimentally investigates the behavior of analog quantum computers such as commercialized by D-Wave when confronted to instances of the maximum cardinality matching problem specifically designed to be hard to solve by means of simulated annealing. We benchmark a D-Wave "Washington" (2X) with 1098 operational qubits on various sizes of such instances and observe that for all but the most trivially small of these it fails to obtain an optimal solution. Thus, our results suggest that quantum annealing, at least as implemented in a D-Wave device, falls in the same pitfalls as simulated annealing and therefore provides additional evidences suggesting that there exist polynomial-time problems that such a machine cannot solve efficiently to optimality.
机译：本文通过实验研究了诸如D-Wave商业化的模拟量子计算机在遇到最大基数匹配问题实例时的行为，该问题被专门设计为难以通过模拟退火解决。我们在各种大小的此类实例上对具有1098个操作量子位的D-Wave“华盛顿”（2X）进行了基准测试，并观察到，除了最微小的实例以外，对于所有其他实例，它都无法获得最佳解决方案。因此，我们的结果表明，至少在D-Wave器件中实施的量子退火与模拟退火具有相同的陷阱，因此提供了其他证据，表明存在多项式时间问题，即此类机器无法有效地求解最优问题。 。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号