相关论文: Regularized maximal fidelity of the generalized Pa…

As a toy model for the capacity problem in quantum information theory we investigate finite and asymptotic regularizations of the maximum pure-state input-output fidelity $F(\cal N$) of a general quantum channel $\cal N$. We show that the…

We calculate and analyze the bounds of the Holevo capacity and classical capacity for the generalized Pauli channels. In particular, we obtain the lower and upper bounds of the Holevo capacity and show that if these bounds coincide, the…

In the problem of channel resolvability, where a given output probability distribution via a channel is approximated by transforming the uniform random numbers, characterizing the asymptotically minimum rate of the size of the random…

We analyze the classical capacity of the generalized Pauli channels generated via the memory kernel master equations. For suitable engineering of the kernel parameters, the evolution with non-local noise effects can produce dynamical maps…

We study encodings that give the best known thresholds for the non-zero capacity of quantum channels, i.e., the upper bound for correctable noise, using an entropic approach to calculation of the threshold values. Our results show that…

We introduce a new generalization of the Pauli channels using the mutually unbiased measurement operators. The resulting channels are bistochastic but their eigenvectors are not unitary. We analyze the channel properties, such as complete…

Evaluating the channel capacity is one of many key problems in information theory. In this work we derive rather-mild sufficient conditions under which the capacity is finite and achievable. These conditions are derived for generic,…

We define and study the properties of channels which are analogous to unital qubit channels in several ways. A full treatment can be given only when the dimension d is a prime power, in which case each of the (d+1) mutually unbiased bases…

We prove multiplicativity of maximal output $p$ norm of classical noise channels and thermal noise channels of arbitrary modes for all $p>1$ under the assumption that the input signal states are Gaussian states. As a direct consequence, we…

An expression is derived characterizing the set of admissible rate pairs for simultaneous transmission of classical and quantum information over a given quantum channel, generalizing both the classical and quantum capacities of the channel.…

We define a new family of codes for symmetric classical-quantum channels and establish their optimality. To this end, we extend the classical notion of generalized perfect and quasi-perfect codes to channels defined over some finite…

The Pauli channel acting on 2 x 2 matrices is generalized to an n-level quantum system. When the full matrix algebra M is decomposed into pairwise complementary subalgebras, then trace-preserving linear mappings from M to M are constructed…

We analyze the quantum capacity of a unital quantum channel, using ideas from the proof of near-optimality of Petz recovery map [Barnum and Knill 2000] and give an upper bound on the quantum capacity in terms of regularized output $2$-norm…

We prove that a general upper bound on the maximal mutual information of quantum channels is saturated in the case of Pauli channels with an arbitrary degree of memory. For a subset of such channels we explicitly identify the optimal signal…

Motivated by estimation of quantum noise models, we study the problem of learning a Pauli channel, or more generally the Pauli error rates of an arbitrary channel. By employing a novel reduction to the "Population Recovery" problem, we give…

We determine the capacity of compound classical-quantum channels. As a consequence we obtain the capacity formula for the averaged classical-quantum channels. The capacity result for compound channels demonstrates, as in the classical…

Pauli channels are ubiquitous in quantum information, both as a dominant noise source in many computing architectures and as a practical model for analyzing error correction and fault tolerance. Here we prove several results on efficiently…

Several non-asymptotic formulas are established in channel resolvability and identification capacity, and they are applied to wire-tap channel. By using these formulas, the $\epsilon$ capacities of the above three problems are considered in…

The maximal amount of information which is reliably transmitted over two uses of general Pauli channels with memory is proven to be achieved by maximally entangled states beyond some memory threshold. In particular, this proves a conjecture…

We address the question of the multiplicativity of the maximal p-norm output purities of bosonic Gaussian channels under Gaussian inputs. We focus on general Gaussian channels resulting from the reduction of unitary dynamics in larger…