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:2111.05499 · New Journal of Physics

Minimal port-based teleportation

Sergii Strelchuk, Michał Studziński

Published Jun 1, 2023• 11 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1088/1367-2630/acdab4

Related papers

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

Some remarks on port-based teleportation

Satoshi Ishizaka

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.

arXiv:1506.01555•Jun 4, 2015•23 citations

Efficient quantum circuits for port-based teleportation

Dmitry Grinko, Adam Burchardt, Māris Ozols

Port-based teleportation (PBT) is a variant of quantum teleportation that, unlike the canonical protocol by Bennett et al., 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 close this long-standing gap by building on our recent results on representations of partially transposed permutation matrix algebras and mixed quantum Schur transform. We construct efficient quantum algorithms for probabilistic and deterministic PBT protocols on $n$ ports of arbitrary local dimension, both for EPR and optimized resource states. We describe two constructions based on different encodings of the Gelfand-Tsetlin basis for $n$ qudits: a standard encoding that achieves $\widetilde{O}(n)$ time and $O(n\log(n))$ space complexity, and a Yamanouchi encoding that achieves $\widetilde{O}(n^2)$ time and $O(\log(n))$ space complexity, both for constant local dimension and target error. We also describe efficient circuits for preparing the optimal resource states.

arXiv:2312.03188•Dec 5, 2023•29 citations

Asymptotic Performance of Port-Based Teleportation

Matthias Christandl, Felix Leditzky, Christian Majenz +3 more

Abstract Quantum teleportation is one of the fundamental building blocks of quantum Shannon theory. While ordinary teleportation is simple and efficient, port-based teleportation (PBT) enables applications such as universal programmable quantum processors, instantaneous non-local quantum computation and attacks on position-based quantum cryptography. In this work, we determine the fundamental limit on the performance of PBT: for arbitrary fixed input dimension and a large number N of ports, the error of the optimal protocol is proportional to the inverse square of N . We prove this by deriving an achievability bound, obtained by relating the corresponding optimization problem to the lowest Dirichlet eigenvalue of the Laplacian on the ordered simplex. We also give an improved converse bound of matching order in the number of ports. In addition, we determine the leading-order asymptotics of PBT variants defined in terms of maximally entangled resource states. The proofs of these results rely on connecting recently-derived representation-theoretic formulas to random matrix theory. Along the way, we refine a convergence result for the fluctuations of the Schur–Weyl distribution by Johansson, which might be of independent interest.

arXiv:1809.10751•Communications in Mathematical Physics•Nov 20, 2020•44 citations

Efficient Multi Port-Based Teleportation Schemes

Michał Studziński, Marek Mozrzymas, Piotr Kopszak +1 more

In this manuscript we analyse generalised port-based teleportation (PBT) schemes, allowing for transmitting more than one unknown quantum state (or a composite quantum state) in one go, where the state ends up in several ports at Bob’s side. We investigate the efficiency of our scheme discussing both deterministic and probabilistic case, where parties share maximally entangled states. It turns out that the new scheme gives better performance than various variants of the optimal PBT protocol used for the same task. All the results are presented in group-theoretic manner depending on such quantities like dimensions and multiplicities of irreducible representations in the Schur-Weyl duality. The presented analysis was possible by considering the algebra of permutation operators acting on$n$systems distorted by the action of partial transposition acting on more than one subsystem. Considering its action on the$n-$fold tensor product of the Hilbert space with finite dimension, we present construction of the respective irreducible matrix representations, which are in fact matrix irreducible representations of the Walled Brauer Algebra. I turns out that the introduced formalism, and symmetries beneath it, appears in many aspects of theoretical physics and mathematics - theory of anti ferromagnetism, aspects of gravity theory or in the problem of designing quantum circuits for special task like for example inverting an unknown unitary.

arXiv:2008.00984•IEEE Transactions on Information Theory•Jul 5, 2022•36 citations

Asynchronous quantum computation through port-based teleportation

Chloe Kim, Eric Chitambar, Felix Leditzky

Abstract In standard quantum teleportation, the receiver must wait for a classical message from the sender before subsequently processing the transmitted quantum information. However, in port-based teleportation (PBT), this local processing can begin before the classical message is received, thereby allowing for asynchronous quantum information processing. Motivated by resource-theoretic considerations and practical applications, we propose different communication models that progressively allow for more powerful decoding strategies while still permitting asynchronous distributed quantum computation, a salient feature of standard PBT. Specifically, we consider PBT protocols augmented by free classical processing and/or different forms of quantum pre-processing, and we investigate the maximum achievable teleportation fidelities under such operations. Our analysis focuses specifically on the PBT power of isotropic states, bipartite graph states, and symmetrized EPR states, and we compute tight bounds on the optimal teleportation fidelities for such states. We finally show that, among this hierarchy of communication models consistent with asynchronous quantum information processing, the strongest resource theory is equally as powerful as any one-way teleportation protocol for surpassing the classical teleportation threshold. Thus, a bipartite state can break the one-way classical teleportation threshold if and only if it can be done using the trivial decoding map of discarding subsystems.

