全连通大问题子Qubo分解的精度和次嵌入：关于数划分问题的一个例子
Accuracy and minor embedding in subqubo decomposition with fully connected large problems: a case study about the number partitioning problem
摘要：
在这项工作中，我们调查的能力的混合量子经典的程序，探索使用D波$2000Q^{TM}$量子退火设备的解决方案空间。在这里，我们研究了量子硬件解决数字划分问题的能力，这是一个著名的NP-Hard优化模型，它带来了现实世界应用中遇到的一些典型挑战。这代表了量子比特连接方面最复杂的场景之一，通过增加输入问题的大小，我们分析了量子经典工作流的缩放特性。我们发现显着的结果在大多数情况下的模型，对于最复杂的，我们进一步研究的D波混合套件。具体来说，我们能够找到最佳的解决方案，即使在最坏的情况下，通过微调的参数，安排退火时间，并允许在退火周期暂停。
英文摘要：
In this work we investigate the capabilities of a hybrid quantum-classical procedure to explore the solution space using the D-Wave $2000Q^{TM}$ Quantum Annealer device. Here we study the ability of the Quantum hardware to solve the Number Partitioning Problem, a well-known NP-Hard optimization model that poses some challenges typical of those encountered in real-world applications. This represents one of the most complex scenario in terms of qubits connectivity and, by increasing the input problem size, we analyse the scaling properties of the quantum-classical workflow. We find remarkable results in most instances of the model; for the most complex ones, we investigate further the D-Wave Hybrid suite. Specifically, we were able to find the optimal solutions even in the worst cases by fine-tuning the parameters that schedule the annealing time and allowing a pause in the annealing cycle.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
