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:0807.4568 · Physical Review Letters

Asymptotic Teleportation Scheme as a Universal Programmable Quantum Processor

Satoshi Ishizaka, Tohya Hiroshima

Published Dec 12, 2008• 147 citations
arXivHTMLPDF

Abstract

We consider a scheme of quantum teleportation where a receiver has multiple (N) output ports and obtains the teleported state by merely selecting one of the N ports according to the outcome of the sender's measurement. We demonstrate that such teleportation is possible by showing an explicit protocol where N pairs of maximally entangled qubits are employed. The optimal measurement performed by a sender is the square-root measurement, and a perfect teleportation fidelity is asymptotically achieved for a large N limit. Such asymptotic teleportation can be utilized as a universal programmable processor.

DOI
10.1103/physrevlett.101.240501

Related papers

Quantum teleportation scheme by selecting one of multiple output ports

Satoshi Ishizaka, Tohya Hiroshima

The scheme of quantum teleportation, where Bob has multiple $(N)$ output ports and obtains the teleported state by simply selecting one of the $N$ ports, is thoroughly studied. We consider both the deterministic version and probabilistic version of the teleportation scheme aiming to teleport an unknown state of a qubit. Moreover, we consider two cases for each version: (i) the state employed for the teleportation is fixed to a maximally entangled state and (ii) the state is also optimized as well as Alice's measurement. We analytically determine the optimal protocols for all the four cases and show the corresponding optimal fidelity or optimal success probability. All these protocols can achieve the perfect teleportation in the asymptotic limit of $N\ensuremath{\rightarrow}\ensuremath{\infty}$. The entanglement properties of the teleportation scheme are also discussed.

arXiv:0901.2975•Physical Review A•Apr 3, 2009•101 citations

Asymptotic teleportation scheme bridging between standard and port-based teleportation

Ha Eum Kim, Kabgyun Jeong

Abstract Various modified quantum teleportation schemes are proposed to overcome experimental constraints or to meet specific application requirements for quantum communication. Hence, most schemes are developed and studied with unique methodologies, each with its own inherent challenges. Our research focuses on interconnecting these schemes, which appear to be unrelated to each other, based on the idea that the unique advantages of one scheme can compensate for the limitations of another. In this paper, we introduce an asymptotic teleportation scheme that requires the receiver to complete a classical selection task before performing a quantum correction. This scheme bridges standard teleportation with port-based teleportation through the transformation of joint measurements. Specifically, we categorize and analytically investigate protocols within this scheme for qubit systems. Given that the linear optics teleportation protocol without ancilla qubits is contained in the two non-trivial groups, we provide a novel perspective on its expansion. Furthermore, we discuss the potential application of a protocol from one of these groups as a universal programmable processor and extend these protocols to higher-dimensional systems while maintaining the same properties and potential, providing the analytic form of the joint measurement and its performance. These results thereby propose new avenues for developing a quantum network in higher-dimensional systems.

arXiv:2403.04315•Quantum Science and Technology•Jul 10, 2024•1 citation

Quantum teleportation by using a genuinely entangled seven-qubit state

XinMei SUN, YaJun DUAN, Xin-Wei Zha

It is shown that a maximally seven-qubit state can be utilized for perfect teleportation of arbitrary three qubit systems and controlled teleportation of an arbitrary three qubit state. For perfect teleportation, the sender first performs a Von-Neumann measurement on her qubits, then the sender(Alice) tells the measurement result to the receiver(Bob) via a classical channel, the receiver can reconstruct the original state by performing appropriate unitary transformations on his qubits at hand. For controlled teleportation, the sender firstly carries out proper Bell-state measurements and the controller(charlie) needs to operate a single-qubit measurement, the receiver can reconstruct the original state by applying appropriate unitary transformations on his qubits after he knows the measurement results of both the sender and controller. Besides, the two teleportation schemes can be realized with the maximal probability.

Zhongguo kexue. Wulixue Lixue Tianwenxue•May 1, 2014•4 citations

Optimal Multi-port-based Teleportation Schemes

Marek Mozrzymas, Michał Studziński, Piotr Kopszak

In this paper, we introduce optimal versions of a multi-port based teleportation scheme allowing to send a large amount of quantum information. We fully characterise probabilistic and deterministic case by presenting expressions for the average probability of success and entanglement fidelity. In the probabilistic case, the final expression depends only on global parameters describing the problem, such as the number of ports N , the number of teleported systems k , and local dimension d . It allows us to show square improvement in the number of ports with respect to the non-optimal case. We also show that the number of teleported systems can grow when the number N of ports increases as o(N) still giving high efficiency. In the deterministic case, we connect entanglement fidelity with the maximal eigenvalue of a generalised teleportation matrix. In both cases the optimal set of measurements and the optimal state shared between sender and receiver is presented. All the results are obtained by formulating and solving primal and dual SDP problems, which due to existing symmetries can be solved analytically. We use extensively tools from representation theory and formulate new results that could be of the separate interest for the potential readers.

arXiv:2011.09256•Quantum•Jun 17, 2021•14 citations

Optimal partial deterministic quantum teleportation of qubits

Ladislav Mišta, Radim Filip

