Single-shot Quantum State Merging

Abstract

We consider an unknown quantum state shared between two parties, Alice and Bob, and ask how much quantum communication is needed to transfer the full state to Bob. This problem is known as state merging and was introduced in [Horodecki et al., Nature, 436, 673 (2005)]. It has been shown that for free classical communication the minimal number of quantum bits that need to be sent from Alice to Bob is given by the conditional von Neumann entropy. However this result only holds asymptotically (in the sense that Alice and Bob share initially many identical copies of the state) and it was unclear how much quantum communication is necessary to merge a single copy. We show that the minimal amount of quantum communication needed to achieve this single-shot state merging is given by minus the smooth conditional min-entropy of Alice conditioned on the environment. This gives an operational meaning to the smooth conditional min-entropy.

33 pages, Diploma thesis, ETH Zurich, February 2008

References in corpus (2)

• Quantum information can be negative
• Smooth Renyi Entropies and the Quantum Information Spectrum

Cited by in corpus (40)

• Quantum Information Processing with Finite Resources -- Mathematical Foundations
• Leftover Hashing Against Quantum Side Information
• Duality Between Smooth Min- and Max-Entropies
• Uncertainty relations from simple entropic properties
• One-shot decoupling
• Chain Rules for Smooth Min- and Max-Entropies
• Decoupling with random quantum circuits
• Relating different quantum generalizations of the conditional Renyi entropy
• Quantum message compression with applications
• Principles of Quantum Communication Theory: A Modern Approach
• Quantum Coding with Finite Resources
• Distilling entanglement from arbitrary resources
• The Information Theoretic Interpretation of the Length of a Curve
• The apex of the family tree of protocols: Optimal rates and resource inequalities
• Generalized Entropies
• The Smooth Entropy Formalism for von Neumann Algebras
• Strong converse theorems using Rényi entropies
• Chain rules for quantum Rényi entropies
• A generalized quantum Slepian-Wolf
• Pretty good measures in quantum information theory
• Convex-split and hypothesis testing approach to one-shot quantum measurement compression and randomness extraction
• One-shot holography
• A one-shot achievability result for quantum state redistribution
• One-shot decoupling and Page curves from a dynamical model for black hole evaporation
• Quantum Side Information: Uncertainty Relations, Extractors, Channel Simulations
• Multiparty quantum protocols for assisted entanglement distillation
• The refined quantum extremal surface prescription from the asymptotic equipartition property
• Communication Complexity of One-Shot Remote State Preparation
• Decoupling by local random unitaries without simultaneous smoothing, and applications to multi-user quantum information tasks
• Quantum Causal Structure and Quantum Thermodynamics
• One-shot Multiparty State Merging
• Direct Sum Theorem for Bounded Round Quantum Communication Complexity
• Noisy quantum state redistribution with promise and the Alpha-bit
• On the Second-Order Asymptotics of the Partially Smoothed Conditional Min-Entropy & Application to Quantum Compression
• State transfer with quantum side information
• A strong converse for the quantum state merging protocol
• Entanglement theory in distributed quantum information processing
• Quantum security and theory of decoherence
• Squashed quantum non-Markovianity: a measure of genuine quantum non-Markovianity in states
• Quantum Correlations, Chaos and Information