Performance of Dense Coding and Teleportation for Random States --Augmentation via Pre-processing

• URL: http://arxiv.org/abs/2012.05865v2
• Date: Thu, 18 Mar 2021 20:50:06 GMT
• Title: Performance of Dense Coding and Teleportation for Random States --Augmentation via Pre-processing
• Authors: Rivu Gupta, Shashank Gupta, Shiladitya Mal, Aditi Sen De
• Abstract summary: We study the dense coding capacity (DCC) and teleportation fidelity (TF) of Haar uniformly generated random multipartite states of various ranks. We observe that the performance of random states for dense coding as well as teleportation decreases with the increase of the rank of states.
• Score: 0.8010615606748019
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In order to understand the resourcefulness of a natural quantum system in quantum communication tasks, we study the dense coding capacity (DCC) and teleportation fidelity (TF) of Haar uniformly generated random multipartite states of various ranks. We prove that when a rank-2 two-qubit state, a Werner state, and a pure state possess the same amount of entanglement, the DCC of a rank-2 state belongs to the envelope made by pure and Werner states. In a similar way, we obtain an upper bound via the generalized Greenberger-Horne-Zeilinger state for rank-2 three-qubit states when the dense coding with two senders and a single receiver is performed and entanglement is measured in the senders:receiver bipartition. The normalized frequency distribution of DCC for randomly generated two-, three- and four-qubit density matrices with global as well as local decodings at the receiver's end are reported. The estimation of mean DCC for two-qubit states is found to be in good agreement with the numerical simulations. Universally, we observe that the performance of random states for dense coding as well as teleportation decreases with the increase of the rank of states which we have shown to be surmounted by the local pre-processing operations performed on the shared states before starting the protocols, irrespective of the rank of the states. The local pre-processing employed here is based on positive operator valued measurements along with classical communication and we show that unlike dense coding with two-qubit random states, senders' operations are always helpful to probabilistically enhance the capabilities of implementing dense coding as well as teleportation.

Related papers

• Continuous variable dense coding under realistic non-ideal scenarios [0.0]
  We derive a general formalism for the dense coding capacity (DCC) of generic two-mode Gaussian states. We investigate the pattern of DCC of the two-mode squeezed vacuum state (TMSV) by varying the strength of the noise.
  arXiv  Detail & Related papers  (2024-07-10T12:49:17Z)
• Enhancing Quantum State Discrimination with Indefinite Causal Order [3.368751927358015]
  We study a noisy discrimination scenario using a protocol based on indefinite causal order. We find that, for certain channels and ensembles, the guessing probability can be significantly improved.
  arXiv  Detail & Related papers  (2024-06-27T17:51:46Z)
• Zero-entropy encoders and simultaneous decoders in identification via quantum channels [49.126395046088014]
  We show that all four combinations (pure/mixed encoder, simultaneous/general decoder) have a double-exponentially growing code size. We show that the simultaneous identification capacity of a quantum channel equals the simultaneous identification capacity with pure state encodings.
  arXiv  Detail & Related papers  (2024-02-14T11:59:23Z)
• On convertibility among bipartite 2x2 entangled states [0.8702432681310401]
  It is impossible to convert to an entangled state with lower rank under separable operations. It is conjectured that MEMS may lie on the bottom of entangled state ordering for given entanglement of formation.
  arXiv  Detail & Related papers  (2024-02-13T01:53:48Z)
• Gaussian conversion protocol for heralded generation of qunaught states [66.81715281131143]
  bosonic codes map qubit-type quantum information onto the larger bosonic Hilbert space. We convert between two instances of these codes GKP qunaught states and four-foldsymmetric binomial states corresponding to a zero-logical encoded qubit. We obtain GKP qunaught states with a fidelity of over 98% and a probability of approximately 3.14%.
  arXiv  Detail & Related papers  (2023-01-24T14:17:07Z)
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders [67.12391801199688]
  We investigate dense coding by imposing various locality restrictions to our decoder. In this task, the sender Alice and the receiver Bob share an entangled state.
  arXiv  Detail & Related papers  (2021-09-26T07:29:54Z)
• Quantum Discrimination of Two Noisy Displaced Number States [68.2727599930504]
  We first consider the quantum discrimination of two noiseless displaced number states. We then address the problem of discriminating between two noisy displaced number states.
  arXiv  Detail & Related papers  (2020-12-09T16:56:16Z)
• Entanglement purification by counting and locating errors with entangling measurements [62.997667081978825]
  We consider entanglement purification protocols for multiple copies of qubit states. We use high-dimensional auxiliary entangled systems to learn about number and positions of errors in the noisy ensemble.
  arXiv  Detail & Related papers  (2020-11-13T19:02:33Z)
• Gaussian conversion protocols for cubic phase state generation [104.23865519192793]
  Universal quantum computing with continuous variables requires non-Gaussian resources. The cubic phase state is a non-Gaussian state whose experimental implementation has so far remained elusive. We introduce two protocols that allow for the conversion of a non-Gaussian state to a cubic phase state.
  arXiv  Detail & Related papers  (2020-07-07T09:19:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.