Quantum State Merging for Arbitrarily Small-Dimensional Systems
arXiv:1806.07875 · doi:10.1109/TIT.2018.2889829
Abstract
Recent advances in quantum technology facilitate the realization of information processing using quantum computers at least on the small and intermediate scales of up to several dozens of qubits. We investigate entanglement cost required for one-shot quantum state merging, aiming at quantum state transformation on these scales. In contrast to existing coding algorithms achieving nearly optimal approximate quantum state merging on a large scale, we construct algorithms for exact quantum state merging so that the algorithms are applicable to any given state of an arbitrarily small-dimensional system. In the algorithms, entanglement cost can be reduced depending on a structure of the given state derived from the Koashi-Imoto decomposition. We also provide improved converse bounds for exact quantum state merging achievable for qubits but not necessarily achievable in general. As for approximate quantum state merging, we obtain algorithms and improved converse bounds by applying smoothing to those for exact state merging. Our results are applicable to distributed quantum information processing and multipartite entanglement transformation on small and intermediate scales.
arXiv comment23 pages, 2 figures
References in corpus (39)
- Quantum Computing in the NISQ era and beyond
- Conditions for a class of entanglement transformations
- Quantum information can be negative
- From Classical to Quantum Shannon Theory
- Everything You Always Wanted to Know About LOCC (But Were Afraid to Ask)
- Structure of states which satisfy strong subadditivity of quantum entropy with equality
- Entanglement-assisted local manipulation of pure quantum states
- Quantum state merging and negative information
- The mother of all protocols: Restructuring quantum information's family tree
- Local and Distributed Quantum Computation
- The Quantum Reverse Shannon Theorem based on One-Shot Information Theory
- Quantum Internet: from Communication to Distributed Computing!
- The exact cost of redistributing multipartite quantum states
- One-shot decoupling
- A family of quantum protocols
- Information preserving structures: A general framework for quantum zero-error information
- Optimal quantum source coding with quantum information at the encoder and decoder
- Chain Rules for Smooth Min- and Max-Entropies
- Quantum message compression with applications
- The apex of the family tree of protocols: Optimal rates and resource inequalities
- Catalytic Decoupling of Quantum Information
- Smooth Entropy Bounds on One-Shot Quantum State Redistribution
- Quantum state redistribution based on a generalized decoupling
- Distributed Compression and Multiparty Squashed Entanglement
- Deconstruction and conditional erasure of quantum correlations
- On the distributed compression of quantum information
- Entanglement combing
- A generalized quantum Slepian-Wolf
- An upper bound on the second order asymptotic expansion for the quantum communication cost of state redistribution
- A one-shot achievability result for quantum state redistribution
- Conditional Decoupling of Quantum Information
- A Coding Theorem for Bipartite Unitaries in Distributed Quantum Computation
- Markovianizing Cost of Tripartite Quantum States
- Decoupling with random diagonal unitaries
- Deterministic transformations of bipartite pure states
- Distributed Encoding and Decoding of Quantum Information over Networks
- Efficient achievability for quantum protocols using decoupling theorems
- Remote extraction and destruction of spread qubit information
- Fully Quantum Source Compression with a Quantum Helper
Cited by in corpus (6)
- One-shot quantum error correction of classical and quantum information
- Hierarchy of quantum operations in manipulating coherence and entanglement
- One-shot quantum state exchange
- On the distinguishability of geometrically uniform quantum states
- Exact and local compression of quantum bipartite states
- Efficient decoding of stabilizer code by single-qubit local operations and classical communication