A quantum information processor with trapped ions
Author(s)
Schindler, Philipp; Nigg, Daniel; Monz, Thomas; Barreiro, Julio T.; Martinez, Esteban; Quint, Stephan; Brandl, Matthias F; Nebendahl, Volckmar; Roos, Christian F; Chwalla, Michael; Hennrich, Markus; Blatt, Rainer; Wang, Shannon X.; ... Show more Show less
DownloadSchindler-2013-A quantum informatio.pdf (1.201Mb)
PUBLISHER_CC
Publisher with Creative Commons License
Creative Commons Attribution
Terms of use
Metadata
Show full item recordAbstract
Quantum computers hold the promise to solve certain problems exponentially faster than their classical counterparts. Trapped atomic ions are among the physical systems in which building such a computing device seems viable. In this work we present a small-scale quantum information processor based on a string of [superscript 40]Ca[superscript +] ions confined in a macroscopic linear Paul trap. We review our set of operations which includes non-coherent operations allowing us to realize arbitrary Markovian processes. In order to build a larger quantum information processor it is mandatory to reduce the error rate of the available operations which is only possible if the physics of the noise processes is well understood. We identify the dominant noise sources in our system and discuss their effects on different algorithms. Finally we demonstrate how our entire set of operations can be used to facilitate the implementation of algorithms by examples of the quantum Fourier transform and the quantum order finding algorithm.
Date issued
2013-12Department
Massachusetts Institute of Technology. Department of Physics; MIT-Harvard Center for Ultracold AtomsJournal
New Journal of Physics
Publisher
IOP Publishing
Citation
Schindler, Philipp, Daniel Nigg, Thomas Monz, Julio T Barreiro, Esteban Martinez, Shannon X Wang, Stephan Quint, et al. “A Quantum Information Processor with Trapped Ions.” New Journal of Physics 15, no. 12 (December 6, 2013): 123012. © IOP Publishing LTD and Deutsche Physikalische Gesellschaft
Version: Final published version
ISSN
1367-2630