Quick Navigation
Topics
Quantum Algorithms
Optimal noisy entanglement testing for ranging and communication
arXiv
Authors: Pengcheng Liao, Quntao Zhuang
Year
2023
Paper ID
53119
Status
Preprint
Abstract Read
~2 min
Abstract Words
184
Citations
N/A
Abstract
Given a quantum system S entangled with another system I, the entanglement testing problem arises, prompting the identification of the system S within a set of m ge 2 identical systems. This scenario serves as a model for the measurement task encountered in quantum ranging and entanglement-assisted communication [Phys. Rev. Lett. 126, 240501, (2021)]. In this context, the optimal measurement approach typically involves joint measurements on all m+1 systems. However, we demonstrate that this is not the case when the subsystems containing system S are subjected to entanglement-breaking noise. Our approach utilizes the recently developed measurement technique of correlation-to-displacement conversion. We present a structured design for the entanglement testing measurement, implementable with local operations and classical communications (LOCC) on the m+1 systems. Furthermore, we prove that this measurement approach achieves optimality in terms of error probability asymptotically under noisy conditions. When applied to quantum illumination, our measurement design enables optimal ranging in scenarios with low signal brightness and high levels of noise. Similarly, when applied to entanglement-assisted classical communication, the measurement design leads to a significant relative advantage in communication rates, particularly in scenarios with low signal brightness.
Why This Paper Matters
- It adds a 2023 reference point for readers tracking recent quantum research.
- Given a quantum system S entangled with another system I, the entanglement testing problem arises, prompting the identification of the system S within a set of m ge 2 identical...
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.