Approximating quantum states with positive partial transposes in multipartite system via linearized proximal alternative direction method of multipliers

Numerical approximation of quantum states via convex combinations of states with positive partial transposes (bi-PPT state) in multipartite systems constitutes a fundamental challenge in quantum information science. We reformulate this problem as a linearly constrained optimization problem. An approximate model is constructed through an auxiliary variable and a suitable penalty parameter, balancing constraint violation and approximation error. To solve the approximate model, we design a linearized proximal alternating direction method of multipliers (LPADMM), proving its convergence under a prescribed inequality condition on regularization parameters. The algorithm achieves an iteration complexity of O(1/ϵ2) for attaining ϵ-stationary solutions. Numerical validation on diverse quantum systems, including three-qubit W/GHZ states and five-partite GHZ and multiGHZ states with noises, confirms high-quality bi-PPT approximations and decomposability certification, demonstrating the utility of our method for quantum information applications.