Fully Device Independent Quantum Key Distribution
We rigorously provide the device-independent security of an entanglement-based protocol building on Ekert's original proposal for quantum key distribution.
Umesh Vazirani
Advertisement
Author Archives
Geometry, Flows, and Graph-Partitioning Algorithms
"Graph partitioning" refers to a family of computational problems in which the vertices of a graph have to be partitioned into two (or more) large pieces while minimizing the number of the edges that cross the cut. The goal of this paper is to survey an interesting combination of techniques that have recently led to progress on graph partioning problems.
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved