Entanglement Cost of Quantum Channels

The entanglement cost of a quantum channel is the minimal rate at which entanglement (between sender and receiver) is needed in order to simulate many copies of a quantum channel in the presence of free classical communication. In this paper we show how to express this quantity as a regularised optimisation of the entanglement formation over states that can be generated between sender and receiver. Our formula is the channel analog of a well-known formula for the entanglement cost of quantum states in terms of the entanglement of formation; and shares a similar relation to the recently shattered hope for additivity. The entanglement cost of a quantum channel can be seen as the analog of the quantum reverse Shannon theorem in the case where free classical communication is allowed. The techniques used in the proof of our result are then also inspired by a recent proof of the quantum reverse Shannon theorem and feature the one-shot formalism for quantum information theory, the post-selection technique for quantum channels as well as Sion's minimax theorem. We discuss two applications of our result. First, we are able to link the security in the noisy-storage model to a problem of sending quantum rather than classical information through the adversary's storage device. This not only improves the range of parameters where security can be shown, but also allows us to prove security for storage devices for which no results were known before. Second, our result has consequences for the study of the strong converse quantum capacity. Here, we show that any coding scheme that sends quantum information through a quantum channel at a rate larger than the entanglement cost of the channel has an exponentially small fidelity.Comment: v3: error in proof of Lemma 13 corrected, corrected Figure 5, 24 pages, 5 figure

Efficient tomography of a quantum many-body system

Quantum state tomography (QST) is the gold standard technique for obtaining an estimate for the state of small quantum systems in the laboratory [1]. Its application to systems with more than a few constituents (e.g. particles) soon becomes impractical as the e ff ort required grows exponentially with the number of constituents. Developing more e ffi cient techniques is particularly pressing as precisely-controllable quantum systems that are well beyond the reach of QST are emerging in laboratories. Motivated by this, there is a considerable ongoing e ff ort to develop new state characterisation tools for quantum many-body systems [2–11]. Here we demonstrate Matrix Product State (MPS) tomography [2], which is theoretically proven to allow the states of a broad class of quantum systems to be accurately estimated with an e ff ort that increases e ffi ciently with constituent number. We use the technique to reconstruct the dynamical state of a trapped-ion quantum simulator comprising up to 14 entangled and individually-controlled spins (qubits): a size far beyond the practical limits of QST. Our results reveal the dynamical growth of entanglement and description complexity as correlations spread out during a quench: a necessary condition for future beyond-classical performance. MPS tomography should therefore find widespread use to study large quantum many-body systems and to benchmark and verify quantum simulators and computers

Unbounded number of channel uses may be required to detect quantum capacity

This is the author accepted manuscript. The final version is available from NPG at http://www.nature.com/ncomms/2015/150331/ncomms7739/full/ncomms7739.html.Transmitting data reliably over noisy communication channels is one of the most important applications of information theory, and is well understood for channels modelled by classical physics. However, when quantum effects are involved, we do not know how to compute channel capacities. This is because the formula for the quantum capacity involves maximizing the coherent information over an unbounded number of channel uses. In fact, entanglement across channel uses can even increase the coherent information from zero to non-zero. Here we study the number of channel uses necessary to detect positive coherent information. In all previous known examples, two channel uses already sufficed. It might be that only a finite number of channel uses is always sufficient. We show that this is not the case: for any number of uses, there are channels for which the coherent information is zero, but which nonetheless have capacity.DE and DP acknowledge nancial support from the\ud European CHIST-ERA project CQC (funded partially\ud by MINECO grant PRI-PIMCHI-2011-1071) and from\ud Comunidad de Madrid (grant QUITEMAD+-CM, ref.\ud S2013/ICE-2801). TSC is supported by the Royal Society.\ud MO acknowledges nancial support from European\ud Union under project QALGO (Grant Agreement\ud No. 600700). SS acknowledges the support of Sidney\ud Sussex College.\ud This work was made possible through the support of\ud grant #48322 from the John Templeton Foundation. The\ud opinions expressed in this publication are those of the\ud authors and do not necessarily re\ud ect the views of the\ud John Templeton Foundation