TL;DR
This paper introduces a systematic framework leveraging permutation invariance and Schur-Weyl duality to optimize quantum information problems efficiently, demonstrated through improved channel fidelity bounds and an open-source Python implementation.
Contribution
Develops a unified framework for permutation-invariant optimization in quantum information, enabling efficient computations and bounds for channel fidelity, with a practical open-source tool.
Findings
Improved lower bounds on channel fidelity for depolarizing and amplitude-damping channels.
The symmetric seesaw method exploits permutation-invariant codes for quantum channel analysis.
Open-source Python package implementing the proposed methods.
Abstract
Exploiting permutation invariance to reduce the exponential scaling of semidefinite programs in quantum information has emerged as a powerful computational technique. In this work, we develop a systematic framework for using this reduction via Schur-Weyl duality for optimization problems, and establish methods that allow one to work fully inside the permutation invariant subspace while performing operations such as (partially) applying channels and taking (partial) traces, or computing expressions like the quantum relative entropy. We then apply our techniques to the problem of computing efficient lower bounds on the channel fidelity over parallel uses of a quantum channel. The algorithm, which we call symmetric seesaw method, exploits permutation-invariant codes to yield improved lower bounds on the channel fidelity over uses of the depolarizing and amplitude-damping channel in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
