Decoupling by local random unitaries without simultaneous smoothing, and applications to multi-user quantum information tasks

• URL: http://arxiv.org/abs/2304.12114v2
• Date: Tue, 29 Aug 2023 11:00:08 GMT
• Title: Decoupling by local random unitaries without simultaneous smoothing, and applications to multi-user quantum information tasks
• Authors: Pau Colomer and Andreas Winter
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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. Employing both old [Dupuis et al. Commun. Math. Phys. 328:251-284 (2014)] and new methods [Dupuis, arXiv:2105.05342], 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. These bounds are essentially optimal without the need to address the simultaneous smoothing conjecture, which remains unresolved. This leads to one-shot, finite block length, and asymptotic achievability results for several tasks in quantum Shannon theory, including local randomness extraction of multiple parties, multi-party assisted entanglement concentration, multi-party quantum state merging, and quantum coding for the quantum multiple access channel. Because of the one-shot nature of our protocols, we obtain achievability results without the need for time-sharing, which at the same time leads to easy proofs of the asymptotic coding theorems. We show that our one-shot decoupling bounds furthermore yield achievable rates (so far only conjectured) for all four tasks in compound settings, that is for only partially known i.i.d. source or channel, which are furthermore optimal for entanglement of assistance and state merging.

Related papers

• One-Shot Min-Entropy Calculation And Its Application To Quantum Cryptography [21.823963925581868]
  We develop a one-shot lower bound calculation technique for the min-entropy of a classical-quantum state. It gives an alternative tight finite-data analysis for the well-known BB84 quantum key distribution protocol. It provides a security proof for a novel source-independent continuous-variable quantum random number generation protocol.
  arXiv  Detail & Related papers  (2024-06-21T15:11:26Z)
• Stochastic Quantum Sampling for Non-Logconcave Distributions and Estimating Partition Functions [13.16814860487575]
  We present quantum algorithms for sampling from nonlogconcave probability distributions. $f$ can be written as a finite sum $f(x):= frac1Nsum_k=1N f_k(x)$.
  arXiv  Detail & Related papers  (2023-10-17T17:55:32Z)
• Quantum soft-covering lemma with applications to rate-distortion coding, resolvability and identification via quantum channels [7.874708385247353]
  We prove a one-shot quantum covering lemma in terms of smooth min-entropies. We provide new upper bounds on the unrestricted and simultaneous identification capacities of quantum channels.
  arXiv  Detail & Related papers  (2023-06-21T17:53:22Z)
• Quantum Broadcast Channel Simulation via Multipartite Convex Splitting [25.103483428654375]
  Communication cost of quantum broadcast channel simulation is characterized by an efficiently computable single-letter formula. New one-shot achievability result for multipartite quantum state splitting via multipartite convex splitting is presented.
  arXiv  Detail & Related papers  (2023-04-24T12:48:17Z)
• PAPAL: A Provable PArticle-based Primal-Dual ALgorithm for Mixed Nash Equilibrium [62.51015395213579]
  We consider the non-AL equilibrium nonconptotic objective function in two-player zero-sum continuous games. The proposed algorithm employs the movements of particles to represent the updates of random strategies for the $ilon$-mixed Nash equilibrium.
  arXiv  Detail & Related papers  (2023-03-02T05:08:15Z)
• 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)
• 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)
• Entanglement catalysis for quantum states and noisy channels [41.94295877935867]
  We investigate properties of entanglement and its role for quantum communication. For transformations between bipartite pure states, we prove the existence of a universal catalyst. We further develop methods to estimate the number of singlets which can be established via a noisy quantum channel.
  arXiv  Detail & Related papers  (2022-02-10T18:36:25Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Computing conditional entropies for quantum correlations [10.549307055348596]
  In particular, we find new upper bounds on the minimal global detection efficiency required to perform device-independent quantum key distribution. We introduce the family of iterated mean quantum R'enyi divergences with parameters $alpha_k = 1+frac12k-1$ for positive integers $k$. We show that the corresponding conditional entropies admit a particularly nice form which, in the context of device-independent optimization, can be relaxed to a semidefinite programming problem.
  arXiv  Detail & Related papers  (2020-07-24T15:27:51Z)
• One-Shot Triple-Resource Trade-Off in Quantum Channel Coding [9.137554315375919]
  We analyze a task in which classical and quantum messages are simultaneously communicated via a noisy quantum channel. We derive direct and converse bounds for the one-shot capacity region, represented by the smooth conditional entropies and the error tolerance.
  arXiv  Detail & Related papers  (2020-04-27T06:20:10Z)

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.