Universality cost of non-Gaussian enhancement in continuous-variable quantum teleportation: A fidelity--deviation trade-off

• URL: http://arxiv.org/abs/2604.20103v1
• Date: Wed, 22 Apr 2026 01:55:15 GMT
• Title: Universality cost of non-Gaussian enhancement in continuous-variable quantum teleportation: A fidelity--deviation trade-off
• Abstract summary: Continuous-variable quantum teleportation is benchmarked using average fidelity and fidelity deviation.<n>We prove that any deterministic unity-gain teleportation channel that is displacement covariant has vanishing fidelity deviation for coherent-state benchmarking.<n>We show that when a protocol raises the average fidelity through input-selective conditioning, the deviation generically increases in tandem, giving a quantitative universality cost.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Continuous-variable (CV) quantum teleportation is usually benchmarked by average fidelity, but when the teleportation is repeatedly used within optical networks or measurement-based architectures, uniformity across the input ensemble becomes equally important. We analyze this issue using two complementary figures of merit: the average fidelity and the fidelity deviation, which quantifies the input dependence of the single-shot teleportation fidelity. We prove that any deterministic unity-gain teleportation channel that is displacement covariant has vanishing fidelity deviation for coherent-state benchmarking, irrespective of whether the shared entangled resource is Gaussian or non-Gaussian. Nonzero deviation therefore diagnoses covariance breaking rather than non-Gaussianity. We then show that when a protocol raises the average fidelity through input-selective conditioning, the deviation generically increases in tandem, giving a quantitative universality cost. As a concrete example, we study teleportation enhanced by the so-called measurement-based noiseless linear amplification, where a heralded filter acts on the Bell-measurement record. The resulting trade-off among average fidelity, fidelity deviation, and success probability shows that stronger filtering can improve the conditional fidelity only by concentrating the successful events in favored regions of phase space, thereby suppressing the success probability and reducing input uniformity. Our results provide an operational framework for distinguishing genuine channel improvement from selectivity-driven post-selected advantage and suggest that the probabilistic CV teleportation should be assessed with average quality, universality, and heralding rate treated on an equal footing.

Related papers

• Benchmark for Quantum Teleportation with Non-Uniform Prior Distributions [0.0]
  Quantum teleportation should surpass maximum fidelity thresholds possible with local measurements and classical communications.<n>We determine the highest mean fidelity achievable for teleportation of states without using entanglement.<n>We show that fidelity thresholds to declare quantum advantage can be significantly higher than is typically assumed with uniform distribution.
  arXiv  Detail & Related papers  (2026-05-24T04:41:19Z)
• Decision-Focused Federated Learning Under Heterogeneous Objectives and Constraints [45.88028371034407]
  We build on the well-known SPO+ approach and develop heterogeneity bounds for the SPO+ surrogate loss.<n>In the case of strongly convex feasible regions, sharper bounds are derived due to the stability.<n>We implement a FedAvg-style DFFL set of experiments on both polyhedral and strongly convex problems.
  arXiv  Detail & Related papers  (2026-04-21T22:22:39Z)
• Stability and Generalization of Push-Sum Based Decentralized Optimization over Directed Graphs [55.77845440440496]
  Push-based decentralized communication enables optimization over communication networks, where information exchange may be asymmetric.<n>We develop a unified uniform-stability framework for the Gradient Push (SGP) algorithm.<n>A key technical ingredient is an imbalance-aware generalization bound through two quantities.
  arXiv  Detail & Related papers  (2026-02-24T05:32:03Z)
• Quality assessment of quantum teleportation through the distribution of fidelity [0.0]
  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.
  arXiv  Detail & Related papers  (2025-10-15T14:33:07Z)
• Quantum Fidelity Estimation in the Resource Theory of Nonstabilizerness [11.386506926570442]
  fidelity estimation is essential for benchmarking quantum states and processes on noisy quantum devices.<n>We propose several efficient protocols for both quantum states and channels within the resource theory of nonstabilizerness.
  arXiv  Detail & Related papers  (2025-06-15T18:51:09Z)
• Regulating Model Reliance on Non-Robust Features by Smoothing Input Marginal Density [93.32594873253534]
  Trustworthy machine learning requires meticulous regulation of model reliance on non-robust features. We propose a framework to delineate and regulate such features by attributing model predictions to the input.
  arXiv  Detail & Related papers  (2024-07-05T09:16:56Z)
• Consideration of success probability and performance optimization in non-Gaussian continuous variable quantum teleportation [2.380269892761954]
  We study the trade-off between teleportation fidelity and success probability for optimal performance of the teleportation protocol. We use Wigner characteristic function describing three non-Gaussian states, photon subtracted, photon added, and photon catalyzed two-mode squeezed vacuum states.
  arXiv  Detail & Related papers  (2022-06-13T17:54:57Z)
• 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)
• Distribution Regression with Sliced Wasserstein Kernels [45.916342378789174]
  We propose the first OT-based estimator for distribution regression. We study the theoretical properties of a kernel ridge regression estimator based on such representation.
  arXiv  Detail & Related papers  (2022-02-08T15:21:56Z)
• BayesIMP: Uncertainty Quantification for Causal Data Fusion [52.184885680729224]
  We study the causal data fusion problem, where datasets pertaining to multiple causal graphs are combined to estimate the average treatment effect of a target variable. We introduce a framework which combines ideas from probabilistic integration and kernel mean embeddings to represent interventional distributions in the reproducing kernel Hilbert space.
  arXiv  Detail & Related papers  (2021-06-07T10:14:18Z)
• Average fidelity and fidelity deviation in noisy quantum teleportation [0.6882042556551609]
  We analyze the average fidelity (say, F) and the fidelity deviation (say, D) in noisy-channel quantum teleportation. Our results prove that the achievable maximum average fidelity ensures zero fidelity deviation, that is universality.
  arXiv  Detail & Related papers  (2021-02-10T12:00:56Z)
• GenDICE: Generalized Offline Estimation of Stationary Values [108.17309783125398]
  We show that effective estimation can still be achieved in important applications. Our approach is based on estimating a ratio that corrects for the discrepancy between the stationary and empirical distributions. The resulting algorithm, GenDICE, is straightforward and effective.
  arXiv  Detail & Related papers  (2020-02-21T00:27:52Z)

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.