One-Shot Distributed Source Simulation: As Quantum as it Can Get

• URL: http://arxiv.org/abs/2301.04301v2
• Date: Sat, 25 Jan 2025 05:58:28 GMT
• Title: One-Shot Distributed Source Simulation: As Quantum as it Can Get
• Authors: Ian George, Min-Hsiu Hsieh, Eric Chitambar,
• Abstract summary: Distributed source simulation is the task where two (or more) parties share some correlated randomness. We characterize this task in a near-tight manner in the one-shot setting using the smooth entropy framework. This provides a strong characterization of this network task in the one-shot, quantum regime.
• Score: 13.41622790253149
• License:
• Abstract: Distributed source simulation is the task where two (or more) parties share some correlated randomness and use local operations and no communication to convert this into some target correlation. Wyner's seminal result showed that asymptotically the rate of uniform shared randomness needed for this task is given by a mutual information induced measure, now referred to as Wyner's common information. This asymptotic result was extended by Hayashi in the quantum setting to separable states, the largest class of states for which this task can be performed to vanishing error. In this work we characterize this task in a near-tight manner in the one-shot setting using the smooth entropy framework. We do this by introducing one-shot operational quantities and correlation measures that characterize them. We establish asymptotic equipartition properties for our correlation measures thereby recovering the previous vanishing-error asymptotic results. In doing so, we consider technical points in one-shot network information theory and provide methods for cardinality bounds in the smooth entropy calculus. We also introduce entangled state versions of the distributed source simulation task and determine bounds in this setting via quantum embezzling. This provides a strong characterization of this network task in the one-shot, quantum regime.

Related papers

• Decoupling by local random unitaries without simultaneous smoothing, and applications to multi-user quantum information tasks [0.0]
  We show that a simple telescoping sum trick, together with the triangle inequality and a tensorisation property of expected-contractive coefficients of random channels, allow us to achieve general simultaneous decoupling for multiple users via local actions. We obtain bounds on the expected deviation from ideal decoupling either in the one-shot setting in terms of smooth min-entropies, or the finite block length setting in terms of R'enyi entropies. This leads to one-shot, finite block length, and simultaneous achievability results for several tasks in quantum Shannon theory.
  arXiv  Detail & Related papers  (2023-04-24T14:17:32Z)
• PAPAL: A Provable PArticle-based Primal-Dual ALgorithm for Mixed Nash Equilibrium [58.26573117273626]
  We consider the non-AL equilibrium nonconptotic objective function in two-player zero-sum continuous games. Our novel insights into the particle-based algorithms for continuous distribution strategies are presented.
  arXiv  Detail & Related papers  (2023-03-02T05:08:15Z)
• Upper Bounds on the Distillable Randomness of Bipartite Quantum States [15.208790082352351]
  distillable randomness of a bipartite quantum state is an information-theoretic quantity. We prove measures of classical correlations and prove a number of their properties. We then further bound these measures from above by some that are efficiently computable by means of semi-definite programming.
  arXiv  Detail & Related papers  (2022-12-18T12:06: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)
• An Exponentially Converging Particle Method for the Mixed Nash Equilibrium of Continuous Games [0.0]
  We consider the problem of computing mixed Nash equilibria of two-player zero-sum games with continuous sets of pure strategies and with first-order access to the payoff function. This problem arises for example in game-inspired machine learning applications, such as distributionally-robust learning. We introduce and analyze a particle-based method that enjoys guaranteed local convergence for this problem.
  arXiv  Detail & Related papers  (2022-11-02T17:03:40Z)
• Robust Estimation for Nonparametric Families via Generative Adversarial Networks [92.64483100338724]
  We provide a framework for designing Generative Adversarial Networks (GANs) to solve high dimensional robust statistics problems. Our work extend these to robust mean estimation, second moment estimation, and robust linear regression. In terms of techniques, our proposed GAN losses can be viewed as a smoothed and generalized Kolmogorov-Smirnov distance.
  arXiv  Detail & Related papers  (2022-02-02T20:11:33Z)
• Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification [56.61325554836984]
  The max-relative entropy together with its smoothed version is a basic tool in quantum information theory. We derive the exact exponent for the decay of the small modification of the quantum state in smoothing the max-relative entropy based on purified distance.
  arXiv  Detail & Related papers  (2021-11-01T16:35:41Z)
• Distributed Quantum Faithful Simulation and Function Computation Using Algebraic Structured Measurements [8.594140167290098]
  We consider the task of faithfully simulating a quantum measurement acting on a joint bipartite quantum state in a distributed manner. The computation is performed on the fly, thus obviating the need to reconstruct individual measurement outcomes at Charlie.
  arXiv  Detail & Related papers  (2021-01-07T04:22:15Z)
• Gaussian Process States: A data-driven representation of quantum many-body physics [59.7232780552418]
  We present a novel, non-parametric form for compactly representing entangled many-body quantum states. The state is found to be highly compact, systematically improvable and efficient to sample. It is also proven to be a universal approximator' for quantum states, able to capture any entangled many-body state with increasing data set size.
  arXiv  Detail & Related papers  (2020-02-27T15:54:44Z)
• Finite Block Length Analysis on Quantum Coherence Distillation and Incoherent Randomness Extraction [64.04327674866464]
  We introduce a variant of randomness extraction framework where free incoherent operations are allowed before the incoherent measurement. We show that the maximum number of random bits extractable from a given quantum state is precisely equal to the maximum number of coherent bits that can be distilled from the same state. Remarkably, the incoherent operation classes all admit the same second order expansions.
  arXiv  Detail & Related papers  (2020-02-27T09:48: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.