activity
19922023
most citedPolynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

6.1k citations · 24.5k across the 92 of their papers we have counts for

collaborators
Showing 2000Show all

5 papers · 1 filter

quant-ph2000★ 146 cited

Nonadditivity of Bipartite Distillable Entanglement follows from Conjecture on Bound Entangled Werner States

Peter W. Shor, John A. Smolin, Barbara M. Terhal

Assuming the validity of a conjecture in quant-ph/9910026 and quant-ph/9910022 we show that the distillable entanglement for two bipartite states, each of which individually has ze…

quant-ph2000

On the Number of Elements Needed in a POVM Attaining the Accessible Information

Peter W. Shor

We investigate a symmetric set of three quantum states in three dimensions having interesting properties, which we call the lifted trine states. We show that for the ensemble consi…

quant-ph2000★ 849 cited

Remote State Preparation

Charles H. Bennett, David P. DiVincenzo, Peter W. Shor +3

Quantum teleportation uses prior entanglement and forward classical communication to transmit one instance of an unknown quantum state. Remote state preparation (RSP) has the same…

quant-ph2000★ 3 cited

Superactivation of Bound Entanglement

Peter W. Shor, John A. Smolin, Ashish V. Thapliyal

We show that, in a multi-party setting, two non-distillable (bound-entangled) states tensored together can make a distillable state. This is an example of true superadditivity of d…

quant-ph2000★ 3.1k cited

Simple Proof of Security of the BB84 Quantum Key Distribution Protocol

Peter W. Shor, John Preskill

We prove the security of the 1984 protocol of Bennett and Brassard (BB84) for quantum key distribution. We first give a key distribution protocol based on entanglement purification…