Practical Quantum Broadcasting

• URL: http://arxiv.org/abs/2603.19089v1
• Date: Thu, 19 Mar 2026 16:14:12 GMT
• Title: Practical Quantum Broadcasting
• Abstract summary: We introduce approximate and probabilistic virtual broadcasting and derive analytic expressions for their optimal sample complexity overheads.<n>For qubit systems, practical 1-to-6 virtual broadcasting becomes attainable.
• Score: 1.9766522384767224
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Incorporating sample efficiency, by requiring the number of states consumed by broadcasting does not exceed that of a naive prepare-and-distribute strategy, gives rise to the no practical quantum broadcasting theorem. To navigate this limitation, we introduce approximate and probabilistic virtual broadcasting and derive analytic expressions for their optimal sample complexity overheads. Allowing deviations at the receivers restores sample efficiency even in the 1-to-2 approximate setting, whereas probabilistic protocols obey a stronger no-go theorem that excludes all sample efficient 1-to-2 implementations for arbitrary dimension and success probability. Rather counterintuitive, this obstruction does not persist at larger receiver numbers: for qubit systems, practical 1-to-6 virtual broadcasting becomes attainable. These results elevate sample complexity from a technical constraint to a defining operational principle, opening an unexplored route to the efficient distribution of quantum information.

Related papers

• Approximate virtual quantum broadcasting [0.0]
  No-broadcasting theorem holds that a physical process cannot broadcast copies of an unknown quantum state to two or more receivers.<n>Recent work has explored ways of circumventing this limitation using "virtual" implementations of non-physical processes.<n>In this work, we circumvent this flaw by allowing a small amount of systematic bias in the broadcast data, resulting in approximate virtual copies.
  arXiv  Detail & Related papers  (2026-03-19T21:17:16Z)
• Faithful and secure distributed quantum sensing under general-coherent attacks [0.0]
  We introduce, theoretically analyze, and experimentally demonstrate single- and two-way protocols for distributed sensing.<n>We introduce a safety-threshold mechanism that allows the protocol to proceed in low-noise cases and quantifying the potential tampering with respect to the ideal estimation procedure.<n>We demonstrate our protocols in a photonic-based implementation, observing that the possibility of guaranteeing a safety threshold may come at a significant price in terms of the estimation bias.
  arXiv  Detail & Related papers  (2025-05-05T12:48:41Z)
• No Practical Quantum Broadcasting: Even Virtually [1.051878329906797]
  We prove that no linear process can uphold sample efficiency, unitary covariance, permutation invariance, and classical consistency.<n>We establish the uniqueness of the canonical 1-to-$N$ virtual broadcasting map.<n>We explore the interplay between virtual broadcasting and a quantum spacetime framework, known as the pseudo-density operator.
  arXiv  Detail & Related papers  (2025-03-20T17:43:20Z)
• 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)
• Suppressing Amplitude Damping in Trapped Ions: Discrete Weak Measurements for a Non-unitary Probabilistic Noise Filter [62.997667081978825]
  We introduce a low-overhead protocol to reverse this degradation. We present two trapped-ion schemes for the implementation of a non-unitary probabilistic filter against amplitude damping noise. This filter can be understood as a protocol for single-copy quasi-distillation.
  arXiv  Detail & Related papers  (2022-09-06T18:18:41Z)
• Valid and efficient entanglement verification with finite copies of a quantum state [0.4523163728236145]
  We show how to optimize the validity and the efficiency of entanglement detection schemes in small data sets. The method is based on an analytical model of finite statistics effects on correlation functions.
  arXiv  Detail & Related papers  (2022-08-03T11:27:45Z)
• 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)
• Nontraditional Deterministic Remote State Preparation Using a Non-Maximally Entangled Channel without Additional Quantum Resources [10.351739012146378]
  We have developed a nontraditional remote state preparation protocol that allows for deterministically transferring information encoded in quantum states. With an auxiliary particle and a simple measurement method, the success probability of preparing a d-dimensional quantum state is increased to 1 without spending additional quantum resources in advance to improve quantum channels.
  arXiv  Detail & Related papers  (2022-03-16T08:59:49Z)
• 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)
• Experimental multi-state quantum discrimination through a Quantum network [63.1241529629348]
  We have experimentally implemented two discrimination schemes in a minimum-error scenario based on a receiver featured by a network structure and a dynamical processing of information. The first protocol achieves binary optimal discrimination, while the second one provides a novel approach to multi-state quantum discrimination, relying on the dynamical features of the network-like receiver.
  arXiv  Detail & Related papers  (2021-07-21T09:26:48Z)
• Gaussian conversion protocols for cubic phase state generation [104.23865519192793]
  Universal quantum computing with continuous variables requires non-Gaussian resources. The cubic phase state is a non-Gaussian state whose experimental implementation has so far remained elusive. We introduce two protocols that allow for the conversion of a non-Gaussian state to a cubic phase state.
  arXiv  Detail & Related papers  (2020-07-07T09:19:49Z)

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.