arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.01975quant-ph
收藏

对驱动哈密顿量和混合算符施加约束:从理论到实际实现

Imposing Constraints on Driver Hamiltonians and Mixing Operators: From Theory to Practical Implementation

Fujitsu Research of America(富士通美国研究所);Information Sciences Institute, University of Southern California(南加州大学信息科学研究所);Department of Computer Science, University of Southern California(南加州大学计算机系);Quantum Artificial Intelligence Laboratory (QuAIL), NASA Ames Research Center(NASA阿姆斯研究中心量子人工智能实验室(QuAIL));USRA Research Institute for Advanced Computer Science (RIACS)(美国大学空间研究协会先进计算机科学研究所(RIACS));Department of Electrical and Computer Engineering, University of Southern California(南加州大学电气与计算机工程系)

Hannes Leipold, Federico M. Spedalieri, Stuart Hadfield, Eleanor Rieffel

AI总结:

本文给出满足约束的哈密顿项和酉原语的代数表达式,证明一般情况下的NP完全性,但提供常数局域性算子的多项式算法,并应用于约束量子退火和量子交替算子ansatz构造,提出基于最大不相交子集的新QAOA方法,在1-in-3 SAT问题上显著优于X-mixer。

摘要:

满足约束的驱动哈密顿量和混合算符是许多量子算法ansatz构造的重要组成部分。本文给出了寻找满足约束嵌入的哈密顿项以及类似酉原语的一般代数表达式,并利用这些表达式给出了相关问题的复杂度刻画。我们证明,在一般情况下,判断是否存在强制经典约束的算子是NP完全的,但给出了在常数局域性界下寻找任何算子的最坏情况多项式时间算法过程;这是一个有用的结果,因为实践中许多约束允许局部算子来强制实现。然后,我们给出了将这些代数原语转化为哈密顿驱动和酉混合器的算法过程,这些驱动和混合器可用于约束量子退火(CQA)和量子交替算子ansatz(QAOA)构造,通过解决与寻找合适的简化生成子集以及相应地定义驱动和混合器相关的实际问题。我们考虑了一种基于最大不相交子集的新QAOA方法,以及针对1-in-3 SAT的高阶约束满足项,这些方法显著优于X-mixer。

英文摘要:

Driver Hamiltonians and Mixing Operators that satisfy constraints is an important part of ansatz construction for many quantum algorithms. In this manuscript, we give general algebraic expressions for finding Hamiltonian terms and analogously unitary primitives, that satisfy constraint embeddings and use these to give complexity characterizations of the related problems. We prove that knowing if operators exist that enforce classical constraints is NP-Complete in the general case, but give algorithmic procedures with worse-case polynomial runtime to find any operators with a constant locality bound; a useful result since many constraints imposed admit local operators to enforce them in practice. We then give algorithmic procedures to turn these algebraic primitives into Hamiltonian drivers and unitary mixers that can be used for Constrained Quantum Annealing (CQA) and Quantum Alternating Operator Ansatz (QAOA) constructions by tackling practical problems related to finding an appropriate set of reduced generators and defining corresponding drivers and mixers accordingly. We consider a new QAOA approach based on the maximally disjoint subset as well as higher order constraint satisfaction terms for 1-in-3 SAT, which dramatically outperform the X-mixer.

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

↑