arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1412.0625cs.PLcs.ETquant-ph
收藏

Quipper:量子算法中的具体资源估计

Quipper: Concrete Resource Estimation in Quantum Algorithms

Jonathan M. Smith, Neil J. Ross, Peter Selinger, Benoît Valiron

摘要:

尽管有丰富的量子算法文献,但令人惊讶的是,它们的具体逻辑设计和实现的覆盖面很小。大多数资源估计是在复杂性分析的层面上完成的,但实际的具体数量(量子门,量子比特等)会有数量级的差异我们在这里介绍的工作是一个编写和推理量子算法的正式框架。具体来说,我们设计了一种考虑可扩展性的语言Quipper,并且能够报告量子计算机科学文献中发现的七种非平凡算法的实际资源计数。

英文摘要:

Despite the rich literature on quantum algorithms, there is a surprisingly small amount of coverage of their concrete logical design and implementation. Most resource estimation is done at the level of complexity analysis, but actual concrete numbers (of quantum gates, qubits, etc.) can differ by orders of magnitude. The line of work we present here is a formal framework to write, and reason about, quantum algorithms. Specifically, we designed a language, Quipper, with scalability in mind, and we are able to report actual resource counts for seven non-trivial algorithms found in the quantum computer science literature.

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

↑