Quantum computation as geometry

Quantum computers hold great promise for solving interesting computational problems, but it remains a challenge to find efficient quantum circuits that can perform these complicated tasks. Here we show that finding optimal quantum circuits is essentially equivalent to finding the shortest path between two points in a certain curved geometry. By recasting the problem of finding quantum circuits as a geometric problem, we open up the possibility of using the mathematical techniques of Riemannian geometry to suggest new quantum algorithms or to prove limitations on the power of quantum computers.

Spin-detection in a quantum electromechanical shuttle system

We study the electrical transport of a harmonically bound, single-molecule C-60 shuttle operating in the Coulomb blockade regime, i.e. single electron shuttling. In particular, we examine the dependance of the tunnel current on an ultra-small stationary force exerted on the shuttle. As an example, we consider the force exerted on an endohedral N@C-60 by the magnetic field gradient generated by a nearby nanomagnet. We derive a Hamiltonian for the full shuttle system which includes the metallic contacts, the spatially dependent tunnel couplings to the shuttle, the electronic and motional degrees of freedom of the shuttle itself and a coupling of the shuttle's motion to a phonon bath. We analyse the resulting quantum master equation and find that, due to the exponential dependence of the tunnel probability on the shuttle-contact separation, the current is highly sensitive to very small forces. In particular, we predict that the spin state of the endohedral electrons of N@C-60 in a large magnetic gradient field can be distinguished from the resulting current signals within a few tens of nanoseconds. This effect could prove useful for the detection of the endohedral spin-state of individual paramagnetic molecules such as N@C-60 and P@C-60, or the detection of very small static forces acting on a C-60 shuttle.