Search

Given an operator $\phi:X\rightarrow Y$ between Banach spaces, we consider its tensor powers $\phi^{\otimes k}$ as operators from the $k$-fold injective tensor product of $X$ to the $k$-fold projective tensor product of $Y$. We show that after taking the $k$th root, the operator norm of $\phi^{\otimes k}$ converges to the $2$-dominated norm $\gamma^*_2(\phi)$, one of the standard operator ideal norms., Comment: 11 pages, no figures

Given an operator system $\mathcal{S}$, we define the parameters $r_k(\mathcal{S})$ (resp. $d_k(\mathcal{S})$) defined as the maximal value of the completely bounded norm of a unital $k$-positive map from an arbitrary operator system into $\mathcal{S}$ (resp. from $\mathcal{S}$ into an arbitrary operator system). In the case of the matrix algebras $M_n$, for $1 \leq k \leq n$, we compute the exact value $r_k(M_n) = \frac{2n-k}{k}$ and show upper and lower bounds on the parameters $d_k(M_n)$. Moreover, when $\mathcal{S}$ is a finite-dimensional operator system, adapting recent results of Passer and the 4th author, we show that the sequence $(r_k( \mathcal{S}))$ tends to $1$ if and only if $\mathcal{S}$ is exact and that the sequence $(d_k(\mathcal{S}))$ tends to $1$ if and only if $\mathcal{S}$ has the lifting property., Comment: Journal of the London Mathematical Society (to appear)

We show that the quantum generalization of the $2$-Wasserstein distance proposed by Chakrabarti et al. is not monotone under partial traces. This disproves a recent conjecture by Friedland et al. Finally, we propose a stabilized version of the original definition, which we show to be monotone under the application of general quantum channels., Comment: 9 pages. Comments are welcome

Channel capacities quantify the optimal rates of sending information reliably over noisy channels. Usually, the study of capacities assumes that the circuits which sender and receiver use for encoding and decoding consist of perfectly noiseless gates. In the case of communication over quantum channels, however, this assumption is widely believed to be unrealistic, even in the long-term, due to the fragility of quantum information, which is affected by the process of decoherence. Christandl and M\"uller-Hermes have therefore initiated the study of fault-tolerant channel coding for quantum channels, i.e. coding schemes where encoder and decoder circuits are affected by noise, and have used techniques from fault-tolerant quantum computing to establish coding theorems for sending classical and quantum information in this scenario. Here, we extend these methods to the case of entanglement-assisted communication, in particular proving that the fault-tolerant capacity approaches the usual capacity when the gate error approaches zero. A main tool, which might be of independent interest, is the introduction of fault-tolerant entanglement distillation. We furthermore focus on the modularity of the techniques used, so that they can be easily adopted in other fault-tolerant communication scenarios.

A separable quantum state shared between parties $A$ and $B$ can be symmetrically extended to a quantum state shared between party $A$ and parties $B_1,\ldots ,B_k$ for every $k\in\mathbf{N}$. Quantum states that are not separable, i.e., entangled, do not have this property. This phenomenon is known as "monogamy of entanglement". We show that monogamy is not only a feature of quantum theory, but that it characterizes the minimal tensor product of general pairs of convex cones $\mathsf{C}_A$ and $\mathsf{C}_B$: The elements of the minimal tensor product $\mathsf{C}_A\otimes_{\min} \mathsf{C}_B$ are precisely the tensors that can be symmetrically extended to elements in the maximal tensor product $\mathsf{C}_A\otimes_{\max} \mathsf{C}^{\otimes_{\max} k}_B$ for every $k\in\mathbf{N}$. Equivalently, the minimal tensor product of two cones is the intersection of the nested sets of $k$-extendible tensors. It is a natural question when the minimal tensor product $\mathsf{C}_A\otimes_{\min} \mathsf{C}_B$ coincides with the set of $k$-extendible tensors for some finite $k$. We show that this is universally the case for every cone $\mathsf{C}_A$ if and only if $\mathsf{C}_B$ is a polyhedral cone with a base given by a product of simplices. Our proof makes use of a new characterization of products of simplices up to affine equivalence that we believe is of independent interest., Comment: 16 pages, 2 figures

