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 appendi

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.

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.

We analyze the recently developed folding algorithm (Bañuls et al 2009 Phys. Rev. Lett. 102 240603) for simulating the dynamics of infinite quantum spin chains and we 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 X Y models. Also, we evaluate its capability of finding ground and thermal equilibrium states.

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 figure