Fast donor-based electron spin quantum computing

C. D. Hill; Lloyd C. L. Hollenberg; Austin G. Fowler; Cameron J. Wellard; Andrew D. Greentree; H.-S. Goan

doi:10.1117/12.583200

23 February 2005 Fast donor-based electron spin quantum computing

C. D. Hill, Lloyd C. L. Hollenberg, Austin G. Fowler, Cameron J. Wellard, Andrew D. Greentree, H.-S. Goan

Proceedings Volume 5650, Micro- and Nanotechnology: Materials, Processes, Packaging, and Systems II; (2005) https://doi.org/10.1117/12.583200
Event: Smart Materials, Nano-, and Micro-Smart Systems, 2004, Sydney, Australia

Abstract

We propose a scheme for electron spin quantum computing based on electron spin in semiconductors. This scheme shares many similarities with the existing Kane nuclear spin proposal. We show how quantum computation may be carried out in this proposal, including single qubit rotations and CNOT gate. We show how this control can potentially lead to gate speeds 100-1000 times faster than the existing nuclear spin proposal, and up to 10⁶ times faster than a typical electron spin dephasing time, T₂(_e).

Citation Download Citation

C. D. Hill, Lloyd C. L. Hollenberg, Austin G. Fowler, Cameron J. Wellard, Andrew D. Greentree, and H.-S. Goan "Fast donor-based electron spin quantum computing", Proc. SPIE 5650, Micro- and Nanotechnology: Materials, Processes, Packaging, and Systems II, (23 February 2005); https://doi.org/10.1117/12.583200

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available