arXiv:2504.12945•New Journal of Physics•Feb 24, 2026•2 citations
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.
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
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.
Port-based teleportation (PBT) is a variant of quantum teleportation that, unlike the canonical protocol by Bennett et al., 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 close this long-standing gap by building on our recent results on representations of partially transposed permutation matrix algebras and mixed quantum Schur transform. We construct efficient quantum algorithms for probabilistic and deterministic PBT protocols on nnn ports of arbitrary local dimension, both for EPR and optimized resource states. We describe two constructions based on different encodings of the Gelfand-Tsetlin basis for nnn qudits: a standard encoding that achieves O~(n)\widetilde{O}(n)O(n) time and O(nlog⁡(n))O(n\log(n))O(nlog(n)) space complexity, and a Yamanouchi encoding that achieves O~(n2)\widetilde{O}(n^2)O(n2) time and O(log⁡(n))O(\log(n))O(log(n)) space complexity, both for constant local dimension and target error. We also describe efficient circuits for preparing the optimal resource states.
Abstract Quantum teleportation is one of the fundamental building blocks of quantum Shannon theory. While ordinary teleportation is simple and efficient, port-based teleportation (PBT) enables applications such as universal programmable quantum processors, instantaneous non-local quantum computation and attacks on position-based quantum cryptography. In this work, we determine the fundamental limit on the performance of PBT: for arbitrary fixed input dimension and a large number N of ports, the error of the optimal protocol is proportional to the inverse square of N . We prove this by deriving an achievability bound, obtained by relating the corresponding optimization problem to the lowest Dirichlet eigenvalue of the Laplacian on the ordered simplex. We also give an improved converse bound of matching order in the number of ports. In addition, we determine the leading-order asymptotics of PBT variants defined in terms of maximally entangled resource states. The proofs of these results rely on connecting recently-derived representation-theoretic formulas to random matrix theory. Along the way, we refine a convergence result for the fluctuations of the Schur–Weyl distribution by Johansson, which might be of independent interest.
In this manuscript we analyse generalised port-based teleportation (PBT) schemes, allowing for transmitting more than one unknown quantum state (or a composite quantum state) in one go, where the state ends up in several ports at Bob’s side. We investigate the efficiency of our scheme discussing both deterministic and probabilistic case, where parties share maximally entangled states. It turns out that the new scheme gives better performance than various variants of the optimal PBT protocol used for the same task. All the results are presented in group-theoretic manner depending on such quantities like dimensions and multiplicities of irreducible representations in the Schur-Weyl duality. The presented analysis was possible by considering the algebra of permutation operators acting onnnnsystems distorted by the action of partial transposition acting on more than one subsystem. Considering its action on then−n-n−fold tensor product of the Hilbert space with finite dimension, we present construction of the respective irreducible matrix representations, which are in fact matrix irreducible representations of the Walled Brauer Algebra. I turns out that the introduced formalism, and symmetries beneath it, appears in many aspects of theoretical physics and mathematics - theory of anti ferromagnetism, aspects of gravity theory or in the problem of designing quantum circuits for special task like for example inverting an unknown unitary.
Abstract In standard quantum teleportation, the receiver must wait for a classical message from the sender before subsequently processing the transmitted quantum information. However, in port-based teleportation (PBT), this local processing can begin before the classical message is received, thereby allowing for asynchronous quantum information processing. Motivated by resource-theoretic considerations and practical applications, we propose different communication models that progressively allow for more powerful decoding strategies while still permitting asynchronous distributed quantum computation, a salient feature of standard PBT. Specifically, we consider PBT protocols augmented by free classical processing and/or different forms of quantum pre-processing, and we investigate the maximum achievable teleportation fidelities under such operations. Our analysis focuses specifically on the PBT power of isotropic states, bipartite graph states, and symmetrized EPR states, and we compute tight bounds on the optimal teleportation fidelities for such states. We finally show that, among this hierarchy of communication models consistent with asynchronous quantum information processing, the strongest resource theory is equally as powerful as any one-way teleportation protocol for surpassing the classical teleportation threshold. Thus, a bipartite state can break the one-way classical teleportation threshold if and only if it can be done using the trivial decoding map of discarding subsystems.