Performance comparison of the two reconstruction methods for stabilizer-based quantum secret sharing

Abstract

Stabilizer-based quantum secret sharing has two methods to reconstruct a quantum secret: The erasure correcting procedure and the unitary procedure. It is known that the unitary procedure has a smaller circuit width. On the other hand, it is unknown which method has smaller depth and fewer circuit gates. In this paper, it is shown that the unitary procedure has smaller depth and fewer circuit gates when the circuits are designed for quantum secret sharing using $[[5, 1, 3]]$ binary stabilizer codes.