!
You're viewing papers too quickly. Please wait a moment.<br>This helps keep the archive available for everyone.
Quick Navigation
Topics
Entanglement Theory Quantum Correlations
How many mutually unbiased bases are needed to detect bound entangled states?
arXiv
Authors: Joonwoo Bae, Anindita Bera, Dariusz Chruściński, Beatrix C. Hiesmayr, Daniel McNulty
Year
2021
Paper ID
62680
Status
Preprint
Abstract Read
~2 min
Abstract Words
171
Citations
N/A
Abstract
From a practical perspective it is advantageous to develop methods that verify entanglement in quantum states with as few measurements as possible. In this paper we investigate the minimal number of mutually unbiased bases (MUBs) needed to detect bound entanglement in bipartite \(dtimes d\)-dimensional states, i.e. entangled states that are positive under partial transposition. In particular, we show that a class of entanglement witnesses composed of mutually unbiased bases can detect bound entanglement if the number of measurements is greater than d/2+1. This is a substantial improvement over other detection methods, requiring significantly fewer resources than either full quantum state tomography or measuring a complete set of d+1 MUBs. Our approach is based on a partial characterisation of the (non-)decomposability of entanglement witnesses. We show that non-decomposability is a universal property of MUBs, which holds regardless of the choice of complementary observables, and we find that both the number of measurements and the structure of the witness play an important role in the detection of bound entanglement.
Why This Paper Matters
- This paper contributes to the Entanglement Theory & Quantum Correlations research area in the Quantum Articles archive.
- It adds a 2021 reference point for readers tracking recent quantum research.
- From a practical perspective it is advantageous to develop methods that verify entanglement in quantum states with as few measurements as possible.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.