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:2210.10882 · AVS Quantum Science

The SWAP imposter: Bidirectional quantum teleportation and its performance

Aliza U. Siddiqui, Mark M. Wilde

Published Mar 1, 2023• 8 citations
arXivHTMLPDF

Abstract

Bidirectional quantum teleportation is a fundamental protocol for exchanging quantum information between two parties. Specifically, two individuals make use of a shared resource state as well as local operations and classical communication (LOCC) to swap quantum states. In this work, we concisely highlight the contributions of our companion paper [A. U. Siddiqui and M. M. Wilde, arXiv:2010.07905 (2020)]. We develop two different ways of quantifying the error of nonideal bidirectional teleportation by means of the normalized diamond distance and the channel infidelity. We then establish that the values given by both metrics are equal for this task. Additionally, by relaxing the set of operations allowed from LOCC to those that completely preserve the positivity of the partial transpose, we obtain semidefinite programing lower bounds on the error of nonideal bidirectional teleportation. We evaluate these bounds for some key examples—isotropic states and when there is no resource state at all. In both cases, we find an analytical solution. The second example establishes a benchmark for classical versus quantum bidirectional teleportation. Another example that we investigate consists of two Bell states that have been sent through a generalized amplitude damping channel. For this scenario, we find an analytical expression for the error, as well as a numerical solution that agrees with the former up to numerical precision.

DOI
10.1116/5.0135467

Related papers

Quantifying the performance of bidirectional quantum teleportation

Aliza U. Siddiqui, Mark M. Wilde

Bidirectional teleportation is a fundamental protocol for exchanging quantum information between two parties by means of a shared resource state and local operations and classical communication (LOCC). In this paper, we develop two seemingly different ways of quantifying the simulation error of unideal bidirectional teleportation by means of the normalized diamond distance and the channel infidelity, and we prove that they are equivalent. By relaxing the set of operations allowed from LOCC to those that completely preserve the positivity of the partial transpose, we obtain semi-definite programming lower bounds on the simulation error of unideal bidirectional teleportation. We evaluate these bounds for several key examples: when there is no resource state at all and for isotropic and Werner states, in each case finding an analytical solution. The first aforementioned example establishes a benchmark for classical versus quantum bidirectional teleportation. Another example consists of a resource state resulting from the action of a generalized amplitude damping channel on two Bell states, for which we find an analytical expression for the simulation error that is in agreement with numerical estimates (up to numerical precision). We then evaluate the performance of some schemes for bidirectional teleportation due to (Kiktenko et al., Phys. Rev. A 93, 062305 (2016)) and find that they are suboptimal and do not go beyond the aforementioned classical limit for bidirectional teleportation. We offer a scheme alternative to theirs that is provably optimal. Finally, we generalize the whole development to the setting of bidirectional controlled teleportation, in which there is an additional assisting party who helps with the exchange of quantum information, and we establish semi-definite programming lower bounds on the simulation error for this task. More generally, we provide semi-definite programming lower bounds on the performance of bipartite and multipartite channel simulation using a shared resource state and LOCC.

arXiv:2010.07905•Canadian Journal of Physics•Aug 30, 2024•6 citations

Quantifying the performance of approximate teleportation and quantum error correction via symmetric 2-PPT-extendible channels

Tharon Holdsworth, Vishal Singh, Mark M. Wilde

The ideal realization of quantum teleportation relies on having access to a maximally entangled state; however, in practice, such an ideal state is typically not available and one can instead only realize an approximate teleportation. With this in mind, we present a method to quantify the performance of approximate teleportation when using an arbitrary resource state. More specifically, after framing the task of approximate teleportation as an optimization of a simulation error over one-way local operations and classical communication (LOCC) channels, we establish a semidefinite relaxation of this optimization task by instead optimizing over the larger set of 2-PPT-extendible channels (where PPT denotes positive partial transpose). The main analytical calculations in our paper consist of exploiting the unitary covariance symmetry of the identity channel to establish a significant reduction of the computational cost of this latter optimization. Next, by exploiting known connections between approximate teleportation and quantum error correction, we also apply these concepts to establish bounds on the performance of approximate quantum error correction over a given quantum channel. Finally, we evaluate our bounds for various examples of resource states and channels.

arXiv:2207.06931•Physical Review A•Jan 26, 2023•10 citations

Bidirectional Hybrid Quantum Communication of Two-Qubit States

Yao Lü, Min Jiang

Abstract This paper proposes a hybrid bidirectional quantum communication protocol, in which two parties simultaneously transmit two-qubit states: one via quantum teleportation (QT) and the other via remote state preparation (RSP). This approach establishes a more flexible model for bidirectional quantum communication. The protocol utilizes a specially designed maximally entangled quantum channel to enable hybrid bidirectional communication. By performing Bell measurements, joint projective measurements, and corresponding unitary operations, quantum teleportation from Alice to Bob and remote state preparation from Bob to Alice can be accomplished synchronously. Furthermore, the robustness of the proposed protocol is evaluated under three typical noisy environments, namely the amplitude damping (AD) channel, phase damping(PD) channel and the depolarizing (DP) channel. The proposed protocol provides a novel framework for effcient bidirectional quantum communication, with potential advantages in enhancing interactivity and optimizing resource utilization in future quantum networks.

