Shor's algorithm

Known as: Shor factorization algorithm, Quantum factoring, Shors algorithm 
Shor's algorithm, named after mathematician Peter Shor, is a quantum algorithm (an algorithm that runs on a quantum computer) for integer… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
We revisit Shor’s algorithm for computing discrete logarithms in Fp on a quantum computer and modify it to compute logarithms d… (More)
Is this relevant?
2009
2009
1. The probability p that we see any particular state |c, x^k \,(\mbox{mod}\, n)\rangle with \{rc\}_q \leq r/2 is at least \frac… (More)
Is this relevant?
2007
2007
We give a new “nested adds” circuit for implementing Shor’s algorithm in linear width and quadratic depth on a nearest-neighbor… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
We show how the execution time of algorithms on quantum compu ters depends on the architecture of the quantum computer, the… (More)
  • figure 1
  • table 1
  • figure 2
Is this relevant?
2004
2004
We present a distributed implementation of Shor's quantum factoring algorithm on a distributed quantum network model. This model… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We show in some detail how to implement Shor’s efficient quantum algorithm for discrete logarithms for the particular case of… (More)
  • table 1
  • table 2
  • table 3
  • figure 1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We prove that the 1984 protocol of Bennett and Brassard (BB84) for quantum key distribution is secure. We first give a key… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
The eld of quantum computation studies the power of computers that are based on quantum-mechanical principles. We give a brief… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
It is shown that a classical error correcting code C = [n, k, d] which contains its dual, C⊥ ⊆ C, and which can be enlarged to C… (More)
  • table I
  • table II
Is this relevant?
Highly Cited
1972
Highly Cited
1972
This paper presents new algori thms for the maximum flow problem, the Hitchcock t r anspo r t a t i on problem, and the general… (More)
  • figure 1
Is this relevant?