activity
20052010
most citedLossless Quantum Prefix Compression for Communication Channels that are Always Open

7 citations · 17 across the 6 of their papers we have counts for

collaborators

6 papers

quant-ph2010

Quantum Measurements Cannot be Proved to be Random

Caroline Rogers

We show that it is impossible to prove that the outcome of a quantum measurement is random.

quant-ph2008

Second Quantized Kolmogorov Complexity

Caroline Rogers, Vlatko Vedral, Rajagopal Nagarajan

The Kolmogorov complexity of a string is the length of its shortest description. We define a second quantised Kolmogorov complexity where the length of a description is defined to…

quant-ph2008★ 7 cited

Lossless Quantum Prefix Compression for Communication Channels that are Always Open

Markus Mueller, Caroline Rogers, Rajagopal Nagarajan

We describe a method for lossless quantum compression if the output of the information source is not known. We compute the best possible compression rate, minimizing the expected b…

quant-ph2008★ 6 cited

Quantum Bit Strings and Prefix-Free Hilbert Spaces

Markus Mueller, Caroline Rogers

We give a mathematical framework for manipulating indeterminate-length quantum bit strings. In particular, we define prefixes, fragments, tensor products and concatenation of such…

quant-ph2005★ 2 cited

Lossless Quantum Compression

Caroline Rogers, Rajagopal Nagarajan

We describe lossless quantum compression of unknown mixtures (of non-orthogonal states) and give an expression of the optimal rate of compression.

quant-ph2005★ 2 cited

The Second Quantized Quantum Turing Machine and Kolmogorov Complexity

Caroline Rogers, Vlatko Vedral

The Kolmogorov complexity of a physical state is the minimal physical resources required to reproduce that state. We define a second quantized quantum Turing machine and use it to…