1 citations · 1 across the 1 of their papers we have counts for
6 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…
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…
Quantum memory in quantum cryptography
Tal Mor
[Shortened abstract:] This thesis investigates the importance of quantum memory in quantum cryptography, concentrating on quantum key distribution schemes. In the hands of an eaves…
On Universal and Fault-Tolerant Quantum Computing
P. Oscar Boykin, Tal Mor, Matthew Pulver +2
A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environm…
Teleportation via generalized measurements, and conclusive teleportation
Tal Mor, Pawel Horodecki
In this work we show that teleportation is a special case of a generalized Einstein, Podolsky, Rosen (EPR) non-locality. Based on the connection between teleportation and generaliz…