A Tailored Fidelity Estimation and Purification Method for Entangled Quantum Networks
Summarize this article with:
Quantum Physics arXiv:2602.18011 (quant-ph) [Submitted on 20 Feb 2026] Title:A Tailored Fidelity Estimation and Purification Method for Entangled Quantum Networks Authors:Takafumi Oka, Michal Hajdušek, Shota Nagayama, Rodney Van Meter View a PDF of the paper titled A Tailored Fidelity Estimation and Purification Method for Entangled Quantum Networks, by Takafumi Oka and 3 other authors View PDF HTML (experimental) Abstract:We present a method to conduct both quantum state reconstruction and entanglement purification simultaneously that is advantageous in several respects over previous work in this direction, showing that the number of Bell pairs necessary to boot a quantum network can be significantly reduced compared to an existing method. The existing method requires at least $10^5$ Bell pairs for the state reconstruction phase to estimate that the state is of fidelity $0.99$ within the error range of $10^{-2}$, whereas our approach only requires around $2,841$ to be certain with $99.7\%$ of confidence that the estimated fidelity lies within $[0.99-0.01, 0.99+0.01]$. In addition, in our approach we can start with a lower fidelity Bell pair and purify it multiple times, estimating at the same time the resultant fidelity with guarantee of $99.7\%$ that the fidelity estimate lies within a certain range. Moreover, the existing method cannot correct both bit-flip and phase-flip errors at the same time and can only correct one of these, whereas our approach can correct both bit-flip and phase-flip errors simultaneously.
This research produces numerical estimates for the number of Bell pairs actually needed to guarantee a certain threshold fidelity $F$. The research can support the functioning real-world quantum networking by providing the information of the time needed for the bootstrapping of a quantum network to finish. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2602.18011 [quant-ph] (or arXiv:2602.18011v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2602.18011 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Takafumi Oka [view email] [v1] Fri, 20 Feb 2026 05:53:15 UTC (584 KB) Full-text links: Access Paper: View a PDF of the paper titled A Tailored Fidelity Estimation and Purification Method for Entangled Quantum Networks, by Takafumi Oka and 3 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-02 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?) Links to Code Toggle Papers with Code (What is Papers with Code?) 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?)