Chunmei Li, Bangjun Chen, Xuefeng Duan. A fast algorithm for solving the low rank matrix feasibility problem in quantum marginal computing. // BIT Numerical Mathematics. – 2026. – DOI: 10.1007/s10543-026-01148-2. – URL: https://doi.org/10.1007/s10543-026-01148-2
Chunmei Li, Bangjun Chen, & Xuefeng Duan (2026). A fast algorithm for solving the low rank matrix feasibility problem in quantum marginal computing. BIT Numerical Mathematics. https://doi.org/10.1007/s10543-026-01148-2
Chunmei Li, et al. “A fast algorithm for solving the low rank matrix feasibility problem in quantum marginal computing.” BIT Numerical Mathematics, 2026. doi:10.1007/s10543-026-01148-2.
@article{Li2026,
title = {A fast algorithm for solving the low rank matrix feasibility problem in quantum marginal computing},
author = {Li, Chunmei and Chen, Bangjun and Duan, Xuefeng},
journal = {BIT Numerical Mathematics},
year = {2026},
doi = {10.1007/s10543-026-01148-2},
url = {https://doi.org/10.1007/s10543-026-01148-2}
}