In a recent paper, Hirche and Leditzky introduced the notion of bi-PPT channels which are quantum channels that stay completely positive under composition with a transposition and such that the same property holds for one of their complementary channels. They asked whether there are examples of such channels that are not antidegradable. We show that this is not the case, since bi-PPT channels are always entanglement breaking. We also show that degradable quantum channels staying completely positive under composition with a transposition are entanglement breaking., Comment: A reference to an earlier work by Hayashi and Chen is added, in which the authors establish the same results as we do, although they are formulated in the language of quantum states

Let $\phi$ be a linear map from the $n\times n$ matrices ${\mathcal M}_n$ to the $m\times m$ matrices ${\mathcal M}_m$. It is known that $\phi$ is $2$-positive if and only if for all $K\in {\mathcal M}_n$ and all strictly positive $X\in {\mathcal M}_n$, $\phi(K^*X^{-1}K) \geq \phi(K)^*\phi(X)^{-1}\phi(K)$. This inequality is not generally true if $\phi$ is merely a Schwarz map. We show that the corresponding tracial inequality ${\rm Tr}[\phi(K^*X^{-1}K)] \geq {\rm Tr}[\phi(K)^*\phi(X)^{-1}\phi(K)]$ holds for a wider class of positive maps that is specified here. We also comment on the connections of this inequality with various monotonicity that have found wide use in mathematical physics, and apply it, and a close relative, to obtain some new, definitive results., Comment: v4 corrects a number of small typos and includes some additional results and discussion

The threshold theorem is a fundamental result in the theory of fault-tolerant quantum computation stating that arbitrarily long quantum computations can be performed with a polylogarithmic overhead provided the noise level is below a constant level. A recent work by Fawzi, Grospellier and Leverrier (FOCS 2018) building on a result by Gottesman (QIC 2013) has shown that the space overhead can be asymptotically reduced to a constant independent of the circuit provided we only consider circuits with a length bounded by a polynomial in the width. In this work, using a minimal model for quantum fault tolerance, we establish a general lower bound on the space overhead required to achieve fault tolerance. For any non-unitary qubit channel $\mathcal{N}$ and any quantum fault tolerance schemes against $\mathrm{i.i.d.}$ noise modeled by $\mathcal{N}$, we prove a lower bound of $\max\left\{\mathrm{Q}(\mathcal{N})^{-1}n,\alpha_\mathcal{N} \log T\right\}$ on the number of physical qubits, for circuits of length $T$ and width $n$. Here, $\mathrm{Q}(\mathcal{N})$ denotes the quantum capacity of $\mathcal{N}$ and $\alpha_\mathcal{N}>0$ is a constant only depending on the channel $\mathcal{N}$. In our model, we allow for qubits to be replaced by fresh ones during the execution of the circuit and we allow classical computation to be free and perfect. This improves upon results that assumed classical computations to be also affected by noise, and that sometimes did not allow for fresh qubits to be added. Along the way, we prove an exponential upper bound on the maximal length of fault-tolerant quantum computation with amplitude damping noise resolving a conjecture by Ben-Or, Gottesman, and Hassidim (2013)., Comment: 22 pages, 2 figures, an earlier version of this paper appeared in proceedings of ITCS 2022. In the current version, Lemma 10 has been simplified and some bounds are improved

We study the asymptotic behaviour of large tensor powers of normed spaces and of operators between them. We define the tensor radius of a finite-dimensional normed space $X$ as the limit of the sequence $A_k^{1/k}$, where $A_k$ is the equivalence constant between the projective and injective norms on $X^{\otimes k}$. We show that Euclidean spaces are characterized by the property that their tensor radius equals their dimension. Moreover, we compute the tensor radius for spaces with enough symmetries, such as the spaces $\ell_p^n$. We also define the tensor radius of an operator $T$ as the limit of the sequence $B_k^{1/k}$, where $B_k$ is the injective-to-projective norm of $T^{\otimes k}$. We show that the tensor radius of an operator whose domain or range is Euclidean is equal to its nuclear norm, and give some evidence that this property might characterize Euclidean spaces., Comment: 17 pages, no figures

