Approximate virtual quantum broadcasting

• URL: http://arxiv.org/abs/2603.19476v1
• Date: Thu, 19 Mar 2026 21:17:16 GMT
• Title: Approximate virtual quantum broadcasting
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The no-broadcasting theorem, a fundamental limitation on the communication of quantum information, holds that a physical process cannot broadcast copies of an unknown quantum state to two or more receivers. Recent work has explored ways of circumventing this limitation using "virtual" implementations of non-physical processes using measurement and data-processing on statistical samples of the unknown input. However, the statistical fluctuations of this data degrades the virtual copies so much that the protocol effectively depletes, rather than proliferate, the sample size -- thereby rendering it worse than the "naive" approach of splitting the given sample and sending a subsample to each receiver. In this work, we circumvent this flaw by allowing a small amount of systematic bias in the broadcast data, resulting in approximate virtual copies. We provide efficient semidefinite programs (SDP's) to determine the minimum sample size required to keep the approximation error below a desired threshold and vice versa. For reasonably small error values, we find approximate virtual broadcasting to be viable with sample sizes smaller than naive sample-splitting would demand. Along the way, we prove several symmetry-based simplifications to the problem, allowing optimal approximate broadcasting to be characterized in terms of the simple class of depolarizing channels.

Related papers

• Pliable rejection sampling [61.01438712621603]
  We present pliable rejection sampling (PRS), a new approach to rejection sampling.<n>PRS builds on rejection sampling and comes with a guarantee on the number of accepted samples.
  arXiv  Detail & Related papers  (2026-04-24T09:21:53Z)
• Weak distillation of quantum resources [0.7434305230842789]
  We provide a general framework that lifts any quasi-probability-based protocol from expectation value estimation to a weak simulator.<n>Our method requires significantly fewer samples in a number of relevant scenarios, such as error mitigation, entanglement distillation and magic state distillation.
  arXiv  Detail & Related papers  (2026-03-26T12:04:28Z)
• Practical Quantum Broadcasting [1.9766522384767224]
  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.
  arXiv  Detail & Related papers  (2026-03-19T16:14:12Z)
• Corrected Samplers for Discrete Flow Models [36.348940136801296]
  A line of recent work has studied samplers for discrete diffusion models, such as tau-leaping and Euler solver.<n>We establish non-asymptotic discretization error bounds for those samplers without any restriction on transition rates and source distributions.<n>We rigorously show that the location-corrected sampler has a lower complexity than existing parallel samplers.
  arXiv  Detail & Related papers  (2026-01-30T03:53:22Z)
• Large Language Models Are Bad Dice Players: LLMs Struggle to Generate Random Numbers from Statistical Distributions [50.1404916337174]
  We present the first large-scale, statistically powered audit of native probabilistic sampling in large language models (LLMs)<n>We show that batch generation achieves only modest statistical validity, with a 13% median pass rate, while independent requests collapse almost entirely.<n>We conclude that current LLMs lack a functional internal sampler, necessitating the use of external tools for applications requiring statistical guarantees.
  arXiv  Detail & Related papers  (2026-01-08T22:33:12Z)
• Quantizing Diffusion Models from a Sampling-Aware Perspective [43.95032520555463]
  We propose a sampling-aware quantization strategy, wherein a Mixed-Order Trajectory Alignment technique is devised.<n>Experiments on sparse-step fast sampling across multiple datasets demonstrate that our approach preserves the rapid convergence characteristics of high-speed samplers.
  arXiv  Detail & Related papers  (2025-05-04T20:50:44Z)
• 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)
• Distributional Diffusion Models with Scoring Rules [83.38210785728994]
  Diffusion models generate high-quality synthetic data.<n> generating high-quality outputs requires many discretization steps.<n>We propose to accomplish sample generation by learning the posterior em distribution of clean data samples.
  arXiv  Detail & Related papers  (2025-02-04T16:59:03Z)
• Large Language Monkeys: Scaling Inference Compute with Repeated Sampling [81.34900892130929]
  We explore inference compute as another axis for scaling, using the simple technique of repeatedly sampling candidate solutions from a model.<n>Across multiple tasks and models, we observe that coverage scales with the number of samples over four orders of magnitude.<n>In domains like coding and formal proofs, where answers can be automatically verified, these increases in coverage directly translate into improved performance.
  arXiv  Detail & Related papers  (2024-07-31T17:57:25Z)
• 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)
• Quasiprobability decompositions with reduced sampling overhead [4.38301148531795]
  Quantum error mitigation techniques can reduce noise on current quantum hardware without the need for fault-tolerant quantum error correction. We present a new algorithm based on mathematical optimization that aims to choose the quasiprobability decomposition in a noise-aware manner.
  arXiv  Detail & Related papers  (2021-01-22T19:00:06Z)
• The Simulator: Understanding Adaptive Sampling in the Moderate-Confidence Regime [52.38455827779212]
  We propose a novel technique for analyzing adaptive sampling called the em Simulator. We prove the first instance-based lower bounds the top-k problem which incorporate the appropriate log-factors. Our new analysis inspires a simple and near-optimal for the best-arm and top-k identification, the first em practical of its kind for the latter problem.
  arXiv  Detail & Related papers  (2017-02-16T23:42:02Z)

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.