Related papers: On the reversible extraction of classical informat…
We resume the investigation of the problem of independent local compression of correlated quantum sources, the classical case of which is covered by the celebrated Slepian-Wolf theorem. We focus specifically on classical-quantum (cq)…
The operational structure of quantum couplings and entanglements is studied and classified for semifinite von Neumann algebras. We show that the classical-quantum correspondences such as quantum encodings can be treated as diagonal…
We address the question whether quantum memory is more powerful than classical memory. In particular, we consider a setting where information about a random n-bit string X is stored in r classical or quantum bits, for r<n, i.e., the stored…
Classical communication through quantum channels may be enhanced by sharing entanglement. Superdense coding allows the encoding, and transmission, of up to two classical bits of information in a single qubit. In this paper, the maximum…
We consider state redistribution of a "hybrid" information source that has both classical and quantum components. The sender transmits classical and quantum information at the same time to the receiver, in the presence of classical and…
The correspondence principle states that classical mechanics emerges from quantum mechanics in the appropriate limits. However, beyond this heuristic rule, an information-theoretic perspective reveals that classical mechanics is a…
Consider a situation in which a quantum system is secretly prepared in a state chosen from the known set of states. We present a principle that gives a definite distinction between the operations that preserve the states of the system and…
The quantum entropy-typical subspace theory is specified. It is shown that any mixed state with von Neumann entropy less than h can be preserved approximately by the entropy-typical subspace with entropy= h. This result implies an universal…
Copying information is an elementary operation in classical information processing. However, copying seems rather different in the quantum regime. Since the discovery of the universal quantum cloning machine, much has been found from the…
We study the nature of the information preserved by a quantum channel via the observables which exist in its image (in the Heisenberg picture), and can therefore be simulated on the receiver's side. The sharp observables preserved by a…
Most coding theorems in quantum Shannon theory can be proven using the decoupling technique: to send data through a channel, one guarantees that the environment gets no information about it; Uhlmann's theorem then ensures that the receiver…
The information provided by a classical measurement is unambiguously determined by the mutual information between the output results and the measured quantity. However, quantum mechanically there are at least two notions of information…
This thesis addresses problems in the field of quantum information theory. The first part of the thesis is opened with concrete definitions of general quantum source models and their compression, and each subsequent chapter addresses the…
We extend the data compression theorem to the case of ergodic quantum information sources. Moreover, we provide an asymptotically optimal compression scheme which is based on the concept of high probability subspaces. The rate of this…
We design a quantum method for classical information compression that exploits the hidden subgroup quantum algorithm. We consider sequence data in a database with a priori unknown symmetries of the hidden subgroup type. We prove that data…
We discuss the capacity of quantum channels for information transmission and storage. Quantum channels have dual uses: they can be used to transmit known quantum states which code for classical information, and they can be used in a purely…
The general stable quantum memory unit is a hybrid consisting of a classical digit with a quantum digit (qudit) assigned to each classical state. The shape of the memory is the vector of sizes of these qudits, which may differ. We determine…
A fully general strong converse for channel coding states that when the rate of sending classical information exceeds the capacity of a quantum channel, the probability of correctly decoding goes to zero exponentially in the number of…
In this work we initiate the question of whether quantum devices can provide us with an almost perfect source of classical randomness, and more generally, suffice for classical cryptographic tasks, such as encryption. Indeed, it is well…
While a positive operator valued measure gives the probabilities in a quantum measurement, an instrument gives both the probabilities and the a posteriori states. By interpreting the instrument as a quantum channel and by using the…