Every multipartite entangled quantum state becomes fully separable after an entanglement breaking quantum channel acted locally on each of its subsystems. Whether there are other quantum channels with this property has been an open problem with important implications for entanglement theory (e.g., for the distillation problem and the PPT squared conjecture). We cast this problem in the general setting of proper convex cones in finite-dimensional vector spaces. The entanglement annihilating maps transform the $k$-fold maximal tensor product of a cone $C_1$ into the $k$-fold minimal tensor product of a cone $C_2$, and the pair $(C_1,C_2)$ is called resilient if all entanglement annihilating maps are entanglement breaking. Our main result is that $(C_1,C_2)$ is resilient if either $C_1$ or $C_2$ is a Lorentz cone. Our proof exploits the symmetries of the Lorentz cones and applies two constructions resembling protocols for entanglement distillation: As a warm-up, we use the multiplication tensors of real composition algebras to construct a finite family of generalized distillation protocols for Lorentz cones, containing the distillation protocol for entangled qubit states by Bennett et al. as a special case. Then, we construct an infinite family of protocols using solutions to the Hurwitz matrix equations. After proving these results, we focus on maps between cones of positive semidefinite matrices, where we derive necessary conditions for entanglement annihilation similar to the reduction criterion in entanglement distillation. Finally, we apply results from the theory of Banach space tensor norms to show that the Lorentz cones are the only cones with a symmetric base for which a certain stronger version of the resilience property is satisfied., Comment: 39 pages, no figures, extended results in appendix

Designing encoding and decoding circuits to reliably send messages over many uses of a noisy channel is a central problem in communication theory. When studying the optimal transmission rates achievable with asymptotically vanishing error it is usually assumed that these circuits can be implemented using noise-free gates. While this assumption is satisfied for classical machines in many scenarios, it is not expected to be satisfied in the near term future for quantum machines where decoherence leads to faults in the quantum gates. As a result, fundamental questions regarding the practical relevance of quantum channel coding remain open. By combining techniques from fault-tolerant quantum computation with techniques from quantum communication, we initiate the study of these questions. We introduce fault-tolerant versions of quantum capacities quantifying the optimal communication rates achievable with asymptotically vanishing total error when the encoding and decoding circuits are affected by gate errors with small probability. Our main results are threshold theorems for the classical and quantum capacity: For every quantum channel $T$ and every $\epsilon>0$ there exists a threshold $p(\epsilon,T)$ for the gate error probability below which rates larger than $C-\epsilon$ are fault-tolerantly achievable with vanishing overall communication error, where $C$ denotes the usual capacity. Our results are not only relevant in communication over large distances, but also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise than affecting the local gates., Comment: 56 pages, 6 figures. Corrected some mistakes and restructured the article

To divide a cake into equal sized pieces most people use a knife and a mixture of luck and dexterity. These attempts are often met with varying success. Through precise geometric constructions performed with the knife replacing Euclid's straightedge and without using a compass we find methods for solving certain cake-cutting problems exactly. Since it is impossible to exactly bisect a circular cake when its center is not known, our constructions need to use multiple cakes. Using three circular cakes we present a simple method for bisecting each of them or to find their centers. Moreover, given a cake with marked center we present methods to cut it into n pieces of equal size for n=3,4 and 6. Our methods are based upon constructions by Steiner and Cauer from the 19th and early 20th century., Comment: 9 pages, 11 figures. Simplified proof of main result

