Efficient Approximation of Quantum Channel Fidelity Exploiting Symmetry
share
Determining the optimal fidelity for the transmission of quantum information over noisy quantum channels is one of the central problems in quantum information theory. Recently, [Berta & et al., Mathematical Programming, 2021] introduced an asymptotically converging semidefinite programming hierarchy of outer bounds for this quantity. However, the size of the semidefinite program (SDP) grows exponentially with respect to the level of the hierarchy, and thus computing the SDP directly is inefficient. In this work, by exploiting the symmetries in the SDP, we show that, for fixed input and output dimensions, we can compute the SDP in polynomial time in term of level of the hierarchy. As a direct consequence of our result, the optimal fidelity can be approximated with an accuracy of ϵ in a time that is polynomial in 1/ϵ.
READ FULL TEXT