On the Limitations of Pseudorandom Unitaries

Pseudorandom unitaries PRUs, one of the key quantum pseudorandom notions, are efficiently computable unitaries that are computationally indistinguishable from Haar random unitaries. While there is evidence to believe that PRUs are weaker than one-way functions, so far its relationship with other...

Spanning-Tree-Packing Protocol for Conference Key Propagation in Quantum Networks

We consider a network of users connected by pairwise quantum key distribution QKD links. Using these pairwise secret keys and public classical communication, the users want to generate a common conference secret key at the maximal rate. We propose an algorithm based on spanning tree packing a kno...