It is a well-known result due to E. St{\o}rmer that every positive qubit map is decomposable into a sum of a completely positive map and a completely copositive map. Here, we generalize this result to tensor squares of qubit maps. Specifically, we show that any positive tensor product of a qubit map with itself is decomposable. This solves a recent conjecture by S. Fillipov and K. Magadov. We contrast this result with examples of non-decomposable positive maps arising as the tensor product of two distinct qubit maps or as the tensor square of a decomposable map from a qubit to a ququart. To show our main result, we reduce the problem to Pauli diagonal maps. We then characterize the cone of decomposable ququart Pauli diagonal maps by determining all 252 extremal rays of ququart Pauli diagonal maps that are both completely positive and completely copositive. These extremal rays split into three disjoint orbits under a natural symmetry group, and two of these orbits contain only entanglement breaking maps. Finally, we develop a general combinatorial method to determine the extremal rays of Pauli diagonal maps that are both completely positive and completely copositive between multi-qubit systems using the ordered spectra of their Choi matrices. Classifying these extremal rays beyond ququarts is left as an open problem., Comment: 63 pages, 4 figures, 3 tables. Matlab code to verify one of the main results is included as auxiliary material. Comments are welcome!

In his solution of Hilbert's 17th problem Artin showed that any positive definite polynomial in several variables can be written as the quotient of two sums of squares. Later Reznick showed that the denominator in Artin's result can always be chosen as an $N$-th power of the squared norm of the variables and gave explicit bounds on $N$. By using concepts from quantum information theory (such as partial traces, optimal cloning maps, and an identity due to Chiribella) we give simpler proofs and minor improvements of both real and complex versions of this result. Moreover, we discuss constructions of Hilbert identities using Gaussian integrals and we review an elementary method to construct complex spherical designs. Finally, we apply our results to give improved bounds for exponential quantum de Finetti theorems in the real and in the complex setting.

For many completely positive maps repeated compositions will eventually become entanglement breaking. To quantify this behaviour we develop a technique based on the Schmidt number: If a completely positive map breaks the entanglement with respect to any qubit ancilla, then applying it to part of a bipartite quantum state will result in a Schmidt number bounded away from the maximum possible value. Iterating this result puts a successively decreasing upper bound on the Schmidt number arising in this way from compositions of such a map. By applying this technique to completely positive maps in dimension three that are also completely copositive we prove the so called PPT squared conjecture in this dimension. We then give more examples of completely positive maps where our technique can be applied, e.g.~maps close to the completely depolarizing map, and maps of low rank. Finally, we study the PPT squared conjecture in more detail, establishing equivalent conjectures related to other parts of quantum information theory, and we prove the conjecture for Gaussian quantum channels., Comment: 24 pages, no pictures

Both completely positive and completely copositive maps stay decomposable under tensor powers, i.e under tensoring the linear map with itself. But are there other examples of maps with this property? We show that this is not the case: Any decomposable map, that is neither completely positive nor completely copositive, will lose decomposability eventually after taking enough tensor powers. Moreover, we establish explicit bounds to quantify when this happens. To prove these results we use a symmetrization technique from the theory of entanglement distillation, and analyze when certain symmetric maps become non-decomposable after taking tensor powers. Finally, we apply our results to construct new examples of non-decomposable positive maps, and establish a connection to the PPT squared conjecture., Comment: 26 pages, 3 figures

Genuine high-dimensional entanglement, i.e. the property of having a high Schmidt number, constitutes a resource in quantum communication, overcoming limitations of low-dimensional systems. States with a positive partial transpose (PPT), on the other hand, are generally considered weakly entangled, as they can never be distilled into pure entangled states. This naturally raises the question, whether high Schmidt numbers are possible for PPT states. Volume estimates suggest that optimal, i.e. linear, scaling in local dimension should be possible, albeit without providing an insight into the possible slope. We provide the first explicit construction of a family of PPT states that achieves linear scaling in local dimension and we prove that random PPT states typically share this feature. Our construction also allows us to answer a recent question by Chen et al. on the existence of PPT states whose Schmidt number increases by an arbitrarily large amount upon partial transposition. Finally, we link the Schmidt number to entangled sub-block matrices of a quantum state. We use this connection to prove that quantum states invariant under partial transposition on the smaller of their two subsystems cannot have maximal Schmidt number. This generalizes a well-known result by Kraus et al. We also show that the Schmidt number of absolutely PPT states cannot be maximal, contributing to an open problem in entanglement theory., Comment: 17 pages, no figure

We show that any unital qubit channel can be implemented by letting the input system interact unitarily with a $4$-dimensional environment in the maximally mixed state and then tracing out the environment. We also provide an example where the dimension of such an environment has to be at least $3$., Comment: 8 pages, no pictures

