1.2k citations · 7k across the 76 of their papers we have counts for
10 papers · 1 filter
A Proof of the Security of Quantum Key Distribution
Eli Biham, Michel Boyer, P. Oscar Boykin +2
We prove the security of quantum key distribution against the most general attacks which can be performed on the channel, by an eavesdropper who has unlimited computation abilities…
Security Aspects of Practical Quantum Cryptography
Gilles Brassard, Norbert Lütkenhaus, Tal Mor +1
The use of quantum bits (qubits) in cryptography holds the promise of secure cryptographic quantum key distribution schemes. Unfortunately, the implemented schemes can be totally i…
Unextendible Product Bases, Uncompletable Product Bases and Bound Entanglement
David P. DiVincenzo, Tal Mor, Peter W. Shor +2
We report new results and generalizations of our work on unextendible product bases (UPB), uncompletable product bases and bound entanglement. We present a new construction for bou…
Algorithms on Ensemble Quantum Computers
P. Oscar Boykin, Tal Mor, Vwani Roychowdhury +1
In ensemble (or bulk) quantum computation, measurements of qubits in an individual computer cannot be performed. Instead, only expectation values can be measured. As a result of th…
Sufficient conditions for a disentanglement
Tal Mor, Daniel R. Terno
We consider a disentanglement process in which local properties of an entangled state are preserved, while the entanglement between the subsystems is erased. Sufficient conditions…
Quantum cryptography via parametric downconversion
Gilles Brassard, Tal Mor, Barry C. Sanders
The use of quantum bits (qubits) in cryptography holds the promise of secure cryptographic quantum key distribution schemes. It is based usually on single-photon polarization state…