Quality assessment of quantum teleportation through the distribution of fidelity

• URL: http://arxiv.org/abs/2510.13600v1
• Date: Wed, 15 Oct 2025 14:33:07 GMT
• Title: Quality assessment of quantum teleportation through the distribution of fidelity
• Authors: D. G. Bussandri, G. M. Bosyk, P. Crespo Del Amo, K. Życzkowski,
• Abstract summary: We introduce a comprehensive statistical framework for assessing single-qubit quantum teleportation performance.<n>We show that protocols with identical average fidelities can exhibit markedly different statistical behaviors.<n>Applying this framework, we show that certifying high-fidelity teleportation requires increasingly stronger entanglement or non-locality.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this work, we introduce a comprehensive statistical framework for assessing single-qubit quantum teleportation performance beyond the conventional average-fidelity benchmark. At first, we derive a closed-form expression for the full probability density function of actual teleportation fidelities and apply it to both classical measure-and-prepare schemes and standard quantum teleportation, considering two relevant noise models: Bell-diagonal resource states and local amplitude-damping channels. These results reveal that protocols with identical average fidelities can exhibit markedly different statistical behaviors, and that relying solely on average fidelity can mask inherent asymmetries introduced by local noise, potentially leading to spurious conclusions of symmetry. Secondly, we introduce a certification method based on prior importance functions (e.g., Beta distributions), which unifies moment-based criteria and threshold-based success probabilities into a single figure of merit. Applying this framework, we show that certifying high-fidelity teleportation requires increasingly stronger entanglement or non-locality, and we clarify that the so-called ``fighting noise with noise'' effect arises from the chosen prior importance function rather than representing a genuine advantage. Our approach thus provides versatile tools for tailored, application-specific teleportation benchmarks.

Related papers

• Towards Anytime-Valid Statistical Watermarking [63.02116925616554]
  We develop the first e-value-based watermarking framework, Anchored E-Watermarking, that unifies optimal sampling with anytime-valid inference.<n>Our framework can significantly enhance sample efficiency, reducing the average token budget required for detection by 13-15% relative to state-of-the-art baselines.
  arXiv  Detail & Related papers  (2026-02-19T18:32:26Z)
• Bayesian Quantum Amplitude Estimation [46.03321798937855]
  We present BAE, a problem-tailored and noise-aware Bayesian algorithm for quantum amplitude estimation.<n>In a fault tolerant scenario, BAE is capable of saturating the Heisenberg limit; if device noise is present, BAE can dynamically characterize it and self-adapt.<n>We propose a benchmark for amplitude estimation algorithms and use it to test BAE against other approaches.
  arXiv  Detail & Related papers  (2024-12-05T18:09:41Z)
• Certifying nonlocal properties of noisy quantum operations [0.0]
  Certifying quantum properties from the probability distributions they induce is an important task for several purposes.<n>In particular, little is known about to what extent noise can spoil certification methods for channels.<n>We provide a unified methodology to certify nonlocal properties of quantum channels from the correlations obtained in prepare-and-measurement protocols.
  arXiv  Detail & Related papers  (2024-07-02T18:00:06Z)
• Relative-belief inference in quantum information theory [0.0]
  We show that the relative belief procedure chooses Hilbert spaces that are never smaller in dimension than those selected from optimizing a broad class of information criteria. We apply the relative belief procedure to an important application: state reconstruction of imperfect quantum sources.
  arXiv  Detail & Related papers  (2024-06-05T14:59:58Z)
• Challenges in certifying quantum teleportation: moving beyond conventional fidelity benchmark [0.0]
  Conventional certification method for quantum teleportation relies on surpassing the highest achievable classical average fidelity between target and teleported states. inconsistent conclusions can be obtained when it is considered different distance measures in the quantum state space.
  arXiv  Detail & Related papers  (2024-03-12T18:02:17Z)
• Robust and efficient verification of graph states in blind measurement-based quantum computation [52.70359447203418]
  Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. It is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension.
  arXiv  Detail & Related papers  (2023-05-18T06:24:45Z)
• Enhancing Quantum Computation via Superposition of Quantum Gates [1.732837834702512]
  We present different protocols, which we denote as "superposed quantum error mitigation" We show that significant noise suppression can be achieved for most kinds of decoherence and standard experimental parameter regimes. We analyze our approach for gate-based, measurement-based and interferometric-based models.
  arXiv  Detail & Related papers  (2023-04-17T18:01:05Z)
• Quantum Conformal Prediction for Reliable Uncertainty Quantification in Quantum Machine Learning [47.991114317813555]
  Quantum models implement implicit probabilistic predictors that produce multiple random decisions for each input through measurement shots. This paper proposes to leverage such randomness to define prediction sets for both classification and regression that provably capture the uncertainty of the model.
  arXiv  Detail & Related papers  (2023-04-06T22:05:21Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Significance of Fidelity Deviation in Continuous Variable Teleportation [0.0]
  We show that CV states can be better characterized by considering both average fidelity and fidelity deviation. We shed light on the performance of the teleportation protocol in two different input scenarios.
  arXiv  Detail & Related papers  (2022-03-13T15:39:24Z)
• Sampling-Based Robust Control of Autonomous Systems with Non-Gaussian Noise [59.47042225257565]
  We present a novel planning method that does not rely on any explicit representation of the noise distributions. First, we abstract the continuous system into a discrete-state model that captures noise by probabilistic transitions between states. We capture these bounds in the transition probability intervals of a so-called interval Markov decision process (iMDP)
  arXiv  Detail & Related papers  (2021-10-25T06:18:55Z)
• Efficient and robust certification of genuine multipartite entanglement in noisy quantum error correction circuits [58.720142291102135]
  We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME) We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME. We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
  arXiv  Detail & Related papers  (2020-10-06T18:00:07Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.