Supremum of Entanglement Measure for Symmetric Gaussian States, and Entangling Capacity
Jhih-Yuan Kao

TL;DR
This thesis explores the maximum entanglement achievable in symmetric Gaussian states and introduces a geometric framework for understanding the entangling capacity of quantum operations based on negativity and PPT-ness.
Contribution
It provides an analytical method to calculate bounds on entangling capacity in terms of negativity and establishes a geometric measure related to PPT-ness, along with exact results for symmetric Gaussian states.
Findings
Bounds for entangling capacity linked to PPT-ness of operations.
A geometric measure quantifying entangling capability and PPT-ness.
Analytical expression for the supremum of negativity in symmetric Gaussian states.
Abstract
In this thesis there are two topics: On the entangling capacity, in terms of negativity, of quantum operations, and on the supremum of negativity for symmetric Gaussian states. Positive partial transposition (PPT) states are an important class of states in quantum information. We show a method to calculate bounds for entangling capacity, the amount of entanglement that can be produced by a quantum operation, in terms of negativity, a measure of entanglement. The bounds of entangling capacity are found to be associated with how non-PPT (PPT preserving) an operation is. A length that quantifies both entangling capacity/entanglement and PPT-ness of an operation or state can be defined, establishing a geometry characterized by PPT-ness. The distance derived from the length bounds the relative entangling capability, endowing the geometry with more physical significance. For a system…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Mechanics and Applications · Quantum Computing Algorithms and Architecture