We propose a protocol implementing optimal partial deterministic quantum teleportation for qubits. This is a teleportation scheme realizing deterministically an optimal $1\ensuremath{\rightarrow}2$ asymmetric universal cloning where one imperfect copy of the input state emerges at the sender's station while the other copy emerges at receiver's possibly distant station. The optimality means that the fidelities of the copies saturate the asymmetric cloning inequality. The performance of the protocol relies on the partial deterministic nondemolition Bell measurement that allows us to continuously control the flow of information among the outgoing qubits. We also demonstrate that the measurement is optimal two-qubit operation in the sense of the trade-off between the state disturbance and the information gain.

Physical Review A•Feb 24, 2005•9 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•30 citations
We consider a scheme of quantum teleportation where a receiver has multiple (N) output ports and obtains the teleported state by merely selecting one of the N ports according to the outcome of the sender's measurement. We demonstrate that such teleportation is possible by showing an explicit protocol where N pairs of maximally entangled qubits are employed. The optimal measurement performed by a sender is the square-root measurement, and a perfect teleportation fidelity is asymptotically achieved for a large N limit. Such asymptotic teleportation can be utilized as a universal programmable processor.
The scheme of quantum teleportation, where Bob has multiple (N)(N)(N) output ports and obtains the teleported state by simply selecting one of the NNN ports, is thoroughly studied. We consider both the deterministic version and probabilistic version of the teleportation scheme aiming to teleport an unknown state of a qubit. Moreover, we consider two cases for each version: (i) the state employed for the teleportation is fixed to a maximally entangled state and (ii) the state is also optimized as well as Alice's measurement. We analytically determine the optimal protocols for all the four cases and show the corresponding optimal fidelity or optimal success probability. All these protocols can achieve the perfect teleportation in the asymptotic limit of $N\ensuremath{\rightarrow}\ensuremath{\infty}$. The entanglement properties of the teleportation scheme are also discussed.
Abstract Various modified quantum teleportation schemes are proposed to overcome experimental constraints or to meet specific application requirements for quantum communication. Hence, most schemes are developed and studied with unique methodologies, each with its own inherent challenges. Our research focuses on interconnecting these schemes, which appear to be unrelated to each other, based on the idea that the unique advantages of one scheme can compensate for the limitations of another. In this paper, we introduce an asymptotic teleportation scheme that requires the receiver to complete a classical selection task before performing a quantum correction. This scheme bridges standard teleportation with port-based teleportation through the transformation of joint measurements. Specifically, we categorize and analytically investigate protocols within this scheme for qubit systems. Given that the linear optics teleportation protocol without ancilla qubits is contained in the two non-trivial groups, we provide a novel perspective on its expansion. Furthermore, we discuss the potential application of a protocol from one of these groups as a universal programmable processor and extend these protocols to higher-dimensional systems while maintaining the same properties and potential, providing the analytic form of the joint measurement and its performance. These results thereby propose new avenues for developing a quantum network in higher-dimensional systems.
It is shown that a maximally seven-qubit state can be utilized for perfect teleportation of arbitrary three qubit systems and controlled teleportation of an arbitrary three qubit state. For perfect teleportation, the sender first performs a Von-Neumann measurement on her qubits, then the sender(Alice) tells the measurement result to the receiver(Bob) via a classical channel, the receiver can reconstruct the original state by performing appropriate unitary transformations on his qubits at hand. For controlled teleportation, the sender firstly carries out proper Bell-state measurements and the controller(charlie) needs to operate a single-qubit measurement, the receiver can reconstruct the original state by applying appropriate unitary transformations on his qubits after he knows the measurement results of both the sender and controller. Besides, the two teleportation schemes can be realized with the maximal probability.
In this paper, we introduce optimal versions of a multi-port based teleportation scheme allowing to send a large amount of quantum information. We fully characterise probabilistic and deterministic case by presenting expressions for the average probability of success and entanglement fidelity. In the probabilistic case, the final expression depends only on global parameters describing the problem, such as the number of ports N , the number of teleported systems k , and local dimension d . It allows us to show square improvement in the number of ports with respect to the non-optimal case. We also show that the number of teleported systems can grow when the number N of ports increases as o(N) still giving high efficiency. In the deterministic case, we connect entanglement fidelity with the maximal eigenvalue of a generalised teleportation matrix. In both cases the optimal set of measurements and the optimal state shared between sender and receiver is presented. All the results are obtained by formulating and solving primal and dual SDP problems, which due to existing symmetries can be solved analytically. We use extensively tools from representation theory and formulate new results that could be of the separate interest for the potential readers.
We propose a protocol implementing optimal partial deterministic quantum teleportation for qubits. This is a teleportation scheme realizing deterministically an optimal $1\ensuremath{\rightarrow}2$ asymmetric universal cloning where one imperfect copy of the input state emerges at the sender's station while the other copy emerges at receiver's possibly distant station. The optimality means that the fidelities of the copies saturate the asymmetric cloning inequality. The performance of the protocol relies on the partial deterministic nondemolition Bell measurement that allows us to continuously control the flow of information among the outgoing qubits. We also demonstrate that the measurement is optimal two-qubit operation in the sense of the trade-off between the state disturbance and the information gain.
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.