This paper considers the problem of compressing memoryless sources of quantum mixed states by using only classical communication and shared randomness between the encoder Alice and the decoder Bob. Alice knows source sequences, and it is required that the expected Uhlman fidelity between the Alice's and Bob's sequence states be asymptotically high or, equivalently, the expected trace distance be small.
Did you find this white paper useful?
29 out of 50 users found this white paper useful
Related white papers
Superior AVC HD Encoder Architecture: Single-Slice AVC Encoder Sets an Unprecedented Benchmark in HD Video Quality at Relatively Low Bit Rates
As service providers in the broadcast industry face unprecedented competition for viewers, new encoding technology can be deployed to deliver more content over existing bandwidth to deliver the new, advanced...
Bulky Data Is No Problem Thanks to Compression/Decompression in .NET 2.0
Compression is useful for reducing the size of data. Compression is extremely useful in cases where one needs to transmit data over networks, especially slow and costly networks, such as...
A Novel Visual Perceptual Model With an Application to Hi-Fidelity Image Annotation
This paper introduces a novel visual perception model that aims to quantify the localized tolerance to noise for arbitrary imagery. The model is built by mixing the outputs from an...
Reading Compressed Text Files Using SAS Software
External raw data files continuously needed at work are every day more and greater. Normally, those files come in any of the more popular compressed formats like zip, 7zip, gzip...
Distributed Data Aggregation in Sensor Networks by Regression Based Compression
This paper proposes a method for data compression and its subsequent regeneration using a polynomial regression technique. The approximate data received over the considered area by fitting it to a...
Communication Strategies and Coding for Relaying
Information-theoretic models for relaying are developed and applied to wireline and wireless networks. For wireline networks with node constraints, data compression is shown to improve rates. For wireless networks with...
Resilient Parameterized Tree Codes for Fast Adaptive Coding
This paper presents an introduction to efficient adaptive compression using parameterized prefix codes. Advanced adaptive coding techniques can be quite complex because of the need to reliably estimate the probability...
