2000 character limit reached
Approximating projections by quantum operations
Published 5 Mar 2022 in quant-ph, math.OA, and math.OC | (2203.02627v2)
Abstract: Using techniques from semidefinite programming, we study the problem of finding a closest quantum channel to the projection onto a matricial subsystem. We derive two invariants of matricial subsystems which are related to the quantum Lov\'asz theta function of Duan, Severini, and Winter.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.