The Quantum Formalization Drive

We determine the exact strong converse exponent of classical-quantum channel coding, for every rate above the Holevo capacity. Our form of the exponent is an exact analogue of Arimoto's, given as a transform of the Renyi capacities with parameters alpha>1. It is important to note that, unlike in the classical case, there are many inequivalent ways to define…

Deterministic port-based teleportation (dPBT) protocol is a scheme where a quantum state is guaranteed to be transferred to another system without unitary correction. We characterize the best achievable performance of the dPBT when both the resource state and the measurement is optimized. Surprisingly, the best possible fidelity for an arbitrary number of…

With techniques borrowed from quantum information theory, we develop a method to systematically obtain operator inequalities and identities in several matrix variables. These take the form of trace polynomials: polynomial-like expressions that involve matrix monomials $X_{α_1} \cdots X_{α_r}$ and their traces $\operatorname{tr}(X_{α_1} \cdots X_{α_r})$. Our…

A programmable quantum processor uses the states of a program register to specify one element of a set of quantum channels which is applied to an input register. It is well-known that such a device is impossible with a finite-dimensional program register for any set that contains infinitely many unitary quantum channels (Nielsen and Chuang's No-Programming…

Isometry operations encode the quantum information of the input system to a larger output system, while the corresponding decoding operation would be an inverse operation of the encoding isometry operation. Given an encoding operation as a black box from a $d$-dimensional system to a $D$-dimensional system, we propose a universal protocol for isometry inversion…

The definition of quantum discord is generalized to allow for any concave entropy function, and its non-negativity strengthens the subadditivity condition for that entropy function. In a sense, this condition is intermediate in strength between subadditivity and strong subadditivity, hence called firm subadditivity, allowing one to further classify entropy…

Error correcting codes with a universal set of transversal gates are a desideratum for quantum computing. Such codes, however, are ruled out by the Eastin-Knill theorem. Moreover, the theorem also rules out codes which are covariant with respect to the action of transversal unitary operations forming continuous symmetries. In this work, starting from an…

There are two types of port-based teleportation (PBT) protocols: deterministic -- when the state always arrives to the receiver but is imperfectly transmitted and probabilistic -- when the state reaches the receiver intact with high probability. We introduce the minimal set of requirements that define a feasible PBT protocol and construct a simple PBT…

This paper studies the difficulty of discriminating between an arbitrary quantum channel and a "replacer" channel that discards its input and replaces it with a fixed state. We show that, in this particular setting, the most general adaptive discrimination strategies provide no asymptotic advantage over non-adaptive tensor-power strategies. This conclusion…

In this manuscript we analyse generalised port-based teleportation (PBT) schemes, allowing for transmitting more than one unknown quantum state (or a composite quantum state) in one go, where the state ends up in several ports at Bob's side. We investigate the efficiency of our scheme discussing both deterministic and probabilistic case, where parties share…

We present positive maps and matrix inequalities for variables from the positive cone. These inequalities contain partial transpose and reshuffling operations, and can be understood as positive multilinear maps that are in one-to-one correspondence with elements from the walled Brauer algebra. Using our formalism, these maps can be obtained in a systematic…

The ability to distribute entanglement over complex quantum networks is an important step towards a quantum internet. Recently, there has been significant theoretical effort, mainly focusing on the distribution of bipartite entanglement via a simple quantum network composed only of bipartite quantum channels. There are, however, a number of quantum…

We consider an unknown quantum state shared between two parties, Alice and Bob, and ask how much quantum communication is needed to transfer the full state to Bob. This problem is known as state merging and was introduced in [Horodecki et al., Nature, 436, 673 (2005)]. It has been shown that for free classical communication the minimal number of quantum…

The channels, and more generally superoperators acting on the trace class operators of a quantum system naturally form a Banach space under the completely bounded trace norm (aka diamond norm). However, it is well-known that in infinite dimension, the norm topology is often "too strong" for reasonable applications. Here, we explore a recently introduced…

In the asymptotic theory of quantum hypothesis testing, the minimal error probability of the first kind jumps sharply from zero to one when the error exponent of the second kind passes by the point of the relative entropy of the two states in an increasing way. This is well known as the direct part and strong converse of quantum Stein's lemma. Here we look…

Schur-Weyl duality is a powerful tool in representation theory which has many applications to quantum information theory. We provide a generalization of this duality and demonstrate some of its applications. In particular, we use it to develop a general framework for the study of a family of quantum estimation problems wherein one is given n copies of an…

We study optimal rates for quantum communication over a single use of a channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. The corresponding capacity is often referred to as the one-shot quantum capacity. In this paper, we prove bounds on the one-shot quantum capacity of an arbitrary channel. This…

We derive fidelity benchmarks for the quantum storage and teleportation of squeezed states of continuous variable systems, for input ensembles where the degree of squeezing $s$ is fixed, no information about its orientation in phase space is given, and the distribution of phase space displacements is a Gaussian. In the limit where the latter becomes flat, we…

We consider information transmission through a noiseless quantum channel, where the information is encoded into massive indistinguishable particles: bosons or fermions. We study the situation in which the particles are noninteracting. The encoding input states obey a set of physically motivated constraints on the mean values of the energy and particle…

We investigate how a classical private key can be used by two players, connected by an insecure one-way quantum channel, to perform private communication of quantum information. In particular we show that in order to transmit n qubits privately, 2n bits of shared private key are necessary and sufficient. This result may be viewed as the quantum analogue of…

Using the Lieb-Robinson inequality and the continuity property of the quantum capacities in terms of the diamond norm, we derive an upper bound on the values that these capacities can attain in spin-network communication i.i.d. models of arbitrary topology. Differently from previous results we make no assumptions on the encoding mechanisms that the sender…