# Data Compression for Quantum Code

Source: [Data Compression for Quantum Code](<https://www.sota2.com/research/paper/68fa1ff67a2b558e2932da2d>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-23T20:21:41.486Z

Authors: K.Y. Szeto

Published: 1996-07-12T02:28:20.000Z

## Abstract

The general scheme of data compression using the quantum noiseless coding theorem of Schumacher is dicussed for general quantum sources. When the Hilbert space of the quantum source is decomposable into orthogonal subspaces, one can first perform classical data compression before performing the quantum data compression for individual subspaces. For minimizing the resource in quantum coding, a general parameterization of the dimensions in the Jozsa-Schumacher quantum data compression scheme is presented.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/quant-ph/9607010>)

[PDF](<https://arxiv.org/pdf/quant-ph/9607010.pdf>)
