Quick Navigation
Topics
Quantum Foundations
A Tailored Fidelity Estimation and Purification Method for Entangled Quantum Networks
arXiv
Authors: Takafumi Oka, Michal Hajdušek, Shota Nagayama, Rodney Van Meter
Year
2026
Paper ID
10345
Status
Preprint
Abstract Read
~2 min
Abstract Words
212
Citations
N/A
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 105 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.
Why This Paper Matters
- This paper contributes to the Quantum Foundations research area in the Quantum Articles archive.
- It adds a 2026 reference point for readers tracking recent quantum research.
- We present a method to conduct both quantum state reconstruction and entanglement purification simultaneously that is advantageous in several respects over previous work in...
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.