Related papers: Lossless Quantum Compression
In quantum metrology, information about unknown parameters $\mathbf{\theta} = (\theta_1,\ldots,\theta_M)$ is accessed by measuring probe states $\hat{\rho}_{\mathbf{\theta}}$. In experimental settings where copies of…
We determine the optimal entanglement rate of quantum state merging when assuming that the state is unknown except for its membership in a certain set of states. We find that merging is possible at the lowest rate allowed by the individual…
In this paper, we target the practical implementation issues of quantum multicast networks. First, we design a recursive lossless compression that allows us to control the trade-off between the circuit complexity and the dimension of the…
We introduce a new aspect of nonlocality which arises when the task of quantum states distinguishability is considered under local operations and shared entanglement in the absence of classical communication. We find the optimal amount of…
Quantum state elimination measurements tell us what states a quantum system does not have. This is different from state discrimination, where one tries to determine what the state of a quantum system is, rather than what it is not. Apart…
Quantum mechanics forbids deterministic discrimination among non-orthogonal states. Nonetheless, the capability to distinguish nonorthogonal states unambiguously is an important primitive in quantum information processing. In this work, we…
An alternative approach to two-part 'critical compression' is presented. Whereas previous results were based on summing a lossless code at reduced precision with a lossy-compressed error or noise term, the present approach uses a similar…
We discuss a model for quantum computing with initially mixed states. Although such a computer is known to be less powerful than a quantum computer operating with pure (entangled) states, it may efficiently solve some problems for which no…
We consider the problem of determining the state of an unknown quantum sequence without error. The elements of the given sequence are drawn with equal probability from a known set of linearly independent pure quantum states with the…
Suppose that a quantum source is known to have von Neumann entropy less than or equal to S but is otherwise completely unspecified. We describe a method of universal quantum data compression which will faithfully compress the quantum…
We investigate the phase enhancement of quantum states subject to non-linear phase shifts. The optimal phase estimation of even entangled coherent states (ECSs) is shown to be better than that of NOON states and of odd ECS states with the…
We investigate the undetermined sets consisting of two-level, multi-partite pure quantum states, whose reduced density matrices give absolutely no information of their original states. Two approached of finding these quantum states are…
The problem of lossless data compression with side information available to both the encoder and the decoder is considered. The finite-blocklength fundamental limits of the best achievable performance are defined, in two different versions…
We present a compressive quantum process tomography scheme that fully characterizes any rank-deficient completely-positive process with no a priori information about the process apart from the dimension of the system on which the process…
As a ubiquitous aspect of modern information technology, data compression has a wide range of applications. Therefore, a quantum autoencoder which can compress quantum information into a low-dimensional space is fundamentally important to…
The impossibility of deterministic and error-free discrimination among nonorthogonal quantum states lies at the core of quantum theory and constitutes a primitive for secure quantum communication. Demanding determinism leads to errors,…
It is shown that local distinguishability of orthogonal mixed states can be completely characterized by local distinguishability of their supports irrespective of entanglement and mixedness of the states. This leads to two kinds of upper…
Data compression algorithms typically rely on identifying repeated sequences of symbols from the original data to provide a compact representation of the same information, while maintaining the ability to recover the original data from the…
Given a mixture of states, finding a way to optimally discriminate its elements is a prominent problem in quantum communication theory. In this paper, we will address mixtures of density operators that are unitarily equivalent via elements…
Quantum information refers to the distinctive information-processing properties of quantum systems, which arise when information is stored in or retrieved from nonorthogonal quantum states. More information is required to prepare an…