Realization of a scalable Shor algorithm
Abstract
A quantum computer is expected to outperform its classical counterpart in certain tasks. One such task is the factorization of large integers, the technology that underpins the security of bank cards and online privacy. Using a small-scale quantum computer comprising five trapped calcium ions, Monz et al. implement a scalable version of Shor's factorization algorithm. With the function of ions being recycled and the architecture scalable, the process is more efficient than previous implementations. The approach thus provides the potential for designing a powerful quantum computer, but with fewer resources.
Document Details
- Document Type
- Pub Defense Publication
- Publication Date
- Mar 04, 2016
- Source ID
- 10.1126/science.aad9480
Entities
People
- Daniel Nigg
- Esteban A Martinez
- Isaac L. Chuang
- Matthias F. Brandl
- Philipp Schindler
- Rainer Blatt
- Richard Rines
- Shannon X. Wang
- Thomas Monz
Organizations
- Army Research Office
- Austrian Academy of Sciences
- Austrian Science Fund
- Intelligence Advanced Research Projects Activity
- Massachusetts Institute of Technology
- Office of the Director of National Intelligence
- University of Innsbruck