Detecting the concurrence of an unknown state with a single observable
Zhi-Hao Ma, Zhi-Hua Chen, Jing-Ling Chen

TL;DR
This paper introduces an experimentally feasible method to derive a lower bound for the concurrence of bipartite mixed quantum states, simplifying entanglement quantification across various dimensions.
Contribution
It provides an analytical lower bound for concurrence that can be implemented experimentally, advancing practical entanglement detection methods.
Findings
Derived an analytical lower bound for concurrence
Bound is experimentally implementable
Applicable to bipartite mixed states in arbitrary dimensions
Abstract
While the detection of entanglement has been proved already to be quite a difficult task, experimental quantification of entanglement is even more challenging. In this work, we derive an analytical lower bound for the concurrence of a bipartite mix quantum state in arbitrary dimension. The lower bound is experimentally implementable in a feasible way, which enabling quantification of entanglement in a broad variety of cases
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 Computing Algorithms and Architecture · Quantum Mechanics and Applications
