Numerical Simulation of Optimal Entanglement Network Protocols for Multiple States

Abstract

Entanglement has been one of the dominant aspects distinguishing quantum theory from its classical counterpart. Indeed, entanglement has played a central role in recent developments in quantum technology, such as quantum computing, key distribution, etc. In order to use entanglement in these situations, a particular form is often needed, namely the maximal case. Various techniques have been used to manipulate entangled states, especially between distant parties. Generating long-distance entanglement from multiple shorter states has been studied, and it has been shown that there exists a class of states that can achieve optimal entanglement resources. In this paper, the particular class of states that yields the weakest link is numerically examined. The findings reveal that the range of this class is limited but substantial.