arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2403.05764quant-phcs.AI
收藏

并行量子退火在多问题同时优化中的潜力研究:一项综合研究

Investigation into the Potential of Parallel Quantum Annealing for Simultaneous Optimization of Multiple Problems: A Comprehensive Study

PricewaterhouseCoopers(普华永道);Innovation Hub(创新中心)

Arit Kumar Bishwas, Anuraj Som, Saurabh Choudhary

AI总结:

本研究探索并行量子退火的潜力与局限,通过多维度实验验证其可减少空闲量子比特,相较传统串行量子退火有望实现大幅加速。

摘要:

并行量子退火是一种同时求解多个优化问题的技术,其目标是通过在单个退火周期内处理多个独立问题,优化量子拓扑上可用量子比特的利用率。本研究深入揭示了该并行化方法的潜力与局限性。实验整合了两类不同问题,探索了多种问题维度,还采用了DWaveSampler(默认嵌入)、DWaveSampler(自定义嵌入)及LeapHybridSampler等特定方法的归一化技术。与传统串行求解、可能导致量子比特闲置的量子退火相比,该方法可减少空闲量子比特,且Time-to-Solution(TTS,求解时间)指标显示其有望实现大幅加速。

英文摘要:

Parallel Quantum Annealing is a technique to solve multiple optimization problems simultaneously. Parallel quantum annealing aims to optimize the utilization of available qubits on a quantum topology by addressing multiple independent problems in a single annealing cycle. This study provides insights into the potential and the limitations of this parallelization method. The experiments consisting of two different problems are integrated, and various problem dimensions are explored including normalization techniques using specific methods such as DWaveSampler with Default Embedding, DWaveSampler with Custom Embedding and LeapHybridSampler. This method minimizes idle qubits and holds promise for substantial speed-up, as indicated by the Time-to-Solution (TTS) metric, compared to traditional quantum annealing, which solves problems sequentially and may leave qubits unutilized.

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

↑