Description:

In this talk, I will explain how the problem of entanglement distribution on quantum networks (QN) is traditionally understood by mapping to classical percolation theory, which gives rise to a nontrivial threshold---in terms of the entanglement per link---for possibly transmitting entanglement between two arbitrarily distant nodes in QN. However, such a traditional comprehension is not complete. Indeed, a lower entanglement transmission threshold than what classical percolation predicts exists, as demonstrated on specific network topology, that reveals a large-scale “quantum advantage.” Naturally, we ask: Is such a “quantum advantage” general regardless of topology? I will address this question by introducing a new statistical theory, concurrence percolation theory (ConPT), that is analogous to classical percolation but fundamentally different, built by generalizing bond percolation in terms of “sponge-crossing” paths instead of clusters. ConPT predicts a lower threshold than classical percolation for any network topology, showing that the existence of a “quantum advantage” is indeed general on any large-scale QN. I will also talk about how to implement ConPT using quantum communication protocols and test them on IBM's quantum computing platform, QISKIT.

Xiangyi Meng, Postdoctoral Researcher, Northeastern University

Host: Istvan Kovacs