Quantum teleportation is a quintessential quantum communication protocol that enables the transmission of an arbitrary quantum state between two distant parties without physically transmitting the state with the help of shared entanglement and limited classical communication. We show that it is possible to relax the entanglement requirement in quantum teleportation if we have access to a certain strain of superposition of quantum processes. Two types of superposition of quantum processes are generally considered in the literature: superposition of paths identified with quantum maps and superposition of indefinite causal orders of the maps. We find that when superposition of paths is incorporated in the protocol, quantum teleportation with unit fidelity becomes possible with nonzero probability of 1/4 even when the two parties share certain classes of separable states, including pure product states. In contrast, the assistance of superposition of indefinite causal order of quantum maps in teleportation protocol does not enable any quantum advantage for shared pure product states. Furthermore, we show that separable Werner states can also yield quantum advantage in quantum teleportation assisted by the superposition of paths. Finally, we establish that the presence of quantum coherence in the control qubit is both necessary and sufficient to achieve quantum advantage in quantum teleportation assisted with superposition of paths. The results potentially uncover yet another role of quantum superposition, in general, in teleportation versus entanglement.
Quantum teleportation is a quintessential quantum communication protocol that enables the transmission of an arbitrary quantum state between two distant parties without physically transmitting the state with the help of shared entanglement and limited classical communication. We show that it is possible to relax the entanglement requirement in quantum teleportation if we have access to a certain strain of superposition of quantum processes. Two types of superposition of quantum processes are generally considered in the literature: superposition of paths identified with quantum maps and superposition of indefinite causal orders of the maps. We find that when superposition of paths is incorporated in the protocol, quantum teleportation with unit fidelity becomes possible with nonzero probability of 1/4 even when the two parties share certain classes of separable states, including pure product states. In contrast, the assistance of superposition of indefinite causal order of quantum maps in teleportation protocol does not enable any quantum advantage for shared pure product states. Furthermore, we show that separable Werner states can also yield quantum advantage in quantum teleportation assisted by the superposition of paths. Finally, we establish that the presence of quantum coherence in the control qubit is both necessary and sufficient to achieve quantum advantage in quantum teleportation assisted with superposition of paths. The results potentially uncover yet another role of quantum superposition, in general, in teleportation versus entanglement.
Abstract The superposition principle provides us the opportunity to unfold many surprising facts. One such fact leads to the generation of entanglement which may allow one to teleport an unknown quantum state from one location to another. We try to understand the role of superposition in the process of quantum teleportation, as a question of potentially fundamental importance. We consider, within the scenario of quantum teleportation, a set-up where the sender and the receiver are in a superposed situation of using a maximally entangled state and not using any entangled state in the teleportation protocol, controlled by a qubit. We address two distinct protocols: in the first case, the sender and the receiver do nothing when they do not have the authority to use entanglement, while in the second case, they still use classical communication even if they do not use entanglement. After accomplishing the protocols, we operate a Hadamard gate on the control qubit, measure the control qubit’s state, and consider the outcome corresponding to a particular state of the control. We compare the protocol’s fidelity with the maximum fidelity achievable through classical resources only. In particular, we provide conditions to achieve nonclassical fidelity in teleportation, in the presence of the control qubit. To explore if there is any quantum advantage (advantage of superposition present in the control qubit), we compare the fidelities of the control qubit-based protocols with the fidelity achieved in a situation where the two parties are in a classical mixture of using and not using the maximally entangled state. We observe that there exists a wide range of parameters defining the initial state of the control qubit for which our protocols provide quantum advantage. To analyse the role of superposition quantitatively, we discuss whether the amount of quantum advantage can be expressed in terms of quantum coherence present in the state of the control qubit.
We investigate whether it is possible to teleport the coherence of an unknown quantum state from Alice to Bob by communicating a lesser number of classical bits in comparison to what is required for teleporting an unknown quantum state. We find that we cannot achieve perfect teleportation of coherence with one bit of classical communication for an arbitrary qubit. However, we find that if the qubit is partially known, i.e., chosen from the equatorial and polar circles of the Bloch sphere, then teleportation of coherence is possible with the transfer of one cbit of information when we have maximally entangled states as a shared resource. In the case of the resource being a non-maximally entangled state, we can teleport the coherence with a certain probability of success. In a general teleportation protocol for coherence, we derive a compact formula for the final state at Bob's lab in terms of the composition of the completely positive maps corresponding to the shared resource state and joint POVM performed by Alice on her qubit and the unknown state. Using this formula, we show that teleportation of the coherence of a partially known state with real matrix elements is possible perfectly with the help of a maximally entangled state as a resource. Furthermore, we explore the teleportation of coherence with the Werner states and show that even when the Werner states become separable, the amount of teleported coherence is non-zero, implying the possibility of teleportation of coherence without entanglement.
We investigate whether it is possible to teleport the coherence of an unknown quantum state from Alice to Bob by communicating a smaller number of classical bits in comparison to what is required for teleporting an unknown quantum state. We find that we cannot achieve perfect teleportation of coherence with one bit of classical communication for an arbitrary qubit. However, we find that if the qubit is partially known, i.e., chosen from the equatorial and polar circles of the Bloch sphere, then teleportation of coherence is possible with the transfer of one cbit of information when we have maximally entangled states as a shared resource. In the case of the resource being a nonmaximally entangled state, we can teleport the coherence with a certain probability of success. In a general teleportation protocol for coherence, we derive a compact formula for the final state at Bob's laboratory in terms of the composition of the completely positive maps corresponding to the shared resource state and a joint positive operator-valued measure (POVM) performed by Alice on her qubit and the unknown state. Using this formula, we show that teleportation of the coherence of a partially known state with real matrix elements is perfectly possible with the help of a maximally entangled state as a resource. Furthermore, we explore the teleportation of coherence with Werner states and show that even when Werner states become separable, the amount of teleported coherence is nonzero, implying the possibility of teleportation of coherence without entanglement.
Teleporting an unknown qubit state is a paradigmatic quantum information processing task revealing the advantage of quantum communication protocols over their classical counterpart. For a teleportation protocol using a Bell state as quantum channel, the resource has been identified to be the concurrence. However, for mixed multipartite states the lack of computable entanglement measures has made the identification of the quantum resource responsible for this advantage more challenging. Here, by building on previous results showing that localizable concurrence is the necessary resource for controlled quantum teleportation, we show that any teleportation protocol using an arbitrary multipartite state, that includes a Bell measurement, requires a nonvanishing localizable concurrence between two of its parties to perform better than the classical protocol. By first analyzing Greenberger–Horne–Zeilinger (GHZ) channel and GHZ measurement teleportation protocol, in the presence of GHZ-symmetric-preserving noise, we compare different multipartite entanglement measures with the fidelity of teleportation, and we find that the protocol performs better than the classical protocol when all multipartite entanglement measures vanish, except for the localizable concurrence. Finally, we extend our proof to an arbitrary teleportation protocol with an arbitrary multipartite entangled channel.
Abstract We show that the fidelity offered by the standard teleportation protocol under noisy channels applied successively can be significantly improved, when used in conjunction with a quantum switch. In particular, we find that for two such teleportation channels conjugated with an indefinite causal order, teleportation fidelity beyond the classical threshold is achieved for significantly larger noise than would be possible conventionally. One can even make the effective teleportation channel perfectly faithful for very large noise. We also discuss the generalization of our scheme for more than two pathways, and define a figure of merit in that context.
Quantum gate teleportation enables distant parties to implement nonlocal quantum operations without physically transferring the participating qubits, making it a promising primitive for distributed quantum computing. We introduce a general framework for deterministic quantum gate teleportation based on path superposition, in which the target nonlocal operation is specified through the phase of a preshared maximally entangled resource and a suitable family of path-dependent local unitary operators. The framework establishes general design conditions that guarantee deterministic teleportation after measurement of the control qubits and the application of local correction operations. As representative realizations, we construct teleportation protocols for controlled-NOT (CNOT) and controlled-Z (CZ) gates, demonstrating that different nonlocal operations can be implemented within the same protocol architecture through appropriate choices of the design parameters. We further outline a proof-of-concept photonic realization based on spatial-path and polarization degrees of freedom. The proposed framework identifies path superposition as a versatile resource for quantum gate teleportation and distributed quantum information processing.