Analysis of weighted quantum secret sharing based on matrix product states

In this paper, motivated by the usefulness of tensor networks to quantum information theory for the progress in study of entanglement in quantum many-body systems, we apply the hexagon tensor network algorithms in terms of Holland’s theory to study the weight allocation and dynamic problems in weighted quantum secret sharing that are not well solved by existing approaches with near-term devices and avoid the instability in the allocation of participants. To be exact, the variety of matrix product state representation of any quantum many-body state can be used to realize dynamic quantum state secret sharing