Extendibility limits the performance of quantum processors

Resource theories in quantum information science are helpful for the study and quantification of the performance of information-processing tasks that involve quantum systems. These resource theories also find applications in other areas of study; e.g., the resource theories of entanglement and coherence have found use and implications in the study of quantum thermodynamics and memory effects in quantum dynamics. In this paper, we introduce the resource theory of unextendibility, which is associated to the inability of extending quantum entanglement in a given quantum state to multiple parties. The free states in this resource theory are the $k$-extendible states, and the free channels are $k$-extendible channels, which preserve the class of $k$-extendible states. We make use of this resource theory to derive non-asymptotic, upper bounds on the rate at which quantum communication or entanglement preservation is possible by utilizing an arbitrary quantum channel a finite number of times, along with the assistance of $k$-extendible channels at no cost. We then show that the bounds we obtain are significantly tighter than previously known bounds for both the depolarizing and erasure channels.Comment: 39 pages, 6 figures, v2 includes pretty strong converse bounds for antidegradable channels, as well as other improvement

Resource theory of unextendibility and nonasymptotic quantum capacity ()

In this paper, we introduce the resource theory of unextendibility as a relaxation of the resource theory of entanglement. The free states in this resource theory are the -extendible states, associated with the inability to extend quantum entanglement in a given quantum state to multiple parties. The free channels are -extendible channels, which preserve the class of -extendible states. We define several quantifiers of unextendibility by means of generalized divergences and establish their properties. By utilizing this resource theory, we obtain nonasymptotic upper bounds on the rate at which quantum communication or entanglement preservation is possible over a finite number of uses of an arbitrary quantum channel assisted by -extendible channels at no cost. These bounds are significantly tighter than previously known bounds for both the depolarizing and erasure channels. Finally, we revisit the pretty strong converse for the quantum capacity of antidegradable channels and establish an upper bound on the nonasymptotic quantum capacity of these channels

The McKay conjecture and Brauer's induction theorem

Let $G$ be an arbitrary finite group. The McKay conjecture asserts that $G$ and the normaliser $N_G (P)$ of a Sylow $p$-subgroup $P$ in $G$ have the same number of characters of degree not divisible by $p$ (that is, of $p'$-degree). We propose a new refinement of the McKay conjecture, which suggests that one may choose a correspondence between the characters of $p'$-degree of $G$ and $N_G (P)$ to be compatible with induction and restriction in a certain sense. This refinement implies, in particular, a conjecture of Isaacs and Navarro. We also state a corresponding refinement of the Brou\'e abelian defect group conjecture. We verify the proposed conjectures in several special cases.Comment: Minor changes made throughout the pape