arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2204.00340quant-phcond-mat.quant-gas
收藏

面向量子多态系统的量子近似优化算法

Quantum approximate optimization algorithm for qudit systems

Yannick Deller, Sebastian Schmitt, Maciej Lewenstein, Steve Lenk, Marika Federer, Fred Jendrzejewski, Philipp Hauke, Valentin Kasper

AI总结:

本研究面向整数优化场景,提出基于量子多态系统(qudit)的量子近似优化算法(QAOA),给出三类约束实现方法,并通过充电优化的数值实验验证了qudit系统求解此类问题的灵活性。

摘要:

量子计算平台的常见起点是双态量子系统,即量子比特(qubit)。然而,在与调度优化、运筹学相关的整数优化问题场景中,采用具有两个以上基态的量子系统——即量子多态系统(qudit)——往往资源效率更高。本文讨论了面向qudit系统的量子近似优化算法(QAOA),阐述了如何利用QAOA构建各类整数优化问题,如图着色问题、电动汽车(EV)充电优化问题。此外,本文还评述了约束的实现方式,介绍了三种将约束纳入QAOA量子电路的方法:对成本哈密顿量施加惩罚项、使用辅助量子比特的条件门、以及动力学解耦策略。最后,作为基于qudit的QAOA的应用展示,本文给出了映射为最大k-图着色问题的充电优化问题的数值结果。本研究体现了qudit系统在求解整数优化问题上的灵活性。

英文摘要:

A frequent starting point of quantum computation platforms are two-state quantum systems, i.e., qubits. However, in the context of integer optimization problems, relevant to scheduling optimization and operations research, it is often more resource-efficient to employ quantum systems with more than two basis states, so-called qudits. Here, we discuss the quantum approximate optimization algorithm (QAOA) for qudit systems. We illustrate how the QAOA can be used to formulate a variety of integer optimization problems such as graph coloring problems or electric vehicle (EV) charging optimization. In addition, we comment on the implementation of constraints and describe three methods to include these into a quantum circuit of a QAOA by penalty contributions to the cost Hamiltonian, conditional gates using ancilla qubits, and a dynamical decoupling strategy. Finally, as a showcase of qudit-based QAOA, we present numerical results for a charging optimization problem mapped onto a max-$k$-graph coloring problem. Our work illustrates the flexibility of qudit systems to solve integer optimization problems.

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

↑