Experimental Observation of Coherent-Information Superadditivity in a Dephrasure Channel

Total Page:16

File Type:pdf, Size:1020Kb

Experimental Observation of Coherent-Information Superadditivity in a Dephrasure Channel Experimental observation of coherent-information superadditivity in a dephrasure channel 1, 2 1, 2 3, 1, 2 1, 2 1, 2 1, 2 Shang Yu, Yu Meng, Raj B. Patel, ∗ Yi-Tao Wang, Zhi-Jin Ke, Wei Liu, Zhi-Peng Li, 1, 2 1, 2 1, 2, 1, 2, 1, 2 Yuan-Ze Yang, Wen-Hao Zhang, Jian-Shun Tang, † Chuan-Feng Li, ‡ and Guang-Can Guo 1CAS Key Laboratory of Quantum Information, University of Science and Technology of China, Hefei, 230026, China 2CAS Center For Excellence in Quantum Information and Quantum Physics, University of Science and Technology of China, Hefei, 230026, P.R. China 3Clarendon Laboratory, Department of Physics, Oxford University, Parks Road OX1 3PU Oxford, United Kingdom We present an experimental approach to construct a dephrasure channel, which contains both dephasing and erasure noises, and can be used as an efficient tool to study the superadditivity of coherent information. By using a three-fold dephrasure channel, the superadditivity of coherent information is observed, and a substantial gap is found between the zero single-letter coherent information and zero quantum capacity. Particularly, we find that when the coherent information of n channel uses is zero, in the case of larger number of channel uses, it will become positive. These phenomena exhibit a more obvious superadditivity of coherent information than previous works, and demonstrate a higher threshold for non-zero quantum capacity. Such novel channels built in our experiment also can provide a useful platform to study the non-additive properties of coherent information and quantum channel capacity. Introduction.—Channel capacity is at the heart of in- capacity [16, 17]. The first example of superadditivity formation theory and is used to quantify the ability of a is given by DiVincenzo et al. [7], and then has been practical communication channel to transmit the infor- extended by Smith et al. [18], in which they provide a mation from a sender to a receiver. Regarding the quan- heuristic for designing codes for general channels. Just tum channel ε, the notion of channel capacity has mul- recently, Cubitt et al. [15] find that for any number of tiple formulations in different settings: classical capacity channel uses, channels exist for which there is positive C(ε) [1, 2], which denotes the ability of the channel to capacity and zero coherent information. deliver classical information; entanglement-assisted clas- These additive-violated results indicate our limited un- sical capacity CE(ε) [3, 4], which shows the same ability derstanding of the superadditivity of coherent informa- when the sender and receiver share some entanglement tion, and the limitations in studying the quantum capac- resources; and private capacity P (ε) [5], which describes ity. These limitations come down to the fact that we do the maximum classical bit that can be transmitted while not have a useful tool to exhibit the superadditive phe- negligible information can be intercepted by third par- nomenon of coherent information, especially in an exper- ties. In quantum communication theory, the ability to imental testing. Therefore, to understand the coherent convey quantum information is denoted as the quantum information and, directly, the quantum capacity more ef- capacity Q(ε) [6–9], which is defined by the maximum ficiently and profoundly, a family of quantum channels of coherent information Ic. Many recent studies focused that can exhibit non-additivity is urgently needed. on exploring various properties of quantum capacity [10]: In this letter, we build a dephrasure channel [9] that for example, the lower bounds of quantum capacity in a can exert both the dephasing and the erasure evolution noisy quantum channel have been detected [8, 11], and on the input state. Assisted by this antidegradable chan- the upper bounds of quantum capacity are derived in nel, the superadditivity of coherent information has been thermal attenuator channels [12]. studied. By coding the information with different num- The amount of coherent information present in a quan- bers of photons and applying the corresponding number arXiv:2003.13000v2 [quant-ph] 15 Apr 2020 tum channel plays a central role in quantum communi- of channel uses, we find that a substantial gap of coher- cation. The quantum capacity of a channel [10] can be ent information exists between the n- and (n + 1)-letter computed using the methods of Lloyd, Shor and Deve- level. This evidence well demonstrates the superadditive tak [6, 13, 14], while coherent information itself can be property of the coherent information and also shows a considered analogous to the role of mutual information channel with zero coherent information can have positive in classical channels. In contrast to the mutual infor- capacity [15]. The results obtained in our study provide mation, which is additive in classical channels, coherent a deeper understanding of the nonadditivity of coherent information exhibits superadditivity. Consequently, the information, and supply a solid basis for inspiring many quantum capacity cannot be computed by a single op- new ideas on coherent information and quantum capac- timization like the classical one [15], which makes the ity. measurements of quantum capacity challenging. For this Coherent information, dephrasure channel, and exper- reason, the superadditive properties of coherent infor- imental setup.— The quantum capacity Q(ε), which de- mation becomes important in computing the quantum scribes the capability of the channel to convey quantum 2 (iii) Additional identical channel Coincidence (n + 1 ) ε = I ... ... channel Photon n+1 complementary (n ) ε p,q |0 |1 |1 |0 |e |e Photon n HWP@45° ... ... -fold ... ... ... ... n ... ... |0 |1 |1 |0 Photon 1 dephrasure channel |e HWP@45° |e (1 ) ε p,q (i) State preparation (ii) Dephrasure channel (iv) Tomography dephasing : box EOM ... BD HWP QWP PBS Mirror Lens Attenuator Fiber PP SPAD FIG. 1: Experimental setup consisting of four parts: (i) state preparation [the β-barium borate (BBO) crystals and the pump laser are not presented in the figure]; (ii) a three-fold dephrasure channel, which will induce a dephasing evolution between 0 and 1 bases in the gray dephasing box via the PPs-EOM sets, and cause an erasure evolution by adding a flag basis e via| i adjustment| i of an attenuator; (iii) additional identical channel platform, which receives the (n + 1)th photon and can prepare| i the repetition code remotely and, meanwhile, also acts as an additional path for building the complementary channel εc; (iv) detection devices. Keywords include: HWP, half-wave plate; QWP, quarter-wave plate; PBS, polarizing beam splitter; PP, phase plate; EOM, electro-optic modulator; BD, beam displacer; SPAD, single-photon avalanche diode. information, can be quantified by the maximum of co- where p and q (p, q [0, 0.5]) denote the dephasing and herent information. The quantity of coherent informa- erasure noise strength∈ in the channel, Π = n σˆ (ˆσ are · tion Ic, depends on the properties of the channel, and the Pauli operators), and e denotes the erasure flag ba- is also strongly related to the form of error-correcting sis which is orthogonal to| thei input space. This channel code used in the communication [7, 17]. Thus, the ad- can be efficiently realized with an optical setup by con- ditive property of Ic will also vary accordingly [9]. The trollable qutrit evolution, and the error-correcting codes quantum capacity of a noisy channel ε can be expressed can be prepared by a multiphoton entangled source. as [5, 6, 19] Fig. 1 presents our experimental setup, which can be recognized as four parts: (i) the state preparation plat- Q(ε) := lim Qn(ε), n (1) form, which contains a multiphoton-entangled source [25] →∞ (not presented in the figure); (ii) three-fold dephrasure 1 where Qn(ε) = n maxρ Ic(ρ, εn) , and Ic(ρ, εn) = channel; (iii) an additional identical channel, which acts c { } S(εn(ρ)) S[εn(ρ))] expresses the coherent information as a complementary channel as well as remote state of the channel− [20, 21]. Here, S( ) is the von Neumann preparation; and (iv) tomography device for the qutrit entropy, and εc denotes the complementary· channel of ε. state. In our experiment, we use spontaneous paramet- Clearly, to study the quantum capacity, the properties ric down conversion process to create a four-photon GHZ of coherent information are an important target to con- state as Φ+ = (1/√2)( HHHH + VVVV ) [25], which | i | i | i duct research and exploration, especially superadditivity. can be used to construct the repetition codes applied in However, studies of the superadditivity of coherent infor- the communication, and the corresponding purification mation are very limited [9], which causes difficulties in codes for coherent information measurements (the de- understanding quantum capacity. tails of the photon source can be found in Supplemental To address this challenge, we construct a dephrasure Material [26]). The dephrasure channel [εp,q( )] is con- · channel with a different number of uses (Fig. 1, mid- stituted by two types of sub-channels: dephasing and dle part). This channel contains both dephasing [22] erasure channels. In the dephasing channel, the input and erasure [23, 24] noises, and can be used to study qubit state, 1/√2( 0 + 1 )( 0 and 1 are the two or- | i | i | i | i the superadditivity of coherent information since its an- thogonal bases in the path degree of freedom), will suffer tidegradability. According to Ref. [9], this dephrasure a dephasing evolution. It is realized by a pair of BD, two channel can be expressed as: sets of waveplates [28, 29], and a dephasing box that con- tains a PPs-EOM set. This structure converts the path ε (ρ) = (1 q)[(1 p)ρ + pΠρΠ†] + qTr(ρ) e e , (2) into the polarization degree of freedom and can achieve p,q − − | ih | 3 (a) (b) ×10- 3 0.5 3 0.4 p = 0.00 ) (a) q = 0.30 q 0.8 , 2 p p 0.4 ( = 0.02 1 0.3 ∆ 0.6 ) p = 0.04 0 ε 0.3 λ 0.0933 0.1092 0.1290 0.1489 0.1687 ρ , ( 0.2 p = 0.06 p 0.4 c p I 0.2 3 0.03 ) (b) ) 0.2 q = 0.35 ε 0.1 q λ 0.02 , 2 ρ , 0.1 ( p c 0.01 ( I p=0.118 p=0.120 p=0.124 p=0.128 p=0.130 1 0.00 0.0 0.0 0.2 0.4 0.6 0.8 1.0 ∆ 0.0 λ 0.0 0 0.0 0.2 0.4 0.6 0.8 1.0 0.0 0.1 0.2 0.3 0.4 0.5 0.0666 0.0799 0.0965 0.1132 0.1298 λ q p 3 ) (c) q = 0.40 q , 2 FIG.
Recommended publications
  • Pilot Quantum Error Correction for Global
    Pilot Quantum Error Correction for Global- Scale Quantum Communications Laszlo Gyongyosi*1,2, Member, IEEE, Sandor Imre1, Member, IEEE 1Quantum Technologies Laboratory, Department of Telecommunications Budapest University of Technology and Economics 2 Magyar tudosok krt, H-1111, Budapest, Hungary 2Information Systems Research Group, Mathematics and Natural Sciences Hungarian Academy of Sciences H-1518, Budapest, Hungary *[email protected] Real global-scale quantum communications and quantum key distribution systems cannot be implemented by the current fiber and free-space links. These links have high attenuation, low polarization-preserving capability or extreme sensitivity to the environment. A potential solution to the problem is the space-earth quantum channels. These channels have no absorption since the signal states are propagated in empty space, however a small fraction of these channels is in the atmosphere, which causes slight depolarizing effect. Furthermore, the relative motion of the ground station and the satellite causes a rotation in the polarization of the quantum states. In the current approaches to compensate for these types of polarization errors, high computational costs and extra physical apparatuses are required. Here we introduce a novel approach which breaks with the traditional views of currently developed quantum-error correction schemes. The proposed solution can be applied to fix the polarization errors which are critical in space-earth quantum communication systems. The channel coding scheme provides capacity-achieving communication over slightly depolarizing space-earth channels. I. Introduction Quantum error-correction schemes use different techniques to correct the various possible errors which occur in a quantum channel. In the first decade of the 21st century, many revolutionary properties of quantum channels were discovered [12-16], [19-22] however the efficient error- correction in quantum systems is still a challenge.
    [Show full text]
  • Analysis of Quantum Error-Correcting Codes: Symplectic Lattice Codes and Toric Codes
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Caltech Theses and Dissertations Analysis of quantum error-correcting codes: symplectic lattice codes and toric codes Thesis by James William Harrington Advisor John Preskill In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute of Technology Pasadena, California 2004 (Defended May 17, 2004) ii c 2004 James William Harrington All rights Reserved iii Acknowledgements I can do all things through Christ, who strengthens me. Phillipians 4:13 (NKJV) I wish to acknowledge first of all my parents, brothers, and grandmother for all of their love, prayers, and support. Thanks to my advisor, John Preskill, for his generous support of my graduate studies, for introducing me to the studies of quantum error correction, and for encouraging me to pursue challenging questions in this fascinating field. Over the years I have benefited greatly from stimulating discussions on the subject of quantum information with Anura Abeyesinge, Charlene Ahn, Dave Ba- con, Dave Beckman, Charlie Bennett, Sergey Bravyi, Carl Caves, Isaac Chenchiah, Keng-Hwee Chiam, Richard Cleve, John Cortese, Sumit Daftuar, Ivan Deutsch, Andrew Doherty, Jon Dowling, Bryan Eastin, Steven van Enk, Chris Fuchs, Sho- hini Ghose, Daniel Gottesman, Ted Harder, Patrick Hayden, Richard Hughes, Deborah Jackson, Alexei Kitaev, Greg Kuperberg, Andrew Landahl, Chris Lee, Debbie Leung, Carlos Mochon, Michael Nielsen, Smith Nielsen, Harold Ollivier, Tobias Osborne, Michael Postol, Philippe Pouliot, Marco Pravia, John Preskill, Eric Rains, Robert Raussendorf, Joe Renes, Deborah Santamore, Yaoyun Shi, Pe- ter Shor, Marcus Silva, Graeme Smith, Jennifer Sokol, Federico Spedalieri, Rene Stock, Francis Su, Jacob Taylor, Ben Toner, Guifre Vidal, and Mas Yamada.
    [Show full text]
  • Some Open Problems in Quantum Information Theory
    Some Open Problems in Quantum Information Theory Mary Beth Ruskai∗ Department of Mathematics, Tufts University, Medford, MA 02155 [email protected] June 14, 2007 Abstract Some open questions in quantum information theory (QIT) are described. Most of them were presented in Banff during the BIRS workshop on Operator Structures in QIT 11-16 February 2007. 1 Extreme points of CPT maps In QIT, a channel is represented by a completely-positive trace-preserving (CPT) map Φ: Md1 7→ Md2 , which is often written in the Choi-Kraus form X † X † Φ(ρ) = AkρAk with AkAk = Id1 . (1) k k The state representative or Choi matrix of Φ is 1 X Φ(|βihβ|) = d |ejihek|Φ(|ejihek|) (2) jk where |βi is a maximally entangled Bell state. Choi [3] showed that the Ak can be obtained from the eigenvectors of Φ(|βihβ|) with non-zero eigenvalues. The operators Ak in (1) are known to be defined only up to a partial isometry and are often called Kraus operators. When a minimal set is obtained from Choi’s prescription using eigenvectors of (2), they are defined up to mixing of those from degenerate eigenvalues ∗Partially supported by the National Science Foundation under Grant DMS-0604900 1 and we will refer to them as Choi-Kraus operators. Choi showed that Φ is an extreme † point of the set of CPT maps Φ : Md1 7→ Md2 if and only if the set {AjAk} is linearly independent in Md1 . This implies that the Choi matrix of an extreme CPT map has rank at most d1.
    [Show full text]
  • Lecture 6: Quantum Error Correction and Quantum Capacity
    Lecture 6: Quantum error correction and quantum capacity Mark M. Wilde∗ The quantum capacity theorem is one of the most important theorems in quantum Shannon theory. It is a fundamentally \quantum" theorem in that it demonstrates that a fundamentally quantum information quantity, the coherent information, is an achievable rate for quantum com- munication over a quantum channel. The fact that the coherent information does not have a strong analog in classical Shannon theory truly separates the quantum and classical theories of information. The no-cloning theorem provides the intuition behind quantum error correction. The goal of any quantum communication protocol is for Alice to establish quantum correlations with the receiver Bob. We know well now that every quantum channel has an isometric extension, so that we can think of another receiver, the environment Eve, who is at a second output port of a larger unitary evolution. Were Eve able to learn anything about the quantum information that Alice is attempting to transmit to Bob, then Bob could not be retrieving this information|otherwise, they would violate the no-cloning theorem. Thus, Alice should figure out some subspace of the channel input where she can place her quantum information such that only Bob has access to it, while Eve does not. That the dimensionality of this subspace is exponential in the coherent information is perhaps then unsurprising in light of the above no-cloning reasoning. The coherent information is an entropy difference H(B) − H(E)|a measure of the amount of quantum correlations that Alice can establish with Bob less the amount that Eve can gain.
    [Show full text]
  • Capacity Estimates Via Comparison with TRO Channels
    Commun. Math. Phys. 364, 83–121 (2018) Communications in Digital Object Identifier (DOI) https://doi.org/10.1007/s00220-018-3249-y Mathematical Physics Capacity Estimates via Comparison with TRO Channels Li Gao1 , Marius Junge1, Nicholas LaRacuente2 1 Department of Mathematics, University of Illinois, Urbana, IL 61801, USA. E-mail: [email protected]; [email protected] 2 Department of Physics, University of Illinois, Urbana, IL 61801, USA. E-mail: [email protected] Received: 1 November 2017 / Accepted: 27 July 2018 Published online: 8 September 2018 – © Springer-Verlag GmbH Germany, part of Springer Nature 2018 Abstract: A ternary ring of operators (TRO) in finite dimensions is an operator space as an orthogonal sum of rectangular matrices. TROs correspond to quantum channels that are diagonal sums of partial traces, we call TRO channels. TRO channels have simple, single-letter entropy expressions for quantum, private, and classical capacity. Using operator space and interpolation techniques, we perturbatively estimate capacities, capacity regions, and strong converse rates for a wider class of quantum channels by comparison to TRO channels. 1. Introduction Channel capacity, introduced by Shannon in his foundational paper [45], is the ultimate rate at which information can be reliably transmitted over a communication channel. During the last decades, Shannon’s theory on noisy channels has been adapted to the framework of quantum physics. A quantum channel has various capacities depending on different communication tasks, such as quantum capacity for transmitting qubits, and private capacity for transmitting classical bits with physically ensured security. The coding theorems, which characterize these capacities by entropic expressions, were major successes in quantum information theory (see e.g.
    [Show full text]
  • QIP 2010 Tutorial and Scientific Programmes
    QIP 2010 15th – 22nd January, Zürich, Switzerland Tutorial and Scientific Programmes asymptotically large number of channel uses. Such “regularized” formulas tell us Friday, 15th January very little. The purpose of this talk is to give an overview of what we know about 10:00 – 17:10 Jiannis Pachos (Univ. Leeds) this need for regularization, when and why it happens, and what it means. I will Why should anyone care about computing with anyons? focus on the quantum capacity of a quantum channel, which is the case we understand best. This is a short course in topological quantum computation. The topics to be covered include: 1. Introduction to anyons and topological models. 15:00 – 16:55 Daniel Nagaj (Slovak Academy of Sciences) 2. Quantum Double Models. These are stabilizer codes, that can be described Local Hamiltonians in quantum computation very much like quantum error correcting codes. They include the toric code This talk is about two Hamiltonian Complexity questions. First, how hard is it to and various extensions. compute the ground state properties of quantum systems with local Hamiltonians? 3. The Jones polynomials, their relation to anyons and their approximation by Second, which spin systems with time-independent (and perhaps, translationally- quantum algorithms. invariant) local interactions could be used for universal computation? 4. Overview of current state of topological quantum computation and open Aiming at a participant without previous understanding of complexity theory, we will discuss two locally-constrained quantum problems: k-local Hamiltonian and questions. quantum k-SAT. Learning the techniques of Kitaev and others along the way, our first goal is the understanding of QMA-completeness of these problems.
    [Show full text]
  • Reliably Distinguishing States in Qutrit Channels Using One-Way LOCC
    Reliably distinguishing states in qutrit channels using one-way LOCC Christopher King Department of Mathematics, Northeastern University, Boston MA 02115 Daniel Matysiak College of Computer and Information Science, Northeastern University, Boston MA 02115 July 15, 2018 Abstract We present numerical evidence showing that any three-dimensional subspace of C3 ⊗ Cn has an orthonormal basis which can be reliably dis- tinguished using one-way LOCC, where a measurement is made first on the 3-dimensional part and the result used to select an optimal measure- ment on the n-dimensional part. This conjecture has implications for the LOCC-assisted capacity of certain quantum channels, where coordinated measurements are made on the system and environment. By measuring first in the environment, the conjecture would imply that the environment- arXiv:quant-ph/0510004v1 1 Oct 2005 assisted classical capacity of any rank three channel is at least log 3. Sim- ilarly by measuring first on the system side, the conjecture would imply that the environment-assisting classical capacity of any qutrit channel is log 3. We also show that one-way LOCC is not symmetric, by providing an example of a qutrit channel whose environment-assisted classical capacity is less than log 3. 1 1 Introduction and statement of results The noise in a quantum channel arises from its interaction with the environment. This viewpoint is expressed concisely in the Lindblad-Stinespring representation [6, 8]: Φ(|ψihψ|)= Tr U(|ψihψ|⊗|ǫihǫ|)U ∗ (1) E Here E is the state space of the environment, which is assumed to be initially prepared in a pure state |ǫi.
    [Show full text]
  • Potential Capacities of Quantum Channels 2
    WINTER AND YANG: POTENTIAL CAPACITIES OF QUANTUM CHANNELS 1 Potential Capacities of Quantum Channels Andreas Winter and Dong Yang Abstract—We introduce potential capacities of quantum chan- Entangled inputs between different quantum channels open the nels in an operational way and provide upper bounds for these door to all kinds of effects that are impossible in classical quantities, which quantify the ultimate limit of usefulness of a information theory. An extreme phenomenon is superactivation channel for a given task in the best possible context. Unfortunately, except for a few isolated cases, potential capac- [13]; there exist two quantum channels that cannot transmit ities seem to be as hard to compute as their “plain” analogues. quantum information when they are used individually, but can We thus study upper bounds on some potential capacities: For transmit at positive rate when they are used together. the classical capacity, we give an upper bound in terms of the The phenomenon of superactivation, and more broadly of entanglement of formation. To establish a bound for the quantum super-additivity, implies that the capacity of a quantum channel and private capacity, we first “lift” the channel to a Hadamard channel and then prove that the quantum and private capacity does not adequately characterize the channel, since the utility of a Hadamard channel is strongly additive, implying that for of the channel depends on what other contextual channels are these channels, potential and plain capacity are equal. Employing available. So it is natural to ask the following question: What these upper bounds we show that if a channel is noisy, however is the maximum possible capability of a channel to transmit close it is to the noiseless channel, then it cannot be activated information when it is used in combination with any other into the noiseless channel by any other contextual channel; this conclusion holds for all the three capacities.
    [Show full text]
  • EU–US Collaboration on Quantum Technologies Emerging Opportunities for Research and Standards-Setting
    Research EU–US collaboration Paper on quantum technologies International Security Programme Emerging opportunities for January 2021 research and standards-setting Martin Everett Chatham House, the Royal Institute of International Affairs, is a world-leading policy institute based in London. Our mission is to help governments and societies build a sustainably secure, prosperous and just world. EU–US collaboration on quantum technologies Emerging opportunities for research and standards-setting Summary — While claims of ‘quantum supremacy’ – where a quantum computer outperforms a classical computer by orders of magnitude – continue to be contested, the security implications of such an achievement have adversely impacted the potential for future partnerships in the field. — Quantum communications infrastructure continues to develop, though technological obstacles remain. The EU has linked development of quantum capacity and capability to its recovery following the COVID-19 pandemic and is expected to make rapid progress through its Quantum Communication Initiative. — Existing dialogue between the EU and US highlights opportunities for collaboration on quantum technologies in the areas of basic scientific research and on communications standards. While the EU Quantum Flagship has already had limited engagement with the US on quantum technology collaboration, greater direct cooperation between EUPOPUSA and the Flagship would improve the prospects of both parties in this field. — Additional support for EU-based researchers and start-ups should be provided where possible – for example, increasing funding for representatives from Europe to attend US-based conferences, while greater investment in EU-based quantum enterprises could mitigate potential ‘brain drain’. — Superconducting qubits remain the most likely basis for a quantum computer. Quantum computers composed of around 50 qubits, as well as a quantum cloud computing service using greater numbers of superconducting qubits, are anticipated to emerge in 2021.
    [Show full text]
  • The Quantum Capacity with Symmetric Side Channels Graeme Smith, John A
    1 The quantum capacity with symmetric side channels Graeme Smith, John A. Smolin and Andreas Winter Abstract— We present an upper bound for the quantum chan- environment-assisted quantum capacity [11], [12]. The multi- nel capacity that is both additive and convex. Our bound can be letter formulas available for the other capacities, including the interpreted as the capacity of a channel for high-fidelity quantum quantum capacity, provide, at best, partial characterizations. communication when assisted by a family of channels that have no capacity on their own. This family of assistance channels, For instance, it was shown in [13], [3], [4], [5] that the which we call symmetric side channels, consists of all channels capacity for noiseless quantum communication of a quantum mapping symmetrically to their output and environment. The channel N is given by bound seems to be quite tight, and for degradable quantum chan- nels it coincides with the unassisted channel capacity. Using this 1 ⊗n Q(N ) = lim max I(AiB )! : (1) n!1 AB⊗n symmetric side channel capacity, we find new upper bounds on n jφiA(A0)⊗n the capacity of the depolarizing channel. We also briefly indicate an analogous notion for distilling entanglement using the same In this expression, N is a quantum channel mapping quantum class of (one-way) channels, yielding one of the few entanglement states on the vector space A0 to states on the space B, measures that is monotonic under local operations with one- 0 and jφi 0 ⊗n is a pure quantum state on n copies of A way classical communication (1-LOCC), but not under the more A(A ) general class of local operations with classical communication together with a reference system A.
    [Show full text]
  • Simulation of BB84 Quantum Key Distribution in Depolarizing Channel
    Proceedings of 14th Youth Conference on Communication Simulation of BB84 Quantum Key Distribution in depolarizing channel Hui Qiao, Xiao-yu Chen* College of Information and Electronic Engineering, Zhejiang Gongshang University, Hangzhou, 310018, China [email protected] Abstract: In this paper, we employ the standard BB84 protocol as the basic model of quantum key distribution (QKD) in depolarizing channel. We also give the methods to express the preparation and measurement of quantum states on classical computer and realize the simulation of quantum key distribution. The simulation results are consistent with the theoretical results. It was shown that the simulation of QKD with Matlab is feasible. It provides a new method to demonstrate the QKD protocol. QKD; simulation; depolarizing channel; data reconciliation; privacy amplification Keywords: [4] 1. Introduction 1989 . In 1993, Muller, Breguet, and Gisin demonstrated the feasibility of polarization-coding The purpose of quantum key distribution (QKD) [5] fiber-based QKD over 1.1km telecom fiber and and classical key distribution is consistent, their Townsend, Rarity, and Tapster demonstrated the difference are the realization methods. The classical key feasibility of phase-coding fiber-based QKD over 10km distribution is based on the mathematical theory of telecom fiber[6]. Up to now, the security transmission computational complexity, whereas the QKD based on [7] distance of QKD has been achieved over 120km . the fundamental principle of quantum mechanics. The At present, the study of QKD is limited to first QKD protocol is BB84 protocol, which was theoretical and experimental. The unconditionally secure proposed by Bennett and Brassard in 1984 [1].The protocol in theory needs further experimental verification.
    [Show full text]
  • On the Complementary Quantum Capacity of the Depolarizing Channel
    On the complementary quantum capacity of the depolarizing channel Debbie Leung1 and John Watrous2 1Institute for Quantum Computing and Department of Combinatorics and Optimization, University of Waterloo 2Institute for Quantum Computing and School of Computer Science, University of Waterloo October 2, 2018 The qubit depolarizing channel with noise parameter η transmits an input qubit perfectly with probability 1 − η, and outputs the completely mixed state with probability η. We show that its complementary channel has positive quantum capacity for all η > 0. Thus, we find that there exists a single parameter family of channels having the peculiar property of having positive quantum capacity even when the outputs of these channels approach a fixed state independent of the input. Comparisons with other related channels, and implications on the difficulty of studying the quantum capacity of the depolarizing channel are discussed. 1 Introduction It is a fundamental problem in quantum information theory to determine the capacity of quantum channels to transmit quantum information. The quantum capacity of a channel is the optimal rate at which one can transmit quantum data with high fidelity through that channel when an asymptotically large number of channel uses is made available. In the classical setting, the capacity of a classical channel to transmit classical data is given by Shannon’s noisy coding theorem [12]. Although the error correcting codes that allow one to approach the capacity of a channel may involve increasingly large block lengths, the capacity expression itself is a simple, single letter formula involving an optimization over input distributions maximizing the input/output mutual information over one use of the channel.
    [Show full text]