This paper studies the Hamiltonian Cycle Problem (HCP) and the Traveling Salesman Problem (TSP) on D-Wave's quantum systems. Initially, motivated by the fact that most libraries present their benchmark instances in terms of adjacency matrices, we develop a novel matrix formulation for the HCP and TSP Hamiltonians, which enables the seamless and automatic integration of benchmark instances in quantum platforms. our extensive experimental tests have led us to some interesting conclusions. D-Wave's {\tt Advantage\_system4.1} is more efficient than {\tt Advantage\_system1.1} both in terms of qubit utilization and quality of solutions. Finally, we experimentally establish that D-Wave's Hybrid solvers always provide a valid solution to a problem, without violating the QUBO constraints, even for arbitrarily big problems, of the order of $120$ nodes. When solving TSP instances, the solutions produced by the quantum annealer are often invalid, in the sense that they violate the topology of the graph. To address this use we advocate the use of \emph{min-max normalization} for the coefficients of the TSP Hamiltonian. Finally, we present a thorough mathematical analysis on the precise number of constraints required to express the HCP and TSP Hamiltonians. This analysis, explains quantitatively why, almost always, running incomplete graph instances requires more qubits than complete instances. It turns out that incomplete graph require more quadratic constraints than complete graphs, a fact that has been corroborated by a series of experiments.
Garden optimization problems for benchmarking quantum annealers
我们对5000+量子位系统Advantage与D-Wave Systems Inc.发布的混合求解器服务2进行了基准测试。在2020年9月,通过使用一类新的优化问题,称为花园优化问题,在同伴种植中已知。这些问题可扩展到任意大量的变量,并直观地在现实世界的场景中找到应用。我们推导出他们的QUBO制定,并说明他们的关系,二次分配问题。我们证明了优势系统和新的混合求解器可以解决更大的问题,在更短的时间比他们的前辈。然而,我们还表明,基于2000+量子比特系统DW 2000 Q的求解器有时会产生更有利的结果,如果他们可以解决问题。
Quantum-inspired dynamical models on quantum and classical annealers
Institute of Theoretical and Applied Informatics, Polish Academy of Sciences(波兰科学院理论与应用信息学研究所);Sorbonne Université, Faculté des Sciences et Ingénierie(索邦大学科学与工程学院);Quantumz.io Sp. z o.o.(Quantumz.io有限公司);Jülich Supercomputing Centre, Institute for Advanced Simulation, Forschungszentrum Jülich(于利希研究中心高级模拟研究所超算中心);Institut für Theoretische Physik, Universität Tübingen(蒂宾根大学理论物理研究所)
Control of automated guided vehicles without collision by quantum annealer and digital devices
Graduate School of Information Sciences, Tohoku University(东北大学信息科学研究生院);Institute of Innovative Research, Tokyo Institute of Technology(东京技术大学创新研究所);Electronics R & I Division, DENSO CORPORATION(DENSO公司电子研究与开发部)
A hybrid classical-quantum approach to solve the heat equation using quantum annealers
在计算物理中,偏微分方程的离散化求解是一个普遍存在的问题。在这项工作中,我们基准这种方法在量子领域通过求解热方程的方形板受到固定的温度在边缘和随机热源和域内的散热器。混合经典-量子方法在于在量子计算机上求解离散化步骤产生的耦合线性方程组。由于量子位数及其连通性的限制,我们使用高斯-赛德尔方法将整个线性方程组划分为子系统,以块的方式迭代求解。每个线性子系统使用由D-Wave Systems Inc.开发的2000 Q和Advantage量子计算机来求解。通过比较经典数值解和量子解,我们观察到2000 Q系统的误差和链断裂分数平均更大。与经典的Gauss-Seidel方法不同,量子解的误差在我们算法的几次迭代后趋于平稳。这在一定程度上是由于实数线的跨度可从量子位状态的集合的所选大小的映射获得。我们通过使用技术来逐步缩小每次迭代时量子位状态集映射的范围(提高浮点精度)来验证这一点。结果,没有观察到水平。然而,量子比特的增加并不能转化为整体较低的误差。这被认为表明了映射到实数所需的链的长度增加以及随之而来的硬件限制。
Thermodynamic significance of QUBO encoding on quantum annealers
University of Massachusetts, Boston(马萨诸塞大学波士顿分校);University of Maryland, Baltimore County(马里兰大学巴尔的摩县分校);Quantum Science Institute, University of Maryland, Baltimore County(马里兰大学巴尔的摩县分校量子科学研究所);Universität Tübingen(蒂宾根大学);Forschungszentrum Jülich(于利希研究中心);Polish Academy of Sciences(波兰科学院)
Scalable Determination of Penalization Weights for Constrained Optimizations on Approximate Solvers
Quantum Research Center, Technology Innovation Institute (TII)(技术革新研究所量子研究中心);SISSA — Scuola Internazionale Superiore di Studi Avanzati(国际高等研究学院);Centre for Quantum Technologies, National University of Singapore(新加坡国立大学量子技术中心);Hamburg University of Technology, Institute for Quantum Inspired and Quantum Optimization(汉堡工业大学量子启发与量子优化研究所);Fujitsu Germany GmbH(富士通德国有限公司)
A Path Towards Quantum Advantage in Training Deep Generative Models with Quantum Annealers
NASA Ames Research Center(美国国家航空航天局艾姆斯研究中心);Stinger Ghaffarian Technologies Inc.(斯汀格·加法里安技术公司);D-Wave Systems Inc.(D-Wave系统公司);University of Florence(佛罗伦萨大学);Simon Fraser University(西蒙弗雷泽大学)
Improving solutions by embedding larger subproblems in a D-Wave quantum annealer
量子退火是解决组合优化问题的启发式算法,D-Wave Systems Inc.开发了该算法的硬件实现。然而,一般来说,我们不能嵌入大规模问题的所有逻辑变量,因为可用的量子位的数量是有限的。为了处理一个大问题,qbsolv被提出作为一种方法,用于将原始的大问题划分为可嵌入D-Wave量子退火器的子问题,然后使用量子退火器迭代优化子问题。在子问题的多个逻辑变量同时更新,在这个迭代求解器,并使用这种方法,我们希望获得更好的解决方案比可以通过传统的局部搜索算法。虽然嵌入大子问题是必不可少的,以提高该计划中的解决方案的精度,子问题的大小是小的qbsolv,因为子问题基本上是通过使用一个完整的图,即使是稀疏的问题图的嵌入。这意味着D-Wave量子退火机的资源没有得到有效利用。在本文中,我们提出了一个快速算法嵌入较大的子问题,我们表明,更好的解决方案,有效地嵌入较大的子问题。