混合系统中量子索引搜索的迭代量子比特管理
Iterative Qubits Management for Quantum Index Searching in a Hybrid System
摘要:
量子计算系统的最新进展引起了极大的关注。商业公司,如IBM、亚马逊和IonQ,已经开始提供对噪声中等规模量子计算机的访问。研究人员和企业家试图部署旨在实现量子加速的应用程序。Grover算法和量子相位估计是许多具有这种加速潜力的应用的基础。虽然这些算法在理论上获得了惊人的性能,但将它们部署在现有的量子设备上是一项具有挑战性的任务。例如,量子相位估计需要额外的量子比特和大量的受控操作,这由于低量子比特和噪声硬件而不切实际。为了充分利用有限的板载量子比特,我们提出了IQuCS,其目的是在量子经典混合系统中进行索引搜索和计数。IQuCS基于Grover算法。从问题规模的角度来看,它分析结果,并试图迭代地过滤掉不太可能的数据点。在下一次迭代中,减少的数据集被馈送到量子计算机。随着问题规模的减小,IQuCS迭代地需要更少的量子位,这为共享计算环境提供了潜力。我们用Qiskit实现了IQuCS,并进行了深入的实验。结果表明,它将量子比特的消耗减少了66.2%。
英文摘要:
Recent advances in quantum computing systems attract tremendous attention. Commercial companies, such as IBM, Amazon, and IonQ, have started to provide access to noisy intermediate-scale quantum computers. Researchers and entrepreneurs attempt to deploy their applications that aim to achieve a quantum speedup. Grover's algorithm and quantum phase estimation are the foundations of many applications with the potential for such a speedup. While these algorithms, in theory, obtain marvelous performance, deploying them on existing quantum devices is a challenging task. For example, quantum phase estimation requires extra qubits and a large number of controlled operations, which are impractical due to low-qubit and noisy hardware. To fully utilize the limited onboard qubits, we propose IQuCS, which aims at index searching and counting in a quantum-classical hybrid system. IQuCS is based on Grover's algorithm. From the problem size perspective, it analyzes results and tries to filter out unlikely data points iteratively. A reduced data set is fed to the quantum computer in the next iteration. With a reduction in the problem size, IQuCS requires fewer qubits iteratively, which provides the potential for a shared computing environment. We implement IQuCS with Qiskit and conduct intensive experiments. The results demonstrate that it reduces qubits consumption by up to 66.2%.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。