arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.01735quant-ph
收藏

通用统计模拟器

Universal Statistical Simulator

Mark Carney, Ben Varcoe

摘要:

量子傅里叶变换是量子计算中的一个著名例子,因为它是量子计算机比经典计算机快指数的有用算法的第一个演示。然而,在解释加速时,理解经典计算的计算复杂度必须基于信念。此外,这个解释还附带了一个警告,即当前的经典计算可能会得到改进。在本文中,我们提出了一个量子计算机代码的高尔顿板模拟器,是指数速度比经典的计算使用一个例子,可以直观地理解,而不需要了解计算复杂性。我们演示了一个简单的量子计算机上的实现,只使用三种类型的量子门,它使用$\mathcal{O} (n^2)$资源计算$2^n$轨迹。这里提出的电路也受益于具有较低的深度比以前的量子高尔顿板,此外,我们表明,它可以扩展到一个通用的统计模拟器,这是通过删除钉和改变每个钉的左右比。

英文摘要:

The Quantum Fourier Transform is a famous example in quantum computing for being the first demonstration of a useful algorithm in which a quantum computer is exponentially faster than a classical computer. However when giving an explanation of the speed up, understanding computational complexity of a classical calculation has to be taken on faith. Moreover, the explanation also comes with the caveat that the current classical calculations might be improved. In this paper we present a quantum computer code for a Galton Board Simulator that is exponentially faster than a classical calculation using an example that can be intuitively understood without requiring an understanding of computational complexity. We demonstrate a straight forward implementation on a quantum computer, using only three types of quantum gate, which calculates $2^n$ trajectories using $\mathcal{O} (n^2)$ resources. The circuit presented here also benefits from having a lower depth than previous Quantum Galton Boards, and in addition, we show that it can be extended to a universal statistical simulator which is achieved by removing pegs and altering the left-right ratio for each peg.

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

↑