# Quantum computing in molecular magnets

Leuenberger, M. N. and Loss, D.. (2001) Quantum computing in molecular magnets. Nature, Vol. 410, H. 6830. pp. 789-793.

Full text not available from this repository.

Official URL: http://edoc.unibas.ch/dok/A5254734

Shor and Grover demonstrated that a quantum computer can outperform any classical computer in factoring numbers(1) and in searching a database(2) by exploiting the parallelism of quantum mechanics. Whereas Shors algorithm requires both superposition and entanglement of a many-particle system(3), the superposition of single-particle quantum states is sufficient for Grovers algorithm(4). Recently, the latter has been successfully implemented(5) using Rydberg atoms. Here we propose an implementation of Grover`s algorithm that uses molecular magnets(6-10), 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 10(5), with access times as short as 10(-10) seconds. We show that our proposal should be feasible using the molecular magnets Fe-8 and Mn-12.