Sequential Reattempt of Telecloning

• URL: http://arxiv.org/abs/2206.12702v2
• Date: Sun, 23 Apr 2023 15:22:59 GMT
• Title: Sequential Reattempt of Telecloning
• Authors: Sudipta Das, Pritam Halder, Ratul Banerjee, Aditi Sen De
• Abstract summary: We show that the shared state can be recycled for further telecloning protocol. Although the original telecloning with quantum advantage is possible for arbitrary numbers of receivers, we report that the recycling of resources is not possible in telecloning.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The task of a telecloning protocol is to send an arbitrary qubit possessed by a sender to multiple receivers. Instead of performing Bell measurement at the sender's node, if one applies unsharp measurement, we show that the shared state can be recycled for further telecloning protocol. Specifically, in case of a single sender and two receivers, the maximal attempting number, which is defined as the maximum number of rounds used by the channel to obtain quantum advantage in the fidelity, turns out to be three both for optimal and nonoptimal shared states for telecloning while the maximal number reduces to two in case of three receivers. Although the original telecloning with quantum advantage being possible for arbitrary numbers of receivers, we report that the recycling of resources is not possible in telecloning involving a single sender and more than three receivers, thereby demonstrating a no-go theorem. We also connect the maximal achievable fidelities in each round with the bipartite entanglement content of the reduced state between the sender and one of the receivers as well as with the monogamy score of entanglement.

Related papers

• Robust certification of quantum instruments through a sequential communication game [0.0]
  We find a prominent quantum advantage in the receiver's decoding of the message originally encoded by the sender.<n>We show that an optimal trade-off between the success probabilities of the two receivers enables self-testing of the sender's state preparation.
  arXiv  Detail & Related papers  (2025-06-15T19:17:02Z)
• Quantum Relay Channels [18.93141709546733]
  Communication over a fully quantum relay channel is considered. We establish three bounds based on different coding strategies, i.e., partial decode-forward, measure-forward, and assist-forward.
  arXiv  Detail & Related papers  (2024-11-25T10:27:28Z)
• Three-Receiver Quantum Broadcast Channels: Classical Communication with Quantum Non-unique Decoding [44.37825061268399]
  In network communication, there is a hierarchy among receivers based on information they decode due. This hierarchy may result in varied information quality, such as higher-quality video for certain receivers. We explore three-receiver quantum broadcast channels with two- and three-degraded message sets.
  arXiv  Detail & Related papers  (2024-06-14T09:07:53Z)
• Algorithmic Persuasion Through Simulation [51.23082754429737]
  We study a Bayesian persuasion game where a sender wants to persuade a receiver to take a binary action, such as purchasing a product. The sender is informed about the (binary) state of the world, such as whether the quality of the product is high or low, but only has limited information about the receiver's beliefs and utilities. Motivated by customer surveys, user studies, and recent advances in AI, we allow the sender to learn more about the receiver by querying an oracle that simulates the receiver's behavior.
  arXiv  Detail & Related papers  (2023-11-29T23:01:33Z)
• The Multiple-Access Channel with Entangled Transmitters [67.92544792239086]
  Communication over a classical multiple-access channel (MAC) with entanglement resources is considered. We establish inner and outer bounds on the capacity region for the general MAC with entangled transmitters. Using superdense coding, entanglement can double the conferencing rate.
  arXiv  Detail & Related papers  (2023-03-18T16:51:08Z)
• Broadcasting single-qubit and multi-qubit-entangled states: authentication, cryptography, and distributed quantum computation [0.0]
  We first focus on the broadcasting of product quantum states in a network. We generalize the basic protocol to include an arbitrary basis rotation and allow for multiple receivers and senders. Applications of broadcasting product states include authentication and three-state quantum cryptography.
  arXiv  Detail & Related papers  (2023-03-01T23:00:50Z)
• Broadcast of a restricted set of qubit and qutrit states [0.0]
  A qubit confined to the equator of the Bloch sphere can be sent to an arbitrary number of receivers. The entanglement cost is less than that of using teleportation to accomplish the same task. We present a number of variations on this task, probabilistically sending an unknown qubit state to two receivers, sending different qubit states to two receivers, and sending qutrit states to two receivers.
  arXiv  Detail & Related papers  (2022-04-21T17:17:40Z)
• 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)
• Computation-aided classical-quantum multiple access to boost network communication speeds [61.12008553173672]
  We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC. We show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design.
  arXiv  Detail & Related papers  (2021-05-30T11:19:47Z)
• Quantum Broadcast Channels with Cooperating Decoders: An Information-Theoretic Perspective on Quantum Repeaters [78.7611537027573]
  Communication over a quantum broadcast channel with cooperation between the receivers is considered. We develop lower and upper bounds on the capacity region in each setting.
  arXiv  Detail & Related papers  (2020-11-18T11:58:48Z)

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.