There are none., Comment: 9 pages, no figures

We study the speed of convergence of a primitive quantum time evolution towards its fixed point in the distance of sandwiched R\'enyi divergences. For each of these distance measures the convergence is typically exponentially fast and the best exponent is given by a constant (similar to a logarithmic Sobolev constant) depending only on the generator of the time evolution. We establish relations between these constants and the logarithmic Sobolev constants as well as the spectral gap. An important consequence of these relations is the derivation of mixing time bounds for time evolutions directly from logarithmic Sobolev inequalities without relying on notions like lp-regularity. We also derive strong converse bounds for the classical capacity of a quantum time evolution and apply these to obtain bounds on the classical capacity of some examples, including stabilizer Hamiltonians under thermal noise., Comment: 35 pages, 4 figures. Version to be published in the Quantum Journal

We find a strong-converse bound on the private capacity of a quantum channel assisted by unlimited two-way classical communication. The bound is based on the max-relative entropy of entanglement and its proof uses a new inequality for the sandwiched R\'{e}nyi divergences based on complex interpolation techniques. We provide explicit examples of quantum channels where our bound improves both the transposition bound (on the quantum capacity assisted by classical communication) and the bound based on the squashed entanglement introduced by Takeoka et al.. As an application we study a repeater version of the private capacity assisted by classical communication and provide an example of a quantum channel with negligible private repeater capacity., Comment: 25 pages, 2 figures, added appendix

We prove that the quantum relative entropy decreases monotonically under the application of any positive trace-preserving linear map, for underlying separable Hilbert spaces. This answers in the affirmative a natural question that has been open for a long time, as monotonicity had previously only been shown to hold under additional assumptions, such as complete positivity or Schwarz-positivity of the adjoint map. The first step in our proof is to show monotonicity of the sandwiched Renyi divergences under positive trace-preserving maps, extending a proof of the data processing inequality by Beigi [J. Math. Phys. 54, 122202 (2013)] that is based on complex interpolation techniques. Our result calls into question several measures of non-Markovianity that have been proposed, as these would assess all positive trace-preserving time evolutions as Markovian., Comment: v3: published version; v2: 9 pages, extended results to infinite dimensions and lifted trace-preservation condition, added discussions and references; v1: 5 pages

We study the convergence of states under continuous-time depolarizing channels with full rank fixed points in terms of the relative entropy. The optimal exponent of an upper bound on the relative entropy in this case is given by the log-Sobolev-1 constant. Our main result is the computation of this constant. As an application we use the log-Sobolev-1 constant of the depolarizing channels to improve the concavity inequality of the von-Neumann entropy. This result is compared to similar bounds obtained recently by Kim et al. and we show a version of Pinsker's inequality, which is optimal and tight if we fix the second argument of the relative entropy. Finally, we consider the log-Sobolev-1 constant of tensor-powers of the completely depolarizing channel and use a quantum version of Shearer's inequality to prove a uniform lower bound., Comment: 21 pages, 3 figures

We study the entropy increase of quantum systems evolving under primitive, doubly stochastic Markovian noise and thus converging to the maximally mixed state. This entropy increase can be quantified by a logarithmic-Sobolev constant of the Liouvillian generating the noise. We prove a universal lower bound on this constant that stays invariant under taking tensor-powers. Our methods involve a new comparison method to relate logarithmic-Sobolev constants of different Liouvillians and a technique to compute logarithmic-Sobolev inequalities of Liouvillians with eigenvectors forming a projective representation of a finite abelian group. Our bounds improve upon similar results established before and as an application we prove an upper bound on continuous-time quantum capacities. In the last part of this work we study entropy production estimates of discrete-time doubly-stochastic quantum channels by extending the framework of discrete-time logarithmic-Sobolev inequalities to the quantum case., Comment: 24 pages

