Meyer David A
Department of Mathematics, University of California, San Diego, La Jolla, CA 92093, USA.
Philos Trans A Math Phys Eng Sci. 2002 Mar 15;360(1792):395-405. doi: 10.1098/rsta.2001.0936.
In the past decade, quantum algorithms have been found which outperform the best classical solutions known for certain classical problems as well as the best classical methods known for simulation of certain quantum systems. This suggests that they may also speed up the simulation of some classical systems. I describe one class of discrete quantum algorithms which do so--quantum lattice-gas automata--and show how to implement them efficiently on standard quantum computers.
在过去十年中,人们发现了一些量子算法,这些算法在某些经典问题上超越了已知的最佳经典解决方案,同时也超越了用于模拟某些量子系统的最佳经典方法。这表明它们也可能加速某些经典系统的模拟。我描述了一类这样做的离散量子算法——量子晶格气体自动机——并展示了如何在标准量子计算机上高效地实现它们。