Related papers: The classification of rebit quantum channels
We investigate the usefulness of side entanglement in discriminating between two generic qubit channels, {\ up to unitary pre- and post-processing,} and determine exact conditions under which it does enhance (as well as conditions under…
We investigate an original family of quantum distinguishability problems, where the goal is to perfectly distinguish between $M$ quantum states that become identical under a completely decohering map. Similarly, we study distinguishability…
Quantum computers can be considered as a natural means for performing machine learning tasks for inherently quantum labeled data. Many quantum machine learning techniques have been developed for solving classification problems, such as…
Capacities of quantum channels and decoherence times both quantify the extent to which quantum information can withstand degradation by interactions with its environment. However, calculating capacities directly is known to be intractable…
One of the major achievements of the recently emerged quantum information theory is the introduction and thorough investigation of the notion of quantum channel which is a basic building block of any data-transmitting or data-processing…
A bipartite quantum channel represents the interaction between systems, generally allowing for exchange of information. A special class of bipartite channels are the no-signaling ones, which do not allow communication. In Ref. [1] it has…
We present a framework to treat quantum networks and all possible transformations thereof, including as special cases all possible manipulations of quantum states, measurements, and channels, such as, e.g., cloning, discrimination,…
In this paper we address the issue of universal or robust communication over quantum channels. Specifically, we consider memoryless communication scenario with channel uncertainty which is an analog of compound channel in classical…
In this work, we consider the preservation of a measurement for quantum systems interacting with an environment. Namely, a method of preserving an optimal measurement over a channel is devised, what we call channel coding of a quantum…
This paper presents an overview of different concepts regarding covert channels. It discusses the various classifications and the detailing of various fields used to manipulate for the covert channel execution.Different evaluation criterias…
We investigate the quantum capacity of noisy quantum channels which can be represented by coupling a system to an effectively small environment. A capacity formula is derived for all cases where both system and environment are…
We consider fault-tolerant quantum computation in the context where there are no fresh ancilla qubits available during the computation, and where the noise is due to a general quantum channel. We show that there are three classes of noisy…
Two partial orderings among communication channels, namely, `being degradable into' and `being less noisy than,' are reconsidered in the light of recent results about statistical comparisons of quantum channels. Though our analysis covers…
We present a new application of harmonic analysis to quantum information by constructing intriguing classes of quantum channels stemming from specific representations of multiplier algebras over locally compact groups $G$. Beginning with a…
We consider discrete time feedback aimed at reclaiming quantum information after a channel action. We compare Bayesian and Markovian strategies. We show that the former does not offer any advantage for qubit channels, while its superior…
Quantum memories are a crucial precondition in many protocols for processing quantum information. A fundamental problem that illustrates this statement is given by the task of channel discrimination, in which an unknown channel drawn from a…
We review the development of the quantum version of Ahlswede and Dueck's theory of identification via channels. As is often the case in quantum probability, there is not just one but several quantizations: we know at least two different…
This work presents a differentiable geometric parameterization of quantum channels in Kraus representation, which can be efficiently probed to find an unknown quantum channel. We explore its feasibility in finding the quasi inverse…
The problem of discriminating between many quantum channels with certainty is analyzed under the assumption of prior knowledge of algebraic relations among possible channels. It is shown, by explicit construction of a novel family of…
A collection of quantum channels is called incompatible if they cannot be obtained as marginals from a single channel. No-cloning theorem is the most prominent instance of incompatibility of quantum channels. We show that every collection…