Chinese Physics B•Jul 14, 2026•0 citations

Enhanced two-way teleportation of entangled states with six-qubit cluster channel

R Vedhanayagi, Soubhik De, Basherrudin Mahmud Ahmed A +1 more

Abstract A bidirectional quantum teleportation protocol is proposed for the transfer of two-qubit entangled states between two parties utilizing a six-qubit cluster state quantum channel. The protocol enhances the resource efficiency by allowing the reconstruction of teleported states without the use of CNOT operations or auxiliary qubits at the receiver’s end. Comparative analysis with existing schemes highlights the higher intrinsic efficiency of the proposed approach for bidirectional quantum teleportation. The protocol is further generalized to enable the bidirectional teleportation of arbitrary n-qubit entangled states using the same six-qubit quantum resource, demonstrating scalability. The protocol is simulated under various noise models to evaluate its robustness, with fidelity assessments carried out using the IBM Qiskit SDK. A complete teleportation circuit implementing the protocol is designed using standard quantum gates.

Physica Scripta•May 22, 2025•0 citations

Bidirectional quantum operation teleportation with different states

Siqi Zhou, Ming-Qiang Bai, Ting Liao +3 more

A new concept of bidirectional quantum operation teleportation (BQOT) is proposed, which is essentially a union of the idea of quantum operation teleportation (QOT) and bidirectional quantum teleportation (QT). This means that Alice can transmit an unknown single-qubit unitary operation [Formula: see text] on the remote Bob’s quantum system; and at the same time, Bob can also transmit an arbitrary single-qubit unitary operation [Formula: see text] on Alice’s quantum system. In this paper, we present three BQOT schemes via different quantum channels. Furthermore, using these quantum channels, we investigate the BQOT in noisy environments, such as phase-damping noise and amplitude-damping noise. We considered the influence of the noises on the process of these three BQOT protocols through analytical derivation of the fidelity. Moreover, these three schemes are amply compared with each other from five aspects, i.e. quantum resource consumption, operation complexity, classical resource consumption, success probability and efficiency. It is found that these schemes can be realized deterministically and the first scheme is better than the other two schemes.

International Journal of Quantum Information•Aug 1, 2018•14 citations

Entanglement and swap of quantum states in two qubits

Takaya Ikuto, Satoshi Ishizaka

Suppose that two distant parties Alice and Bob share an entangled state $\rho_{AB}$, and they want to exchange the subsystems of $\rho_{AB}$ by local operations and classical communication (LOCC). In general, this LOCC task (i.e. the LOCC transformation of $\rho_{AB} \to V\rho_{AB} V$ with $V$ being a swap operator) is impossible deterministically, but becomes possible probabilistically. In this paper, we study how the optimal probability is related to the amount of entanglement in the framework of positive partial transposed (PPT) operations, and numerically show a remarkable class of states whose probability is the smallest among every state in two quantum bits.

