PhoQuS Awarded DARPA HARQ

We’re pleased to share a new paper from the PhoQus Group (lead by Research Faculty, Aqil Sajjad), “Lower bounds on bipartite entanglement in noisy graph states,” published in Quantum.

Entanglement is a key resource for quantum communication and distributed quantum computing, but it is highly sensitive to noise. In this work, we study how much entanglement survives in noisy graph states, an important class of quantum states used in quantum networks and computation.

We develop a method to quantify guaranteed amounts of distillable entanglement in the presence of realistic noise and identify families of graph states that remain surprisingly robust even as their size grows. Our results provide new insight into how quantum network architectures can be designed to preserve entanglement under imperfect operating conditions.

Authors: Aqil Sajjad, Eneet Kaur, Kenneth Goodenough, Don Towsley, and Saikat Guha.