Related papers: Discriminating idempotent quantum channels
Quantum state exclusion is an operational task with application to ontological interpretations of quantum states. In such a task, one is given a system whose state is randomly selected from a finite set, and the goal is to identify a state…
We develop the theory of quantum (a.k.a. noncommutative) relations and quantum (a.k.a. noncommutative) graphs in the finite-dimensional covariant setting, where all systems (finite-dimensional $C^*$-algebras) carry an action of a compact…
The entanglement-assisted classical capacity of a quantum channel is known to provide the formal quantum generalization of Shannon's classical channel capacity theorem, in the sense that it admits a single-letter characterization in terms…
This paper presents a new derivation method of converse bounds on the non-asymptotic achievable rate of discrete weakly symmetric memoryless channels. It is based on the finite blocklength statistics of the channel, where with the use of an…
The computational problem of distinguishing two quantum channels is central to quantum computing. It is a generalization of the well-known satisfiability problem from classical to quantum computation. This problem is shown to be…
We consider a quantum system described by a quantum channel $\Phi$ that is applied at every time step and study the time evolution of its information capacities. When $\Phi$ is a GNS-symmetric channel (this includes Pauli channels, for…
Quantum process tomography, the standard procedure to characterize any quantum channel in nature, is affected by a circular argument: in order to characterize the channel, the tomographic preparation and measurement need in turn to be…
The most unstable quantum states and elementary particles possess more than a single decay channel. At the same time, it is well known that typically the decay law is not simply exponential. Therefore, it is natural to ask how to spot the…
Inspired by the `computable cross norm' or `realignment' criterion, we propose a new point of view about the characterization of the states of bipartite quantum systems. We consider a Schmidt decomposition of a bipartite density operator.…
We consider a distributed quantum hypothesis testing problem with communication constraints, in which the two hypotheses correspond to two different states of a bipartite quantum system, multiple identical copies of which are shared between…
A general scenario for an $N$-sequential conclusive state discrimination introduced recently in Loubenets and Namkung [arXiv:2102.04747] can provide a multipartite quantum communication realizable in the presence of a noise. In the present…
Reliable distribution of quantum entanglement over long distances is a central challenge in quantum information science, fundamentally limited by decoherence in noisy communication channels. In this work, we investigate the asymptotic…
We consider the task of distinguishing whether a quantum system is prepared in a state from one of several sets of quantum states. Assuming their convexity and stability under tensor product, we prove that the optimal error exponent for…
We introduce a new quantum noise deconvolution technique that does not rely on the complete knowledge of noise and does not require partial noise tomography. In this new method, we construct a set of observables with completely correctable…
We study non-asymptotic fundamental limits for transmitting classical information over memoryless quantum channels, i.e. we investigate the amount of classical information that can be transmitted when a quantum channel is used a finite…
Divergence chain rules for channels relate the divergence of a pair of channel inputs to the divergence of the corresponding channel outputs. An important special case of such a rule is the data-processing inequality, which tells us that if…
Given a general channel, we first formulate the idetification capacity problem as well as the resolvability problem with input cost constraint in as the general form as possible, along with relevant fundamental theorems. Next, we establish…
The multichannel generalization of the theory of spectral, scattering and decay control is presented. New universal algorithms of construction of complex quantum systems with given properties are suggested. Particularly, transformations of…
We obtain an explicit characterization of linear maps, in particular, quantum channels, which are covariant with respect to an irreducible representation ($U$) of a finite group ($G$), whenever $U \otimes U^c$ is simply reducible (with…
Basing on states and channels isomorphism we point out that semidefinite programming can be used as a quick test for nonzero one-way quantum channel capacity. This can be achieved by search of symmetric extensions of states isomorphic to a…