No-go Theorem of Purification

The Shannon's bound for compression is one of the key restrictions for the compression of quantum information. Here we show that the unitarity of the compression operation imposes new bounds on the compression that are more limiting than Shannon's compression bound. This translates to a no...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2021-07
Main Author: Raeisi, Sadegh
Format: Article
Language:English
Subjects:
Algorithms
Cooling
Purification
Purity
Quantum phenomena
Qubits (quantum computing)
Theorems
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The Shannon's bound for compression is one of the key restrictions for the compression of quantum information. Here we show that the unitarity of the compression operation imposes new bounds on the compression that are more limiting than Shannon's compression bound. This translates to a no-go theorem for the purification of quantum states. For a specific case of a two-qubit system, our results indicate that it is not possible to distill purity beyond the maximum of the individual purities. We show that this restriction results in the cooling limit of the heat-bath algorithmic cooling techniques. We formalize the limitations imposed by the unitarity of the compression operation in two theorems and use the theorems to show that the limitations of unitarity lead to the cooling limit of heat-bath algorithmic cooling. To this end, we introduce a new optimal cooling technique and show that without the limitations of the unitary operations, the new cooling technique would have exceeded the limit of Heat-bath algorithmic cooling. This work opens up new avenues to understanding the limits of dynamic cooling.
ISSN:2331-8422
DOI:10.48550/arxiv.2003.01885