We investigate linear maps between matrix algebras that remain positive under tensor powers, i.e., under tensoring with $n$ copies of themselves. Completely positive and completely co-positive maps are trivial examples of this kind. We show that for every $n\in\mathbb{N}$ there exist non-trivial maps with this property and that for two-dimensional Hilbert spaces there is no non-trivial map for which this holds for all $n$. For higher dimensions we reduce the existence question of such non-trivial "tensor-stable positive maps" to a one-parameter family of maps and show that an affirmative answer would imply the existence of NPPT bound entanglement. As an application we show that any tensor-stable positive map that is not completely positive yields an upper bound on the quantum channel capacity, which for the transposition map gives the well-known cb-norm bound. We furthermore show that the latter is an upper bound even for the LOCC-assisted quantum capacity, and that moreover it is a strong converse rate for this task., Comment: 25 pages, no figures

We derive new estimates for distances between optimal matchings of eigenvalues of non-normal matrices in terms of the norm of their difference. We introduce and estimate a hyperbolic metric analogue of the classical spectral-variation distance. The result yields a qualitatively new and simple characterization of the localization of eigenvalues. Our bound improves on the best classical spectral-variation bounds due to Krause if the distance of matrices is sufficiently small and is sharp for asymptotically large matrices. Our approach is based on the theory of model operators, which provides us with strong resolvent estimates. The latter naturally lead to a Chebychev-type interpolation problem with finite Blaschke products, which can be solved explicitly and gives stronger bounds than the classical Chebychev interpolation with polynomials. As compared to the classical approach our method does not rely on Hadamard's inequality and immediately generalize to algebraic operators on Hilbert space., Comment: 19 pages, 4 pictures, Linear Algebra and its Applications, Volume 482, 1 October 2015

Quantum memories can be regarded as quantum channels that transmit information through time without moving it through space. Aiming at a reliable storage of information we may thus not only encode at the beginning and decode at the end, but also intervene during the transmission - a possibility not captured by the ordinary capacities in Quantum Shannon Theory. In this work we introduce capacities that take this possibility into account and study them in particular for the transmission of quantum information via dynamical semigroups of Lindblad form. When the evolution is subdivided and supplemented by additional continuous semigroups acting on arbitrary block sizes, we show that the capacity of the ideal channel can be obtained in all cases. If the supplementary evolution is reversible, however, this is no longer the case. Upper and lower bounds for this scenario are proven. Finally, we provide a continuous coding scheme and simple examples showing that adding a purely dissipative term to a Liouvillian can sometimes increase the quantum capacity., Comment: 28 pages plus 6 pages appendix, 6 figures

We analyze the recently developed folding algorithm [Phys. Rev. Lett. 102, 240603 (2009)] to simulate the dynamics of infinite quantum spin chains, and relate its performance to the kind of entanglement produced under the evolution of product states. We benchmark the accomplishments of this technique with respect to alternative strategies using Ising Hamiltonians with transverse and parallel fields, as well as XY models. Additionally, we evaluate its ability to find ground and thermal equilibrium states., Comment: 33 pages, 22 figures

Systems with long-range interactions show a variety of intriguing properties: they typically accommodate many meta-stable states, they can give rise to spontaneous formation of supersolids, and they can lead to counterintuitive thermodynamic behavior. However, the increased complexity that comes with long-range interactions strongly hinders theoretical studies. This makes a quantum simulator for long-range models highly desirable. Here, we show that a chain of trapped ions can be used to quantum simulate a one-dimensional model of hard-core bosons with dipolar off-site interaction and tunneling, equivalent to a dipolar XXZ spin-1/2 chain. We explore the rich phase diagram of this model in detail, employing perturbative mean-field theory, exact diagonalization, and quasiexact numerical techniques (density-matrix renormalization group and infinite time evolving block decimation). We find that the complete devil's staircase -- an infinite sequence of crystal states existing at vanishing tunneling -- spreads to a succession of lobes similar to the Mott-lobes found in Bose--Hubbard models. Investigating the melting of these crystal states at increased tunneling, we do not find (contrary to similar two-dimensional models) clear indications of supersolid behavior in the region around the melting transition. However, we find that inside the insulating lobes there are quasi-long range (algebraic) correlations, opposed to models with nearest-neighbor tunneling which show exponential decay of correlations.