# Shor's algorithm

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- IACR Cryptology ePrint Archive
- 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

- Second International Symposium on Information…
- 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

- 2007

We give a new “nested adds” circuit for implementing Shor’s algorithm in linear width and quadratic depth on a nearest-neighbor… (More)

Is this relevant?

2005

2005

- 2005

We show how the execution time of algorithms on quantum compu ters depends on the architecture of the quantum computer, the… (More)

Is this relevant?

2004

2004

- 2004

We present a distributed implementation of Shor's quantum factoring algorithm on a distributed quantum network model. This model… (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Quantum Information & Computation
- 2003

We show in some detail how to implement Shor’s efficient quantum algorithm for discrete logarithms for the particular case of… (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- Physical review letters
- 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

- 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

- IEEE Trans. Information Theory
- 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)

Is this relevant?

Highly Cited

1972

Highly Cited

1972

- J. ACM
- 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)

Is this relevant?