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

量子线路的门级模拟

Gate-Level Simulation of Quantum Circuits

George F. Viamontes, Manoj Rajagopalan, Igor L. Markov, John P. Hayes

摘要:

虽然成千上万的实验物理学家和化学家目前正试图建立可扩展的量子计算机,但量子计算的模拟似乎至少与经典VLSI设计中的电路模拟一样重要。然而,自从理查德·费曼在20世纪80年代初的工作以来,在实际的量子模拟方面几乎没有取得什么进展。大多数研究人员专注于有限类型的量子线路的多项式时间模拟,这些电路无法实现量子计算的全部功能。在经典硬件上模拟量子计算设备和有用的量子算法现在需要过多的计算资源,使得许多重要的模拟任务不可行。在这项工作中,我们提出了一种新的技术门级模拟的量子线路,大大降低了这种模拟的难度和成本。所提出的技术是在一个称为量子信息决策图(QuIDD)的仿真工具中实现的,并通过模拟Grover的量子搜索算法进行评估。我们的软件包QuIDD Pro的后端基于二元决策图,以其有效表示许多看似棘手的组合结构的能力而闻名。这种依赖于一个成熟的研究领域,使我们能够利用现有的软件进行BDD操作,并实现无与伦比的经验结果的量子模拟。

英文摘要:

While thousands of experimental physicists and chemists are currently trying to build scalable quantum computers, it appears that simulation of quantum computation will be at least as critical as circuit simulation in classical VLSI design. However, since the work of Richard Feynman in the early 1980s little progress was made in practical quantum simulation. Most researchers focused on polynomial-time simulation of restricted types of quantum circuits that fall short of the full power of quantum computation. Simulating quantum computing devices and useful quantum algorithms on classical hardware now requires excessive computational resources, making many important simulation tasks infeasible. In this work we propose a new technique for gate-level simulation of quantum circuits which greatly reduces the difficulty and cost of such simulations. The proposed technique is implemented in a simulation tool called the Quantum Information Decision Diagram (QuIDD) and evaluated by simulating Grover's quantum search algorithm. The back-end of our package, QuIDD Pro, is based on Binary Decision Diagrams, well-known for their ability to efficiently represent many seemingly intractable combinatorial structures. This reliance on a well-established area of research allows us to take advantage of existing software for BDD manipulation and achieve unparalleled empirical results for quantum simulation.

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

↑