arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1906.07047quant-ph
收藏

用连续变量量子计算处理图形问题

Approaching graph problems with continuous variable quantum computing

Michał Stęchły, Ntwali Bashige, Przemysław Chojecki

摘要:

我们介绍了一种使用变分算法和连续变量量子计算方法求解最大割问题的方法。该量子线路由两部分组成:第一部分利用Takagi分解将图嵌入到电路中;第二部分是求解最大割问题的变分电路。我们通过数值模拟分析了不同类型的非高斯门的存在如何影响优化过程。我们还提出了如何把电路作为一个机器学习模型。

英文摘要:

We introduce a method for solving the Max-Cut problem using a variational algorithm and a continuous-variables quantum computing approach. The quantum circuit consists of two parts: the first one embeds a graph into a circuit using the Takagi decomposition and the second is a variational circuit which solves the Max-Cut problem. We analyze how the presence of different types of non-Gaussian gates influences the optimization process by performing numerical simulations. We also propose how to treat the circuit as a machine learning model.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