Information-Geometric Bound on the Robustness of Entanglement Generation
Summarize this article with:
Quantum Physics arXiv:2606.05696 (quant-ph) [Submitted on 4 Jun 2026] Title:Information-Geometric Bound on the Robustness of Entanglement Generation Authors:Zain H. Saleem View a PDF of the paper titled Information-Geometric Bound on the Robustness of Entanglement Generation, by Zain H. Saleem View PDF HTML (experimental) Abstract:Entanglement generation is a central resource for quantum information processing, quantum networking, and quantum sensing. In practical implementations, however, entangling interactions are inevitably subject to uncertainty and fluctuations in the interaction strength. We investigate the robustness of entanglement generation in the presence of such imperfections and establish a direct connection between the robustness of entanglement generation and quantum Fisher information (QFI). For two interacting qubits, we show that the reduction in concurrence caused by fluctuations in the interaction parameter is bounded by the QFI with respect to the interaction strength. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2606.05696 [quant-ph] (or arXiv:2606.05696v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2606.05696 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Zain Saleem Dr [view email] [v1] Thu, 4 Jun 2026 04:27:30 UTC (10 KB) Full-text links: Access Paper: View a PDF of the paper titled Information-Geometric Bound on the Robustness of Entanglement Generation, by Zain H. SaleemView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-06 References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)