{"ID":6497707,"CreatedAt":"2026-07-13T01:19:40.13847098Z","UpdatedAt":"2026-07-14T01:36:59.12045529Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2607.09339","arxiv_id":"2607.09339","title":"PCPOP.jl: A Julia package for partially commutative polynomial optimization","abstract":"Here we present PCPOP, a Julia package for polynomial optimization that supports non-commutative optimization, tracial polynomial optimization, trace polynomial optimization and state polynomial optimization. PCPOP fully supports exact arithmetic computations and incorporates convenient functionalities such as algebraic reductions based on Gröbner basis methods, automatized symmetrization via Wedderburn decompositions, and Jordan algebra reductions. As a distinguished feature, PCPOP implements a specialized framework for polynomial computations in partially commutative variables that provides significant computational advantages for problems appearing in quantum information.","short_abstract":"Here we present PCPOP, a Julia package for polynomial optimization that supports non-commutative optimization, tracial polynomial optimization, trace polynomial optimization and state polynomial optimization. PCPOP fully supports exact arithmetic computations and incorporates convenient functionalities such as algebrai...","url_abs":"https://arxiv.org/abs/2607.09339","url_pdf":"https://arxiv.org/pdf/2607.09339v1","authors":"[\"Moisés Bermejo Morán\",\"Abhishek Mishra\"]","published":"2026-07-10T12:20:16Z","proceeding":"quant-ph","tasks":"[\"quant-ph\",\"math.OC\"]","methods":"[]","has_code":false}