Scholarlink

<p>An important and difficult problem in optimization is the high-order unconstrained binary optimization, which can represent many optimization problems more efficiently than quadratic unconstrained binary optimization, but how to quickly solve it has remained difficult. Here, we present an approach by mapping the high-order unconstrained binary optimization to quantum <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="42005_2025_2072_Article_IEq2.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="18" /> </InlineMediaObject> <EquationSource Format="TEX">\({{\mathbb{Z}}}_{2}\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mrow> <mi mathvariant="double-struck">Z</mi> </mrow> <mrow> <mn>2</mn> </mrow> </msub> </math></EquationSource> </InlineEquation> lattice gauge theory and propose the gauged local quantum annealing, which is the local quantum annealing protected by the gauge symmetry. We present the quantum algorithm and its corresponding quantum-inspired classical algorithm for this problem and achieve algorithmic speedup by using gauge symmetry. By running the quantum-inspired classical algorithm, we demonstrate that the gauged local quantum annealing reduces the computational time by one order of magnitude from that of the local quantum annealing.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Speedup of high-order unconstrained binary optimization using quantum \({{\mathbb{Z}}}_{2}\) lattice gauge theory

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年4月11日

查看全文
  • Bi-Ying Wang,
  • Xiaopeng Cui,
  • Qingguo Zeng,
  • Yemin Zhan,
  • Man-Hong Yung,
  • Yu Shi

摘要

An important and difficult problem in optimization is the high-order unconstrained binary optimization, which can represent many optimization problems more efficiently than quadratic unconstrained binary optimization, but how to quickly solve it has remained difficult. Here, we present an approach by mapping the high-order unconstrained binary optimization to quantum \({{\mathbb{Z}}}_{2}\) Z 2 lattice gauge theory and propose the gauged local quantum annealing, which is the local quantum annealing protected by the gauge symmetry. We present the quantum algorithm and its corresponding quantum-inspired classical algorithm for this problem and achieve algorithmic speedup by using gauge symmetry. By running the quantum-inspired classical algorithm, we demonstrate that the gauged local quantum annealing reduces the computational time by one order of magnitude from that of the local quantum annealing.