arXiv:1406.1601•Quantum Information and Computation•Sep 1, 2015•1 citation
Bidirectional quantum teleportation is a fundamental protocol for exchanging quantum information between two parties. Specifically, two individuals make use of a shared resource state as well as local operations and classical communication (LOCC) to swap quantum states. In this work, we concisely highlight the contributions of our companion paper [A. U. Siddiqui and M. M. Wilde, arXiv:2010.07905 (2020)]. We develop two different ways of quantifying the error of nonideal bidirectional teleportation by means of the normalized diamond distance and the channel infidelity. We then establish that the values given by both metrics are equal for this task. Additionally, by relaxing the set of operations allowed from LOCC to those that completely preserve the positivity of the partial transpose, we obtain semidefinite programing lower bounds on the error of nonideal bidirectional teleportation. We evaluate these bounds for some key examples—isotropic states and when there is no resource state at all. In both cases, we find an analytical solution. The second example establishes a benchmark for classical versus quantum bidirectional teleportation. Another example that we investigate consists of two Bell states that have been sent through a generalized amplitude damping channel. For this scenario, we find an analytical expression for the error, as well as a numerical solution that agrees with the former up to numerical precision.
Bidirectional teleportation is a fundamental protocol for exchanging quantum information between two parties by means of a shared resource state and local operations and classical communication (LOCC). In this paper, we develop two seemingly different ways of quantifying the simulation error of unideal bidirectional teleportation by means of the normalized diamond distance and the channel infidelity, and we prove that they are equivalent. By relaxing the set of operations allowed from LOCC to those that completely preserve the positivity of the partial transpose, we obtain semi-definite programming lower bounds on the simulation error of unideal bidirectional teleportation. We evaluate these bounds for several key examples: when there is no resource state at all and for isotropic and Werner states, in each case finding an analytical solution. The first aforementioned example establishes a benchmark for classical versus quantum bidirectional teleportation. Another example consists of a resource state resulting from the action of a generalized amplitude damping channel on two Bell states, for which we find an analytical expression for the simulation error that is in agreement with numerical estimates (up to numerical precision). We then evaluate the performance of some schemes for bidirectional teleportation due to (Kiktenko et al., Phys. Rev. A 93, 062305 (2016)) and find that they are suboptimal and do not go beyond the aforementioned classical limit for bidirectional teleportation. We offer a scheme alternative to theirs that is provably optimal. Finally, we generalize the whole development to the setting of bidirectional controlled teleportation, in which there is an additional assisting party who helps with the exchange of quantum information, and we establish semi-definite programming lower bounds on the simulation error for this task. More generally, we provide semi-definite programming lower bounds on the performance of bipartite and multipartite channel simulation using a shared resource state and LOCC.
The ideal realization of quantum teleportation relies on having access to a maximally entangled state; however, in practice, such an ideal state is typically not available and one can instead only realize an approximate teleportation. With this in mind, we present a method to quantify the performance of approximate teleportation when using an arbitrary resource state. More specifically, after framing the task of approximate teleportation as an optimization of a simulation error over one-way local operations and classical communication (LOCC) channels, we establish a semidefinite relaxation of this optimization task by instead optimizing over the larger set of 2-PPT-extendible channels (where PPT denotes positive partial transpose). The main analytical calculations in our paper consist of exploiting the unitary covariance symmetry of the identity channel to establish a significant reduction of the computational cost of this latter optimization. Next, by exploiting known connections between approximate teleportation and quantum error correction, we also apply these concepts to establish bounds on the performance of approximate quantum error correction over a given quantum channel. Finally, we evaluate our bounds for various examples of resource states and channels.
Abstract This paper proposes a hybrid bidirectional quantum communication protocol, in which two parties simultaneously transmit two-qubit states: one via quantum teleportation (QT) and the other via remote state preparation (RSP). This approach establishes a more flexible model for bidirectional quantum communication. The protocol utilizes a specially designed maximally entangled quantum channel to enable hybrid bidirectional communication. By performing Bell measurements, joint projective measurements, and corresponding unitary operations, quantum teleportation from Alice to Bob and remote state preparation from Bob to Alice can be accomplished synchronously. Furthermore, the robustness of the proposed protocol is evaluated under three typical noisy environments, namely the amplitude damping (AD) channel, phase damping(PD) channel and the depolarizing (DP) channel. The proposed protocol provides a novel framework for effcient bidirectional quantum communication, with potential advantages in enhancing interactivity and optimizing resource utilization in future quantum networks.
Abstract A bidirectional quantum teleportation protocol is proposed for the transfer of two-qubit entangled states between two parties utilizing a six-qubit cluster state quantum channel. The protocol enhances the resource efficiency by allowing the reconstruction of teleported states without the use of CNOT operations or auxiliary qubits at the receiver’s end. Comparative analysis with existing schemes highlights the higher intrinsic efficiency of the proposed approach for bidirectional quantum teleportation. The protocol is further generalized to enable the bidirectional teleportation of arbitrary n-qubit entangled states using the same six-qubit quantum resource, demonstrating scalability. The protocol is simulated under various noise models to evaluate its robustness, with fidelity assessments carried out using the IBM Qiskit SDK. A complete teleportation circuit implementing the protocol is designed using standard quantum gates.
A new concept of bidirectional quantum operation teleportation (BQOT) is proposed, which is essentially a union of the idea of quantum operation teleportation (QOT) and bidirectional quantum teleportation (QT). This means that Alice can transmit an unknown single-qubit unitary operation [Formula: see text] on the remote Bob’s quantum system; and at the same time, Bob can also transmit an arbitrary single-qubit unitary operation [Formula: see text] on Alice’s quantum system. In this paper, we present three BQOT schemes via different quantum channels. Furthermore, using these quantum channels, we investigate the BQOT in noisy environments, such as phase-damping noise and amplitude-damping noise. We considered the influence of the noises on the process of these three BQOT protocols through analytical derivation of the fidelity. Moreover, these three schemes are amply compared with each other from five aspects, i.e. quantum resource consumption, operation complexity, classical resource consumption, success probability and efficiency. It is found that these schemes can be realized deterministically and the first scheme is better than the other two schemes.
Suppose that two distant parties Alice and Bob share an entangled state ρAB\rho_{AB}ρAB​, and they want to exchange the subsystems of ρAB\rho_{AB}ρAB​ by local operations and classical communication (LOCC). In general, this LOCC task (i.e. the LOCC transformation of ρAB→VρABV\rho_{AB} \to V\rho_{AB} VρAB​→VρAB​V with VVV being a swap operator) is impossible deterministically, but becomes possible probabilistically. In this paper, we study how the optimal probability is related to the amount of entanglement in the framework of positive partial transposed (PPT) operations, and numerically show a remarkable class of states whose probability is the smallest among every state in two quantum bits.