As a variant of the original quantum teleportation, the port-based teleportation has been proposed, and its various kinds of useful applications in quantum information processing have been explored. Two users in the port-based teleportation initially share an arbitrary pure state, which can be represented by applying one user's local operation to a bipartite maximally entangled state. If the maximally entangled state is a $2M$-qudit state, then it can be expressed as $M$ copies of a two-qudit maximally entangled state, where $M$ is the number of the ports. We here consider a generalization of the original port-based teleportation obtained from employing copies of an arbitrary bipartite (mixed) resource instead of copies of a pure maximally entangled one. By means of the generalization, we construct a concept of the controlled port-based teleportation by combining the controlled teleportation with the port-based teleportation, and analyze its performance in terms of several meaningful quantities such as the teleportation fidelity, the entanglement fidelity, and the fully entangled fraction. In addition, we present new quantities called the control power and the minimal control power for the new controlled version on a given tripartite quantum state.
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.
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 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 …
Deterministic port-based teleportation (dPBT) protocol is a scheme where a quantum state is guaranteed to be transferred to another system without unitary correction. We characterize the best achievable performance of the dPBT when both the resource state and the measurement is optimized. Surprisingly, the best possible fidelity for an arbitrary number of ports and dimension of the teleported state is given by the largest eigenvalue of a particular matrix -- Teleportation Matrix. It encodes the relationship between a certain set of Young diagrams and emerges as the the optimal solution to the …
In port-based teleportation, Alice teleports an unknown quantum state to one of N ports at Bob's site. Alice applies a measurement and sends Bob the outcome k. Bob only needs to select the kth port in order to obtain the state. We present a theorem in the spirit of the no-cloning theorem, which says that it is impossible to extract any information from an unknown quantum state if only a single copy of it is provided and if the state remains unchanged. We use this theorem and the no-signaling principle to prove an upper bound on the success probability of port-based teleportation.
In this paper, we consider teleportation capability, distillability, and nonlocality on three-qubit states. In order to investigate some relations among them, we first find the explicit formulas of the quantities about the maximal teleportation fidelity on three-qubit states. We show that if any three-qubit state is useful for three-qubit teleportation then the three-qubit state is distillable into a Greenberger-Horne-Zeilinger state, and that if any three-qubit state violates a specific form of Mermin inequality then the three-qubit state is useful for three-qubit teleportation.
We define an entanglement measure, called the partial tangle, which represents the residual two-qubit entanglement of a three-qubit pure state. By its explicit calculations for three-qubit pure states, we show that the partial tangle is closely related to the faithfulness of a teleportation scheme over a three-qubit pure state.
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 perm…
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…
Port-based teleportation (PBT) is a variation of regular quantum teleportation that operates without a final unitary correction. However, its behavior for higher-dimensional systems has been hard to calculate explicitly beyond dimension $d=2$. Indeed, relying on conventional Hilbert-space representations entails an exponential overhead with increasing dimension. Some general upper and lower bounds for various success measures, such as (entanglement) fidelity, are known, but some become trivial in higher dimensions. Here we construct a graph-theoretic algebra (a subset of Temperley-Lieb algebra…
Quantum scissors device of Pegg et al. (1998 Phys. Rev. Lett. 81, 1604) enables truncation of the Fock-state expansion of an input optical field to qubit and qutrit (three-dimensional) states only. Here, a generalized scissors device is proposed using an eight-port optical interferometer. Upon post-selection based on photon counting results, the interferometer implements generation and teleportation of qudit (d-dimensional) states by truncation of an input field at the (d-1)th term of its Fock-state expansion up to d=6. Examples of selective truncations, which can be interpreted as a Fock-stat…
The monogamy inequality in terms of the concurrence, called the Coffman-Kundu-Wootters inequality [Phys. Rev. A {\bf 61}, 052306 (2000)], and its generalization [T.J. Osborne and F. Verstraete, Phys. Rev. Lett. {\bf 96}, 220503 (2006)] hold on general $n$-qubit states including mixed ones. In this paper, we consider the monogamy inequalities in terms of the fully entangled fraction and the teleportation fidelity. We show that the monogamy inequalities do not hold on general mixed states, while the inequalities hold on $n$-qubit pure states.
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 pro…
We first define a quantity exhibiting the usefulness of bipartite quantum states for teleportation, called the quantum teleportation capability, and then investigate its restricted shareability in multi-party quantum systems. In this work, we verify that the quantum teleportation capability has a monogamous property in its shareability for arbitrary three-qutrit pure states by employing the monogamy inequality in terms of the negativity.
Port-based teleportation under pure-dephasing decoherence
Center for Theoretical Physics, Polish Academy of Sciences（波兰科学院理论物理中心）；International Centre for Theory of Quantum Technologies, University of Gdańsk（格但斯克大学量子技术理论国际中心）
Port-based teleportation (PBT) is a protocol in which Alice teleports an unknown quantum state to Bob using measurements on a shared entangled multipartite state called the port state and forward classical communication. In this paper, we give an explicit proof that the so-called pretty good measurement, or square-root measurement, is optimal for the PBT protocol with independent copies of maximally entangled states as the port state. We then show that the very same measurement remains optimal even when the port state is optimized to yield the best possible PBT protocol. Hence, there is one pa…
A parametric amplifier is in essence a linear four-port device, which couples and linearly mixes two inputs before amplifying and sending them to two output ports. Here, we show that for quadrature-phase amplitudes, a parametric amplifier can replace beam splitters to play the role of mixer. We apply this idea to a continuous-variable quantum state teleportation scheme in which a parametric amplifier replaces a beam splitter in Bell measurement. We show that this scheme is loss-tolerant in the Bell measurement process and thus demonstrate the advantage of PA over BS in the applications in quan…
We introduce new teleportation protocols which are generalizations of the original teleportation protocols that use the Pauli group [Bennett, et al. Physical Review Letters, 70(13) 1895-1899] and the port-based teleportation protocols, introduced by Hiroshima and Ishizaka [Physical Review Letters, 101(24) 240501], that use the symmetric permutation group. We derive sufficient condition for a set of operations, which in general need not form a group, to give rise to a teleportation protocol and provide examples of such schemes. This generalization leads to protocols with novel properties and is…
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 PB…
We report an experimental implementation of tripartite controlled quantum teleportation on the quantum optical devices. The protocol is performed through bi- and tripartite entangled channels of discrete variables and qubits encoded in polarization of individual photons. The experimental results demonstrate successful controlled quantum teleportation with a fidelity around $83\%$, well above the classical limit. By realizing the controlled quantum teleportation through biseparable state, we show that tripartite entangled is not a necessary resource for controlled quantum teleportation and the …
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 ac…
We study a (k,m)-threshold controlling scheme for controlled quantum teleportation. A standard polynomial coding over GF(p) with prime p > m-1 needs to distribute a d-dimensional qudit with d >= p to each controller for this purpose. We propose a scheme using m qubits (two-dimensional qudits) for the controllers' portion, following a discussion on the benefit of a quantum control in comparison to a classical control of a quantum teleportation.
Entangled coherent states can be used to determine the entanglement fidelity for a device that is designed to teleport coherent states. This entanglement fidelity is universal, in that the calculation is independent of the use of entangled coherent states and applies generally to the teleportation of entanglement using coherent states. The average fidelity is shown to be a poor indicator of the capability of teleporting entanglement; i.e., very high average fidelity for the quantum teleportation apparatus can still result in low entanglement fidelity for one mode of the two-mode entangled cohe…
Hereunder we continue the study of the representation theory of the algebra of permutation operators acting on the $n$-fold tensor product space, partially transposed on the last subsystem. We develop the concept of partially reduced irreducible representations, which allows to simplify significantly previously proved theorems and what is the most important derive new results for irreducible representations of the mentioned algebra. In our analysis we are able to reduce complexity of the central expressions by getting rid of sums over all permutations from symmetric group obtaining equations w…
Port-based teleportation (PBT) is a protocol of quantum teleportation in which a receiver does not have to apply correction to the transmitted state. In this protocol two spatially separated parties can teleport an unknown quantum state only by exploiting joint measurements on number of shared $d-$dimensional maximally entangled states (resource state) together with a state to be teleported and one way classical communication. In this paper we analyse for the first time the recycling protocol for the deterministic PBT beyond the qubit case. In the recycling protocol the main idea is to re-use …
We analyse the problem of transmitting a number of unknown quantum states or one composite system in one go. We derive a lower bound on the performance of such process, measured in the entanglement fidelity. The obtained bound is effectively computable and outperforms the explicit values of the entanglement fidelity calculated for the pre-existing variants of the port-based protocols, allowing for teleportation of a much larger amount of quantum information. The comparison with the exact formulas and similar analysis for the probabilistic scheme is also discussed. In particular, we present the…
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 quanti…
Quantum computers promise dramatic speed ups for many computational tasks. For large-scale quantum computation however, the inevitable coupling of physical qubits to the noisy environment imposes a major challenge for a real-life implementation. A scheme introduced by Gottesmann and Chuang can help to overcome this difficulty by performing universal quantum gates in a fault-tolerant manner. Here, we report a non-trivial demonstration of this architecture by performing a teleportation-based two-qubit controlled-NOT gate through linear optics with a high-fidelity six-photon interferometer. The o…
Light is an irreplaceable means of communication among various quantum information processing and storage devices. Due to their different physical nature, some of these devices couple more strongly to discrete, and some to continuous degrees of freedom of a quantum optical wave. It is therefore desirable to develop a technological capability to interconvert quantum information encoded in these degrees of freedom. Here we generate and characterize an entangled state between a dual-rail (polarization-encoded) single-photon qubit and a qubit encoded as a superposition of opposite-amplitude cohere…
In our work we consider the following problem in the context of teleportation: an unknown pure state have to be teleported and there are two laboratories which can perform the task. One laboratory uses a pure non maximally entangled channel but has a capability of performing the joint measurement on bases with a constrained degree of entanglement; the other lab makes use of a mixed X-state channel but can perform a joint measurement on bases with higher entanglement degrees. We compare the average teleportation fidelity achieved in both cases, finding that the fidelity achieved with the X-stat…
In this work we consider a quantum network consisting of nodes and entangled states connecting the nodes. In evrey node there is a single player. The players at the intermediate nodes carry out measurements to produce an entangled state between the initial and final node. Here we address the problem that how much classical as well as quantum information can be sent from initial node to final node. In this context, we present strong theorems along with proosf, which state that how the teleportation capability of this remotely prepared state is linked up with the fidelities of teleportation of t…
In recent years, there has been heightened interest in quantum teleportation, which allows for the transfer of unknown quantum states over arbitrary distances. Quantum teleportation not only serves as an essential ingredient in long-distance quantum communication, but also provides enabling technologies for practical quantum computation. Of particular interest is the scheme proposed by Gottesman and Chuang [Nature \textbf{402}, 390 (1999)], showing that quantum gates can be implemented by teleporting qubits with the help of some special entangled states. Therefore, the construction of a quantu…
Quantum teleportation (QT) is a fundamentally remarkable communication protocol that also finds many important applications for quantum informatics. Given a quantum entangled resource, it is crucial to know to what extent one can accomplish the QT. This is usually assessed in terms of output fidelity, which can also be regarded as an operational measure of entanglement. In the case of multipartite communication when each communicator possesses a part of $N$-partite entangled state, not all pairs of communicators can achieve a high fidelity due to monogamy property of quantum entanglement. We h…
Near-term quantum computers can hold only a small number of qubits. One way to facilitate large-scale quantum computations is through a distributed network of quantum computers. In this work, we consider the problem of distributing quantum programs represented as quantum circuits across a quantum network of heterogeneous quantum computers, in a way that minimizes the overall communication cost required to execute the distributed circuit. We consider two ways of communicating: cat-entanglement that creates linked copies of qubits across pairs of computers, and teleportation. The heterogeneous c…
Teleportation is a crucial element in fault-tolerant quantum computation and a complete understanding of its capacity is very important for the practical implementation of optimal fault-tolerant architectures. It is known that stabilizer codes support a natural set of gates that can be more easily implemented by teleportation than any other gates. These gates belong to the so called $\mathcal{C}_k$ hierarchy introduced by Gottesman and Chuang (Nature \textbf{402}, 390). Moreover, a subset of $\mathcal{C}_k$ gates, called semi-Clifford operations, can be implemented by an even simpler architect…
Enhancing the teleportation fidelity of a quantum network using purification
Centre for Quantum Science and Technology, International Institute of Information Technology, Hyderabad（海得拉巴国际信息研究院量子科学与技术中心）；Department of Physics and Center of excellence in Quantum information, computation, science and technology, Indian Institute of Technology Bombay（孟买印度理工学院物理系及量子信息、计算、科学与技术卓越中心）；Center for Security, Theory and Algorithmic Research, International Institute of Information Technology, Hyderabad（海得拉巴国际信息研究院安全、理论与算法研究中心）
We show that the usefulness of a state as an activator in teleportation protocols is equivalent to the robustness of its entanglement to noise. The robustness of entanglement of a bi-partite state is linked to the maximum increase in the the fidelity of teleportation of any other state when the former is used as an extra resource. On the one hand, this connection gives an operational meaning to the robustness of entanglement. On the other hand, it shows that the activation capability - which has a central role as an operational way of quantifying bound entangled states - can be estimated exper…
