Factorization Law for Two Lower Bounds of Concurrence
Sayyed Yahya Mirafzali, Iman Sargolzahi, Ali Ahanj, Kurosh Javidan and, Mohsen Sarbishaei

TL;DR
This paper investigates how two lower bounds of quantum concurrence evolve in bipartite systems under local channels, revealing a factorization law that simplifies understanding their dynamics and applications.
Contribution
It establishes a factorization law for two lower bounds of concurrence under local channels, extending previous results and providing a new tool for quantum entanglement analysis.
Findings
Lower bounds obey a factorization law under local channels
The law simplifies entanglement dynamics analysis
Application example demonstrates practical relevance
Abstract
We study the dynamics of two lower bounds of concurrence in bipartite quantum systems when one party goes through an arbitrary channel. We show that these lower bounds obey the factorization law similar to that of [Konrad et al., Nat. Phys. 4, 99 (2008)]. We also, discuss the application of this property, in an example.
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 Mechanics and Applications · Quantum Information and Cryptography · Quantum Computing Algorithms and Architecture
