Oversimplifying quantum factoring

John A. Smolin (), Graeme Smith and Alexander Vargo
Additional contact information
John A. Smolin: IBM T. J. Watson Research Center
Graeme Smith: IBM T. J. Watson Research Center
Alexander Vargo: IBM T. J. Watson Research Center

Nature, 2013, vol. 499, issue 7457, 163-165

Abstract: Building a device capable of factoring large numbers is a major goal of quantum computing; an algorithm for quantum factoring (Shor’s algorithm) exists, and a simple coin-tossing exercise is used to illustrate the dangers of oversimplification when implementing this algorithm experimentally.

Date: 2013
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
https://www.nature.com/articles/nature12290 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:nat:nature:v:499:y:2013:i:7457:d:10.1038_nature12290

Ordering information: This journal article can be ordered from
https://www.nature.com/

DOI: 10.1038/nature12290

Access Statistics for this article

Nature is currently edited by Magdalena Skipper

More articles in Nature from Nature
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().