Approaching graph problems with continuous variable quantum computing

Michał Stęchły · Ntwali Bashige · Przemysław Chojecki · 2019 · arXiv 预印本

| 编号 QCV035 | 主题 连续变量与玻色子算术 | 链接 arXiv:1906.07047 |

摘要

摘要保留原文（英文）

摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。

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.

本站词条在引用该文献时，会以 wikilink（sources/QCV035）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。