Quick Navigation
Topics
Quantum Algorithms
Approximate recoverability and the quantum data processing inequality
arXiv
Authors: Saptak Bhattacharya
Year
2023
Paper ID
55170
Status
Preprint
Abstract Read
~2 min
Abstract Words
88
Citations
N/A
Abstract
In this paper, we discuss the quantum data processing inequality and its refinements that are physically meaningful in the context of approximate recoverability. An important conjecture regarding this due to Seshadreesan et. al. in J. Phys. A: Math. Theor. 48 (2015) is disproved. We prove some inequalities capturing universal approximate recoverability with the Petz recovery map for the sandwiched quasi and Rényi relative entropies for the parameter t=2. We also obtain convexity theorems on some parametrized versions of the relative entropy and fidelity, which can be of independent interest.
Why This Paper Matters
- It adds a 2023 reference point for readers tracking recent quantum research.
- In this paper, we discuss the quantum data processing inequality and its refinements that are physically meaningful in the context of approximate recoverability.
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.