Minimal Port-based Teleportation

• URL: http://arxiv.org/abs/2111.05499v2
• Date: Mon, 17 Jul 2023 14:55:00 GMT
• Title: Minimal Port-based Teleportation
• Authors: Sergii Strelchuk, Micha{\l} Studzi\'nski
• Abstract summary: We introduce the minimal set of requirements that define a feasible port-based teleportation (PBT) protocol. We construct a simple PBT protocol that satisfies these requirements. We define the corresponding efficient superdense coding protocols which transmit more classical bits with fewer maximally entangled states.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: There are two types of port-based teleportation (PBT) protocols: deterministic -- when the state always arrives to the receiver but is imperfectly transmitted and probabilistic -- when the state reaches the receiver intact with high probability. We introduce the minimal set of requirements that define a feasible PBT protocol and construct a simple PBT protocol that satisfies these requirements: it teleports an unknown state of a qubit with success probability $p_{succ}=1-\frac{N+2}{2^{N+1}}$ and fidelity $1-O(\frac{1}{N})$ with the resource state consisting of $N$ maximally entangled states. This protocol is not reducible from either the deterministic or probabilistic PBT protocol. We define the corresponding efficient superdense coding protocols which transmit more classical bits with fewer maximally entangled states. Furthermore, we introduce rigorous methods for comparing and converting between different PBT protocols.

Related papers

• Incomplete quantum oblivious transfer with perfect one-sided security [0.0]
  We consider 1 out of 2 oblivious transfer, where a sender sends two bits of information to a receiver. We aim to find the lowest possible cheating probabilities. We show that non-interactive quantum protocols can outperform non-interactive classical protocols.
  arXiv  Detail & Related papers  (2024-09-26T06:35:36Z)
• Efficient quantum circuits for port-based teleportation [0.8192907805418583]
  Port-based teleportation (PBT) is a variant of quantum teleportation that does not require a correction operation on the teleported state. Since its introduction by Ishizaka and Hiroshima in 2008, no efficient implementation of PBT was known. We construct efficient quantum algorithms for probabilistic and deterministic PBT protocols on $n$ ports of arbitrary local dimension.
  arXiv  Detail & Related papers  (2023-12-05T23:39:04Z)
• Efficient Algorithms for All Port-Based Teleportation Protocols [10.720038857779135]
  Port-based teleportation (PBT) is a form of quantum teleportation in which no corrective unitary is required. We provide algorithms in all four regimes for qudits tackling the two deterministic cases for qudits. Our approach to the implementation of the square-root measurement in PBT can be directly generalised to other highly symmetric state ensembles.
  arXiv  Detail & Related papers  (2023-11-20T18:49:16Z)
• Quantum Two-Way Communication Protocol Beyond Superdense Coding [36.25599253958745]
  We introduce a generalization of one-way superdense coding to two-way communication protocols for transmitting classical bits by using entangled quantum pairs. The proposed protocol gives a 50% increase in both data rate and energy efficiency compared to the classical protocol.
  arXiv  Detail & Related papers  (2023-09-06T08:48:07Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Automated Attack Synthesis by Extracting Finite State Machines from Protocol Specification Documents [25.871916915930996]
  We suggest a data-driven approach for extracting finite state machines (FSMs) from RFC documents. Unlike off-the-shelf NLP tools, we suggest a data-driven approach for extracting FSMs from RFC documents. We show the generalizability of our FSM extraction by using RFCs for six different protocols: BGPv4, DCCP,. SCTP and TCP.
  arXiv  Detail & Related papers  (2022-02-18T23:27:29Z)
• Square-root measurements and degradation of the resource state in port-based teleportation scheme [0.0]
  Port-based teleportation (PBT) is a protocol of quantum teleportation in which a receiver does not have to apply correction to the transmitted state. We analyse for the first time the recycling protocol for the deterministic PBT beyond the qubit case.
  arXiv  Detail & Related papers  (2021-05-31T11:20:34Z)
• Round-robin differential phase-time-shifting protocol for quantum key distribution: theory and experiment [58.03659958248968]
  Quantum key distribution (QKD) allows the establishment of common cryptographic keys among distant parties. Recently, a QKD protocol that circumvents the need for monitoring signal disturbance, has been proposed and demonstrated in initial experiments. We derive the security proofs of the round-robin differential phase-time-shifting protocol in the collective attack scenario. Our results show that the RRDPTS protocol can achieve higher secret key rate in comparison with the RRDPS, in the condition of high quantum bit error rate.
  arXiv  Detail & Related papers  (2021-03-15T15:20:09Z)
• Optimality of the pretty good measurement for port-based teleportation [7.106986689736826]
  Port-based teleportation (PBT) is a protocol in which Alice teleports an unknown quantum state to Bob. We give an explicit proof that the so-called pretty good measurement, or square-root measurement, is optimal for the PBT protocol.
  arXiv  Detail & Related papers  (2020-08-25T17:50:23Z)
• 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)
• Security Limitations of Classical-Client Delegated Quantum Computing [54.28005879611532]
  A client remotely prepares a quantum state using a classical channel. Privacy loss incurred by employing $RSP_CC$ as a sub-module is unclear. We show that a specific $RSP_CC$ protocol can replace the quantum channel at least in some contexts.
  arXiv  Detail & Related papers  (2020-07-03T13:15:13Z)

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.