Quantum computing in molecular magnets

  title={Quantum computing in molecular magnets},
  author={Michael N. Leuenberger and Daniel Loss},
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… 

Operating Quantum States in Single Magnetic Molecules: Implementation of Grover's Quantum Algorithm.

Grover's quantum algorithm is implemented, proposed to find an element in an unsorted list, using a single nuclear 3/2 spin carried by a Tb ion sitting in a single molecular magnet transistor, opening the way to novel quantum search algorithms.

Quantum information processing using molecular nanomagnets as qubits.

One of the most promising systems—and one where chemists can make a very significant contribution through the synthesis of appropriate molecules—involves using molecular nanomagnets using the Shor algorithm to implement QIP.

Molecular spins for quantum computation

Chemistry can contribute to designing robust spin systems based, in particular, on mononuclear lanthanoid complexes, the elementary unit of future quantum computers.

Electron spin resonance of molecular magnets for quantum information processing

Quantum information processors have been shown theoretically to outperform their classical counterparts at certain tasks. They comprise two level systems, which can exist in an arbitrary

Molecular spin qudits for quantum algorithms.

How a molecular nuclear spin qudit, (d = 4), known as TbPc2, gathers all the necessary requirements to perform as a molecular hardware platform with a first generation of molecular devices enabling even quantum algorithm operations is reviewed.

Artificial Molecular Nanomagnets as Spin-Based Quantum Logic Gates

It is shown that molecular clusters containing two Tb3+ ions meet all ingredients required to implement a CNOT quantum logic gate, and can open promising avenues for the realization of scalable quantum computing architectures.

Superconducting Devices for Quantum Computation

It is argued that superconducting devices have some unique properties, which may make them ideally suitable for the implementation of qubits, and prospects for exploiting this quantum coherence as a possible practical realization of qubit devices are discussed.

Spin decoherence of electrons and holes in semiconductor quantum dots

The computer industry has seen an immense development in the last decades. Personal computers have become available for everybody living in industrialized countries with rapidly increasing

Possibilities of a classical alternative to a quantum computer

The dramatic increase in the efficiency of a quantum computer over a classical computer, raises a natural question asking, how much of this success could be attributed to its quantum nature and how



Two-bit gates are universal for quantum computation.

  • DiVincenzo
  • Physics
    Physical review. A, Atomic, molecular, and optical physics
  • 1995
A proof is given, which relies on the commutator algebra of the unitary Lie groups, that quantum gates operating on just two bits at a time are sufficient to construct a general quantum circuit. The

Quantum search without entanglement

This paper presents methods for quantum search that give a speed-up over classical methods, but that do not require entanglement, and rely instead on interference to provide aSpeed-up.

Quantum information is physical

We discuss a few current developments in the use of quantum mechanically coherent systems for information processing. In each of these developments, Rolf Landauer has played a crucial role in nudging

Quantum Mechanics Helps in Searching for a Needle in a Haystack

Quantum mechanics can speed up a range of search applications over unsorted data. For example, imagine a phone directory containing $N$ names arranged in completely random order. To find someone's

Quantum computing with antiferromagnetic spin clusters

We show that a wide range of spin clusters with antiferromagnetic intracluster exchange interaction allows one to define a qubit. For these spin cluster qubits, initialization, quantum gate

Algorithms for quantum computation: discrete logarithms and factoring

  • P. Shor
  • Computer Science
    Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 1994
Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number of steps which is polynomial in the input size, e.g., the number of digits of the integer to be factored are given.

Quantum computation with quantum dots

We propose an implementation of a universal set of one- and two-quantum-bit gates for quantum computation using the spin states of coupled single-electron quantum dots. Desired operations are

Quantum Computation and Shor's Factoring Algorithm

A brief introduction to the model of quantum computation and to its main success so far: Peter Shor's eecient quantum algorithm for factoring integers.

Spin-orbit coupling and time-reversal symmetry in quantum gates

We study the effect of spin-orbit coupling on quantum gates produced by pulsing the exchange interaction between two single-electron quantum dots. Spin-orbit coupling enters as a small spin

Macroscopic quantum tunnelling of magnetization in a single crystal of nanomagnets

THE precise manner in which quantum-mechanical behaviour at the microscopic level underlies classical behaviour at the macroscopic level remains unclear, despite seventy years of theoretical