Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1506.01555

Some remarks on port-based teleportation

Satoshi Ishizaka

Published Jun 4, 2015• 23 citations
arXivHTMLPDF

Abstract

Port-based teleportation (PBT) is a teleportation scheme such that the teleported state appears in one of receiver's multiple output ports without any correcting operation on the output port. In this paper, we make some remarks on PBT. Those include the possibility of recoverable PBT (a hybrid protocol between PBT and the standard teleportation scheme), the possibility of port-based superdense coding (a dual protocol to PBT), and the fidelily upper bound expected from the entanglement monogamy relation in asymmetric universal cloning.

DOI
10.48550/arxiv.1506.01555

Related papers

Minimal port-based teleportation

Sergii Strelchuk, Michał Studziński

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 − N + 2 2 N + 1 and fidelity 1 − O ( 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.

arXiv:2111.05499•New Journal of Physics•Jun 1, 2023•11 citations

Continuous variable port-based teleportation

Jason L. Pereira, Leonardo Banchi, Stefano Pirandola

Abstract Port-based teleportation (PBT) is a generalisation of the standard teleportation protocol which does not require unitary operations by the receiver. This comes at the price of requiring N > 1 entangled pairs, while N = 1 for the standard teleportation protocol. The lack of correction unitaries allows PBT to be used as a fundamental theoretical tool to simulate arbitrary channels with a general resource, with applications to study fundamental limits of quantum communication, cryptography and sensing, and to define general programmable quantum computers. Here we introduce a general formulation of port-based teleportation in continuous variable systems and study in detail the N = 2 case. In particular, we interpret the resulting channel as an energy truncation and analyse the kinds of channels that can be naturally simulated after this restriction.

arXiv:2302.08522•Journal of Physics A Mathematical and Theoretical•Nov 16, 2023•9 citations

Port-based teleportation in arbitrary dimension

Michał Studziński, Sergii Strelchuk, Marek Mozrzymas +1 more

Port-based teleportation (PBT), introduced in 2008, is a type of quantum teleportation protocol which transmits the state to the receiver without requiring any corrections on the receiver's side. Evaluating the performance of PBT was computationally intractable and previous attempts succeeded only with small systems. We study PBT protocols and fully characterize their performance for arbitrary dimensions and number of ports. We develop new mathematical tools to study the symmetries of the measurement operators that arise in these protocols and belong to the algebra of partially transposed permutation operators. First, we develop the representation theory of the mentioned algebra which provides an elegant way of understanding the properties of subsystems of a large system with general symmetries. In particular, we introduce the theory of the partially reduced irreducible representations which we use to obtain a simpler representation of the algebra of partially transposed permutation operators and thus explicitly determine the properties of any port-based teleportation scheme for fixed dimension in polynomial time.

arXiv:1612.09260•Scientific Reports•Sep 1, 2017•62 citations

Efficient Algorithms for All Port-Based Teleportation Protocols

Adam Wills, Min-Hsiu Hsieh, Sergii Strelchuk

Port-based teleportation (PBT) is a form of quantum teleportation in which no corrective unitary is required on the part of the receiver. Two primary regimes exist—deterministic PBT in which teleportation is always successful, but is imperfect, and probabilistic PBT, in which teleportation succeeds with probability less than one, but teleportation is perfect upon a success. Two further regimes exist within each of these, in which the resource state used for the teleportation is fixed to a maximally entangled state or free to be optimized. Recent works have resolved the long-standing problem of efficiently implementing port-based teleportation, tackling the two deterministic cases for qudits. Here, we provide algorithms in all four regimes for qubits. Emphasis is placed on the practicality of these algorithms, where we give polynomial improvements in the known gate complexity for PBT, as well as an exponential improvement in the required number of ancillas (albeit in separate protocols). Our approach to the implementation of the square-root measurement in PBT can be directly generalized to other highly symmetric state ensembles. For certain families of states, such a framework yields efficient algorithms in the case in which the Petz-recovery algorithm for the square-root measurement runs in exponential time. Published by the American Physical Society 2024

arXiv:2311.12012•PRX Quantum•Sep 20, 2024•10 citations

Characterising port-based teleportation as universal simulator of qubit channels

Jason L. Pereira, Leonardo Banchi, Stefano Pirandola

Abstract Port-based teleportation (PBT) is a teleportation protocol that employs a number of Bell pairs and a joint measurement to enact an approximate input-output identity channel. Replacing the Bell pairs with a different multi-qubit resource state changes the enacted channel and allows the PBT protocol to simulate qubit channels beyond the identity. The channel resulting from PBT using a general resource state is consequently of interest. In this work, we fully characterise the Choi matrix of the qubit channel simulated by the PBT protocol in terms of its resource state. We also characterise the PBT protocol itself, by finding a description of the map from the resource state to the Choi matrix of the channel that is simulated by using that resource state. Finally, we exploit our expressions to show improved simulations of the amplitude damping channel by means of PBT with a finite number of ports.

arXiv:1912.10374•Journal of Physics A Mathematical and Theoretical•Feb 15, 2021•19 citations

A simple proof of unitary parallelization via port-based teleportation

Anurag Anshu, Quynh T. Nguyen

Port-based teleportation (PBT) is a variant of quantum teleportation that does not require corrections on the teleported state: starting with $N$ shared EPR states, Alice can teleport a qudit to Bob by performing a measurement on her system and informing Bob which of his $N$ `ports' to retrieve the state, up to infidelity decaying with $N$. Existing efficient quantum circuits of PBT rely on representation theory tools such as the Schur transform. In this note, we report an elementary efficient circuit for PBT, which has depth $\operatorname{polylog}(N,d)$. As a corollary, this gives a simple proof that all $n$-qubit unitaries can be parallelized to $\operatorname{poly}(n)$ depth, recovering a recent result due to Nehoran--Slote--Yuen and OpenAI.

quant-pharXiv:2610.30761•Oct 23, 2026•0 citations
Port-based teleportation (PBT) is a teleportation scheme such that the teleported state appears in one of receiver's multiple output ports without any correcting operation on the output port. In this paper, we make some remarks on PBT. Those include the possibility of recoverable PBT (a hybrid protocol between PBT and the standard teleportation scheme), the possibility of port-based superdense coding (a dual protocol to PBT), and the fidelily upper bound expected from the entanglement monogamy relation in asymmetric universal cloning.
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 − N + 2 2 N + 1 and fidelity 1 − O ( 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.
Abstract Port-based teleportation (PBT) is a generalisation of the standard teleportation protocol which does not require unitary operations by the receiver. This comes at the price of requiring N > 1 entangled pairs, while N = 1 for the standard teleportation protocol. The lack of correction unitaries allows PBT to be used as a fundamental theoretical tool to simulate arbitrary channels with a general resource, with applications to study fundamental limits of quantum communication, cryptography and sensing, and to define general programmable quantum computers. Here we introduce a general formulation of port-based teleportation in continuous variable systems and study in detail the N = 2 case. In particular, we interpret the resulting channel as an energy truncation and analyse the kinds of channels that can be naturally simulated after this restriction.
Port-based teleportation (PBT), introduced in 2008, is a type of quantum teleportation protocol which transmits the state to the receiver without requiring any corrections on the receiver's side. Evaluating the performance of PBT was computationally intractable and previous attempts succeeded only with small systems. We study PBT protocols and fully characterize their performance for arbitrary dimensions and number of ports. We develop new mathematical tools to study the symmetries of the measurement operators that arise in these protocols and belong to the algebra of partially transposed permutation operators. First, we develop the representation theory of the mentioned algebra which provides an elegant way of understanding the properties of subsystems of a large system with general symmetries. In particular, we introduce the theory of the partially reduced irreducible representations which we use to obtain a simpler representation of the algebra of partially transposed permutation operators and thus explicitly determine the properties of any port-based teleportation scheme for fixed dimension in polynomial time.
Port-based teleportation (PBT) is a form of quantum teleportation in which no corrective unitary is required on the part of the receiver. Two primary regimes exist—deterministic PBT in which teleportation is always successful, but is imperfect, and probabilistic PBT, in which teleportation succeeds with probability less than one, but teleportation is perfect upon a success. Two further regimes exist within each of these, in which the resource state used for the teleportation is fixed to a maximally entangled state or free to be optimized. Recent works have resolved the long-standing problem of efficiently implementing port-based teleportation, tackling the two deterministic cases for qudits. Here, we provide algorithms in all four regimes for qubits. Emphasis is placed on the practicality of these algorithms, where we give polynomial improvements in the known gate complexity for PBT, as well as an exponential improvement in the required number of ancillas (albeit in separate protocols). Our approach to the implementation of the square-root measurement in PBT can be directly generalized to other highly symmetric state ensembles. For certain families of states, such a framework yields efficient algorithms in the case in which the Petz-recovery algorithm for the square-root measurement runs in exponential time. Published by the American Physical Society 2024
Abstract Port-based teleportation (PBT) is a teleportation protocol that employs a number of Bell pairs and a joint measurement to enact an approximate input-output identity channel. Replacing the Bell pairs with a different multi-qubit resource state changes the enacted channel and allows the PBT protocol to simulate qubit channels beyond the identity. The channel resulting from PBT using a general resource state is consequently of interest. In this work, we fully characterise the Choi matrix of the qubit channel simulated by the PBT protocol in terms of its resource state. We also characterise the PBT protocol itself, by finding a description of the map from the resource state to the Choi matrix of the channel that is simulated by using that resource state. Finally, we exploit our expressions to show improved simulations of the amplitude damping channel by means of PBT with a finite number of ports.
Port-based teleportation (PBT) is a variant of quantum teleportation that does not require corrections on the teleported state: starting with NNN shared EPR states, Alice can teleport a qudit to Bob by performing a measurement on her system and informing Bob which of his NNN `ports' to retrieve the state, up to infidelity decaying with NNN. Existing efficient quantum circuits of PBT rely on representation theory tools such as the Schur transform. In this note, we report an elementary efficient circuit for PBT, which has depth polylog⁡(N,d)\operatorname{polylog}(N,d)polylog(N,d). As a corollary, this gives a simple proof that all nnn-qubit unitaries can be parallelized to poly⁡(n)\operatorname{poly}(n)poly(n) depth, recovering a recent result due to Nehoran--Slote--Yuen and OpenAI.