![DSpace logo](/jspui/image/logo.gif)
Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/xmlui/handle/123456789/9601
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Bitragunta, Sainath | - |
dc.date.accessioned | 2023-03-09T09:06:03Z | - |
dc.date.available | 2023-03-09T09:06:03Z | - |
dc.date.issued | 2021 | - |
dc.identifier.uri | https://ieeexplore.ieee.org/document/9622362 | - |
dc.identifier.uri | http://dspace.bits-pilani.ac.in:8080/xmlui/handle/123456789/9601 | - |
dc.description.abstract | Superdense coding is a fundamental protocol in quantum communication, which enables us to send two bits of information by the transmission of just a single qubit. In this paper, we consider superdense coding through a noisy quantum depolarizing channel. Following a simple calculation, we derive superdense coding capacity as a function of depolarizing probability. We extend this derivation to the scenario of repeaterless series-cascaded depolarizing channels and provide an elementary approach to evaluate the maximal intervals in which repeaters shall need to be placed in such a cascaded system. Finally, we validate the theoretical results via a Monte Carlo simulation, simultaneously providing a generalized framework. We believe that our numerical results serve as a useful benchmark and give a base to extend such simulations to other quantum channels. | en_US |
dc.language.iso | en | en_US |
dc.publisher | IEEE | en_US |
dc.subject | EEE | en_US |
dc.subject | Quantum communication | en_US |
dc.subject | Quantum information | en_US |
dc.subject | Superdense Coding | en_US |
dc.subject | Quantum Repeater | en_US |
dc.subject | Depolarizing Channel | en_US |
dc.title | Superdense Coding Through Repeaterless Hybrid Network of Depolarizing Quantum Communication Channels | en_US |
dc.type | Article | en_US |
Appears in Collections: | Department of Electrical and Electronics Engineering |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.