Peter W. Shor  Home/Search
Context Related
Links: ACM DBLP | nec.com/homepages/wds/shorfactor.ps codiciel.fr/netlib/att...QCjournal.ps.Z att.com/~shor/papers/QCjournal.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: nec.com/homepag...course.hugelist (more) From: codiciel.fr/netlib/att/ma...index (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. This paper considers factoring integers and finding discrete logarithms, two problems which are generally thought to be hard on a classical computer and which have been used as the basis of... (Update)
Cited by: More
Quantum vs. Classical Communication and Computation - Buhrman, Cleve, Wigderson (1998) (Correct)
Quantum Lower Bounds by Polynomials - Robert Beals University (Correct)
Quantum Fourier transforms for extracting hidden - Linear Structures In (Correct)
Similar documents (at the sentence level): More
72.4%: Polynomial-Time Algorithms for Prime Factorization and Discrete.. - Shor (1996) (Correct)
60.0%: Polynomial-Time Algorithms For Prime Factorization And Discrete.. - Shor (1997) (Correct)
59.3%: Simulating Physics with Computers - Feynman (1982) (Correct)
Similar documents based on text: More All
0.0: Qu-Prolog 4.2 User Guide - Robinson (1997) (Correct)
0.0: Higher Level Meta Programming in Qu-Prolog 3.0 - Cheng, Robinson, Staples (1990) (Correct)
0.0: Qu-Prolog 6.0 User Guide - Robinson (2000) (Correct)
Related documents from co-citation: More All
49: A fast quantum mechanical algorithm for database search - Grover - 1996
38: the power of quantum computation - Simon - 1994
34: Quantum complexity theory - Bernstein, Vazirani - 1993
BibTeX entry: (Update)
P. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. Full version, 1995. http://citeseer.ist.psu.edu/25085.html More
@article{ shor97polynomialtime,
author = "Peter W. Shor",
title = "Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer",
journal = "{SIAM Journal on Computing}",
volume = "26",
number = "5",
pages = "1484--1509",
year = "1997",
url = "citeseer.ist.psu.edu/25085.html" }
Citations (may not include all citations):2 Envisioning a quantum supercomputer (context) - supercomputer - 1994
1 personal communication (context) - translation, Knill - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.neci.nj.nec.com/homepages/wds/pu-course.hugelist.html):
Elementary Gates for Quantum Computation - Barenco, Bennett, Cleve, Di.. (1995) (Correct)
The Maximum Speed of Dynamical Evolution - Margolus, Levitin (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC