Leuenberger M N, Loss D
Department of Physics and Anatomy, University of Basel, Switzerland.
Nature. 2001 Apr 12;410(6830):789-93. doi: 10.1038/35071024.
Shor and Grover demonstrated that a quantum computer can outperform any classical computer in factoring numbers and in searching a database by exploiting the parallelism of quantum mechanics. Whereas Shor's algorithm requires both superposition and entanglement of a many-particle system, the superposition of single-particle quantum states is sufficient for Grover's algorithm. Recently, the latter has been successfully implemented using Rydberg atoms. Here we propose an implementation of Grover's algorithm that uses molecular magnets, which are solid-state systems with a large spin; their spin eigenstates make them natural candidates for single-particle systems. We show theoretically that molecular magnets can be used to build dense and efficient memory devices based on the Grover algorithm. In particular, one single crystal can serve as a storage unit of a dynamic random access memory device. Fast electron spin resonance pulses can be used to decode and read out stored numbers of up to 105, with access times as short as 10-10 seconds. We show that our proposal should be feasible using the molecular magnets Fe8 and Mn12.
肖尔和格罗弗证明，量子计算机通过利用量子力学的并行性，在因数分解和数据库搜索方面可以超越任何经典计算机。肖尔算法需要多粒子系统的叠加和纠缠，而格罗弗算法仅单粒子量子态的叠加就足够了。最近，后者已使用里德堡原子成功实现。在此，我们提出一种使用分子磁体实现格罗弗算法的方案，分子磁体是具有大自旋的固态系统；它们的自旋本征态使其成为单粒子系统的天然候选者。我们从理论上表明，分子磁体可用于构建基于格罗弗算法的密集且高效的存储设备。特别是，一块单晶可作为动态随机存取存储器设备的存储单元。快速电子自旋共振脉冲可用于解码和读出存储的高达105的数字，访问时间短至10-10秒。我们表明，使用分子磁体Fe8和Mn12，我们的方案应该是可行的。
