Benchmark for Quantum Teleportation with Non-Uniform Prior Distributions

• URL: http://arxiv.org/abs/2605.24861v1
• Date: Sun, 24 May 2026 04:41:19 GMT
• Title: Benchmark for Quantum Teleportation with Non-Uniform Prior Distributions
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum teleportation should surpass maximum fidelity thresholds possible with local measurements and classical communications. Benchmarks have been established when states are drawn from a uniform distribution of qubits or coherent states of harmonic oscillators. These are not applicable when there is prior knowledge about the input that skews the distribution. We determine the highest mean fidelity achievable for teleportation of states without using entanglement but drawn from a non-uniform prior distribution, specifically a von Mises - Fisher distribution. Using Bayesian methods, we derive benchmark functions for single qubit teleportation that utilize projective measurement on specific axes on the Bloch sphere. We demonstrate that similar results can be achieved with a coherent spin positive operator-valued measure (POVM), based upon heterodyne detection. These methods are then used to derive corresponding benchmarks for teleporting multi-qubit systems that we model as spin coherent states, covering the full range of particle number $N\in [1, \infty)$. The results show that fidelity thresholds to declare quantum advantage can be significantly higher than is typically assumed with uniform distribution.

Related papers

• A Berry-Esseen Bound for Quantum Lattice Systems [33.82119899094064]
  We prove a version of the Berry-Esseen theorem for quantum lattice systems.<n>We provide a rigorous convergence estimate towards the normal distribution for large but finite system size.
  arXiv  Detail & Related papers  (2026-05-05T14:58:16Z)
• Universality cost of non-Gaussian enhancement in continuous-variable quantum teleportation: A fidelity--deviation trade-off [0.0]
  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.
  arXiv  Detail & Related papers  (2026-04-22T01:55:15Z)
• Benchmarking Gaussian and non-Gaussian input states with a hybrid sampling platform [23.783112437016815]
  Paderborn Quantum Sampler (PaQS) is a hybrid platform capable of performing sampling experiments with eight Gaussian or non-Gaussian input states in a 12-mode interferometer.<n>This architecture enables direct, side-by-side benchmarking of distinct sampling regimes under otherwise identical conditions.
  arXiv  Detail & Related papers  (2025-12-09T10:02:15Z)
• 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)
• Optimal quantum state tomography with local informationally complete measurements [25.33379738135298]
  We study whether a general MPS/MPDO state can be recovered with bounded errors using only a number of state copies in the number of qubits. We provide a positive answer for a variety of common many-body quantum states, including typical short-range entangled states, random MPS/MPDO states, and thermal states of one-dimensional Hamiltonians.
  arXiv  Detail & Related papers  (2024-08-13T17:58:02Z)
• The role of shared randomness in quantum state certification with unentangled measurements [36.19846254657676]
  We study quantum state certification using unentangled quantum measurements. $Theta(d2/varepsilon2)$ copies are necessary and sufficient for state certification. We develop a unified lower bound framework for both fixed and randomized measurements.
  arXiv  Detail & Related papers  (2024-01-17T23:44:52Z)
• A Score-Based Model for Learning Neural Wavefunctions [41.82403146569561]
  We provide a new framework for obtaining properties of quantum many-body ground states using score-based neural networks. Our new framework does not require explicit probability distribution and performs the sampling via Langevin dynamics.
  arXiv  Detail & Related papers  (2023-05-25T23:44:27Z)
• Correcting for finite statistics effects in a quantum steering experiment [33.013102271622614]
  We introduce a one-sided device-independent protocol that corrects for apparent signaling effects in experimental probability distributions.<n>Our results show a significantly higher probability of violation than existing state-of-the-art inequalities.<n>This work demonstrates the power of semidefinite programming for entanglement verification and brings quantum networks closer to practical applications.
  arXiv  Detail & Related papers  (2023-05-23T14:39:08Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Beyond the Best: Estimating Distribution Functionals in Infinite-Armed Bandits [40.71199236098642]
  In the infinite-armed bandit problem, each arm's average reward is sampled from an unknown distribution. We consider a general class of distribution functionals beyond the maximum, and propose unified meta algorithms for both the offline and online settings.
  arXiv  Detail & Related papers  (2022-11-01T18:20:10Z)
• Witnessing non-Markovianity by Quantum Quasi-Probability Distributions [0.0]
  We employ frames consisting of rank-one projectors (i.e. pure quantum states) and their induced informationally complete quantum measurements (IC-POVMs) to represent generally mixed quantum states by quasi-probability distributions. We explain that the Kolmogorov distances between these quasi-probability distributions lead to upper and lower bounds of the trace distance which measures the distinguishability of quantum states.
  arXiv  Detail & Related papers  (2022-10-12T10:02:23Z)
• Average-case Speedup for Product Formulas [69.68937033275746]
  Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states. Our results open doors to the study of quantum algorithms in the average case.
  arXiv  Detail & Related papers  (2021-11-09T18:49:48Z)
• Learnability of the output distributions of local quantum circuits [53.17490581210575]
  We investigate, within two different oracle models, the learnability of quantum circuit Born machines. We first show a negative result, that the output distributions of super-logarithmic depth Clifford circuits are not sample-efficiently learnable. We show that in a more powerful oracle model, namely when directly given access to samples, the output distributions of local Clifford circuits are computationally efficiently PAC learnable.
  arXiv  Detail & Related papers  (2021-10-11T18:00:20Z)
• Distributed quantum phase sensing for arbitrary positive and negative weights [2.5496329090462626]
  We propose an optimal distributed quantum phase sensing scheme using Gaussian states with zero displacement for an arbitrary distribution of the weights with positive and negative signs. The estimation precision of the optimal scheme is derived, and shown to be achievable by using squeezed states injected into linear beam-splitter networks. We also provide a deeper understanding of our finding by focusing on the two-mode case, in comparison with the cases using non-Gaussian probe states.
  arXiv  Detail & Related papers  (2021-08-09T15:38:59Z)
• Quantum data hiding with continuous variable systems [8.37609145576126]
  We investigate data hiding in the context of continuous variable quantum systems. We look at the case where $mathcalM=mathrmLOCC$, the set of measurements implementable with local operations and classical communication. We perform a rigorous quantitative analysis of the error introduced by the non-ideal Braunstein-Kimble quantum teleportation protocol.
  arXiv  Detail & Related papers  (2021-02-01T19:00:14Z)

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.