NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.

Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.

U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

PUBLICATIONS

Feasibility study of quantum computing using trapped electrons

Published

Author(s)

Qian Yu, Alberto Alonso, Jackie Caminiti, Robert Sutherland, Dietrich Leibfried, Kayla Rodriguez, Madhav Dhital, Boerge Hemmerling, Hartmut Haeffner, Kristin Beck

Abstract

We investigate the feasibility of using electrons in a linear Paul trap as qubits in a future quantum computer. We discuss the necessary experimental steps to realize such a device through a concrete design proposal, including trapping, cooling, electronic detection, spin readout and single and multiqubit gate operations. Numeric simulations indicate that two-qubit Bell-state delities of order 99.99% can be achieved assuming reasonable experimental parameters.
Citation
Physical Review Letters
Volume
105
Pub Type
Journals

Download Paper

https://doi.org/10.1103/PhysRevA.105.022420
Local Download

Keywords

quantum information processing, electron, radio frequency trap
Physics

Citation

Yu, Q. , Alonso, A. , Caminiti, J. , Sutherland, R. , Leibfried, D. , Rodriguez, K. , Dhital, M. , Hemmerling, B. , Haeffner, H. and Beck, K. (2022), Feasibility study of quantum computing using trapped electrons, Physical Review Letters, [online], https://doi.org/10.1103/PhysRevA.105.022420, https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=933783 (Accessed October 11, 2025)

Issues

If you have any questions about this publication or are having problems accessing it, please contact [email protected].

Created February 15, 2022, Updated January 13, 2024
Was this page helpful?