One-Shot Randomized and Nonrandomized Partial Decoupling
arXiv:1903.05796 · doi:10.1007/s00220-021-04136-5
Abstract
We introduce a task that we call partial decoupling, in which a bipartite quantum state is transformed by a unitary operation on one of the two subsystems and then is subject to the action of a quantum channel. We assume that the subsystem is decomposed into a direct-sum-product form, which often appears in the context of quantum information theory. The unitary is chosen at random from the set of unitaries having a simple form under the decomposition. The goal of the task is to make the final state, for typical choices of the unitary, close to the averaged final state over the unitaries. We consider a one-shot scenario, and derive upper and lower bounds on the average distance between the two states. The bounds are represented simply in terms of smooth conditional entropies of quantum states involving the initial state, the channel and the decomposition. Thereby we provide generalizations of the one-shot decoupling theorem. The obtained result would lead to further development of the decoupling approaches in quantum information theory and fundamental physics.
arXiv comment56 pages, 2 figures
References in corpus (36)
- Black holes as mirrors: quantum information in random subsystems
- Fast Scramblers
- Reference frames, superselection rules, and quantum information
- Exact and Approximate Unitary 2-Designs: Constructions and Applications
- On the quantum, classical and total amount of correlations in a quantum state
- Quantum information can be negative
- The thermodynamic meaning of negative entropy
- Towards the fast scrambling conjecture
- Structure of states which satisfy strong subadditivity of quantum entropy with equality
- Evenly distributed unitaries: on the structure of unitary designs
- Quantum Data Hiding
- Quantum Information Processing with Finite Resources -- Mathematical Foundations
- Random Quantum Circuits are Approximate 2-designs
- A Fully Quantum Asymptotic Equipartition Property
- Quantum state merging and negative information
- The mother of all protocols: Restructuring quantum information's family tree
- Duality Between Smooth Min- and Max-Entropies
- A decoupling approach to the quantum capacity
- Exponential Decay of Correlations Implies Area Law
- One-shot decoupling
- Information preserving structures: A general framework for quantum zero-error information
- The structure of preserved information in quantum processes
- Decoupling with random quantum circuits
- Disordered Systems and the Replica Method in AdS/CFT
- Comment on the paper "Random Quantum Circuits are Approximate 2-designs"
- Parameters of Pseudo-Random Quantum Circuits
- Compressibility of Mixed-State Signals
- Relative Thermalization
- Quantum pseudo-randomness from cluster-state quantum computation
- Black holes as clouded mirrors: the Hayden-Preskill protocol with symmetry
- A decoupling approach to classical data transmission over quantum channels
- Conditional Decoupling of Quantum Information
- A Coding Theorem for Bipartite Unitaries in Distributed Quantum Computation
- One-shot quantum error correction of classical and quantum information
- Markovianizing Cost of Tripartite Quantum States
- One-Shot Hybrid State Redistribution
Cited by in corpus (10)
- Near-optimal covariant quantum error-correcting codes from random unitaries with symmetries
- Black holes as clouded mirrors: the Hayden-Preskill protocol with symmetry
- One-shot quantum error correction of classical and quantum information
- One-Shot Hybrid State Redistribution
- Reliability Function of Quantum Information Decoupling via the Sandwiched Rényi Divergence
- Hayden-Preskill Recovery in Hamiltonian Systems
- Superdense Coding in Resource Theory of Asymmetry
- One-Shot Triple-Resource Trade-Off in Quantum Channel Coding
- Decoding general error correcting codes and the role of complementarity
- SU(d)-Symmetric Random Unitaries: Quantum Scrambling, Error Correction, and Machine Learning