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:1207.2188 · Physical Review A

Quantum teleportation via maximum-confidence quantum measurements

Leonardo Neves, M. A. Solís-Prosser, A. Delgado, O. Jiménez

Published Jun 25, 2012• 21 citations
arXivHTMLPDF

Abstract

We investigate the problem of teleporting unknown qudit states via pure quantum channels with nonmaximal Schmidt rank. This process is mapped to the problem of discriminating among nonorthogonal symmetric states which are linearly dependent and equally likely. It is shown that by applying an optimized maximum-confidence (MC) measurement for accomplishing this task, one reaches the maximum possible teleportation fidelity after a conclusive event in the discrimination process, which in turn occurs with the maximum success probability. In this case, such fidelity depends only on the Schmidt rank of the channel and it is larger than the optimal one achieved, deterministically, by the standard teleportation protocol. Furthermore, we show that there are quantum channels for which it is possible to apply a $k$-stage sequential MC measurement in the discrimination process such that a conclusive event at any stage leads to a teleportation fidelity above the aforementioned optimal one and, consequently, increases the overall success probability of teleportation with a fidelity above this limit.

DOI
10.1103/physreva.85.062322

Related papers

Quantum teleportation via quantum channels with non-maximal Schmidt rank

M. A. Solís-Prosser, O. Jiménez, Leonardo Neves +1 more

We study the problem of teleporting unknown pure states of a single qudit via a pure quantum channel with non-maximal Schmidt rank. We relate this process to the discrimination of linearly dependent symmetric states with the help of the maximum-confidence discrimination strategy. We show that with a certain probability, it is possible to teleport with a fidelity larger than the fidelity optimal deterministic teleportation.

Physica Scripta•Mar 1, 2013•6 citations

Maximum-confidence discrimination among symmetric qudit states

O. Jiménez, M. A. Solís-Prosser, A. Delgado +1 more

We study the maximum-confidence (MC) measurement strategy for discriminating among nonorthogonal symmetric qudit states. Restricting to linearly dependent and equally likely pure states, we find the optimal positive operator valued measure (POVM) that maximizes our confidence in identifying each state in the set and minimizes the probability of obtaining inconclusive results. The physical realization of this POVM is completely determined and it is shown that after an inconclusive outcome, the input states may be mapped into a new set of equiprobable symmetric states, restricted, however, to a subspace of the original qudit Hilbert space. By applying the MC measurement again onto this new set, we can still gain some information about the input states, although with less confidence than before. This leads us to introduce the concept of sequential maximum-confidence (SMC) measurements, where the optimized MC strategy is iterated in as many stages as allowed by the input set, until no further information can be extracted from an inconclusive result. Within each stage of this measurement our confidence in identifying the input states is the highest possible, although it decreases from one stage to the next. In addition, the more stages we accomplish within the maximum allowed, the higher will be the probability of correct identification. We will discuss an explicit example of the optimal SMC measurement applied in the discrimination among four symmetric qutrit states and propose an optical network to implement it.

arXiv:1112.5322•Physical Review A•Dec 19, 2011•27 citations

Optimal conclusive teleportation of quantum states

Luis Roa, A. Delgado, Ivette Fuentes

Quantum teleportation of qudits is revisited. In particular, we analyze the case where the quantum channel corresponds to a nonmaximally entangled state and show that the success of the protocol is directly related to the problem of distinguishing nonorthogonal quantum states. The teleportation channel can be seen as a coherent superposition of two channels, one of them being a maximally entangled state, thus leading to perfect teleportation, and the other, corresponding to a nonmaximally entangled state living in a subspace of the d-dimensional Hilbert space. The second channel leads to a teleported state with reduced fidelity. We calculate the average fidelity of the process and show its optimality.

arXiv:quant-ph/0304002•Physical Review A•Aug 21, 2003•96 citations

Telecloning of qudits via partially entangled states

G. Araneda, Nataly Cisternas, Aldo Delgado

We study the process of quantum telecloning of d -dimensional pure quantum states using partially entangled pure states as quantum channel. This process efficiently mixes optimal universal symmetric cloning with quantum teleportation. It is shown that it is possible to implement universal symmetric telecloning in a probabilistic way using unambiguous state discrimination and quantum state separation schemes. It is also shown that other strategies, such as minimum error discrimination, lead to a decrease in the fidelity of the copies and that certain partially entangled pure states with maximal Schmidt rank lead to an average telecloning fidelity which is always above the optimal fidelity of measuring and preparation of quantum states. We also discuss the case of partially entangled pure states with non-maximal Schmidt rank. The results presented here are valid for arbitrary numbers of copies of a single-input qudit state of any dimension.

arXiv:1712.00624•Quantum Information Processing•May 21, 2016•8 citations

Symmetric $N \to M$ telecloning and remote quantum state inference

Adam G. Hawkins, Hannah McAleese, Hyukjoon Kwon

Teleporting unknown quantum states between distant nodes of a network is a significant feature of quantum communication. Few studies, however, have been conducted on $N \to M$ telecloning, in which $N$ copies of an unknown quantum state are optimally teleported to $M \geq N$ receivers. Previous work requires global POVMs on all copies and auxiliaries; here, we show that symmetric $N \to M$ telecloning can be probabilistically performed using only sequential (or parallel) Bell state measurements (BSMs), allowing the copies to be spatially separated. When successful, the fidelity of each receiver's reduced state saturates the bound imposed by the no-cloning theorem, with the probability of success being independent of $M$. In the case of an `unsuccessful' BSM, we show that the teleportation fidelity is likely to remain high, with the measurement outcome also providing information about the closest Pauli eigenbasis to the unknown state being telecloned. In this sense, each receiver can remotely infer the unknown quantum state with a level of confidence that scales with the number of copies, even if the fidelity of their own reduced state is sub-optimal. We additionally analyze the required resources to ensure the classical-communication fidelity bound is surpassed, both in terms of two-qubit inseparability and varying classes of multipartite entanglement. Surprisingly, we uncover that, at a given iteration of the protocol, pairwise entanglement is not always necessary to increase the teleportation fidelity and is never required to beat the classical bound for $N \geq 2$.

quant-pharXiv:2608.18223•Aug 20, 2026•0 citations

Sequential quantum maximum-confidence discrimination

Hanwool Lee, Kieran Flatt, Joonwoo Bae

Sequential quantum information processing may lie in the peaceful coexistence of no-go theorems on quantum operations, such as the no-cloning theorem, the monogamy of correlations, and the no-signalling principle. In this work, we investigate a sequential scenario of quantum state discrimination with maximum confidence, called maximum-confidence discrimination, which generalizes other strategies such as minimum-error and unambiguous discrimination. We show that sequential discrimination with equally high confidence can be realized if and only if positive-operator-valued measure elements for a maximum-confidence measurement can be unambiguously discriminated, i.e., linearly independent; otherwise, a party will have strictly less confidence in measurement outcomes than the previous one. We investigate the tradeoff between state disturbance and information gain in sequential state discrimination and show that the less guessing probability there is from conclusive outcomes for each party, the more parties can participate in the sequential scenario.

Physical Review A•Nov 6, 2025•5 citations
We investigate the problem of teleporting unknown qudit states via pure quantum channels with nonmaximal Schmidt rank. This process is mapped to the problem of discriminating among nonorthogonal symmetric states which are linearly dependent and equally likely. It is shown that by applying an optimized maximum-confidence (MC) measurement for accomplishing this task, one reaches the maximum possible teleportation fidelity after a conclusive event in the discrimination process, which in turn occurs with the maximum success probability. In this case, such fidelity depends only on the Schmidt rank of the channel and it is larger than the optimal one achieved, deterministically, by the standard teleportation protocol. Furthermore, we show that there are quantum channels for which it is possible to apply a kkk-stage sequential MC measurement in the discrimination process such that a conclusive event at any stage leads to a teleportation fidelity above the aforementioned optimal one and, consequently, increases the overall success probability of teleportation with a fidelity above this limit.
We study the maximum-confidence (MC) measurement strategy for discriminating among nonorthogonal symmetric qudit states. Restricting to linearly dependent and equally likely pure states, we find the optimal positive operator valued measure (POVM) that maximizes our confidence in identifying each state in the set and minimizes the probability of obtaining inconclusive results. The physical realization of this POVM is completely determined and it is shown that after an inconclusive outcome, the input states may be mapped into a new set of equiprobable symmetric states, restricted, however, to a subspace of the original qudit Hilbert space. By applying the MC measurement again onto this new set, we can still gain some information about the input states, although with less confidence than before. This leads us to introduce the concept of sequential maximum-confidence (SMC) measurements, where the optimized MC strategy is iterated in as many stages as allowed by the input set, until no further information can be extracted from an inconclusive result. Within each stage of this measurement our confidence in identifying the input states is the highest possible, although it decreases from one stage to the next. In addition, the more stages we accomplish within the maximum allowed, the higher will be the probability of correct identification. We will discuss an explicit example of the optimal SMC measurement applied in the discrimination among four symmetric qutrit states and propose an optical network to implement it.
Quantum teleportation of qudits is revisited. In particular, we analyze the case where the quantum channel corresponds to a nonmaximally entangled state and show that the success of the protocol is directly related to the problem of distinguishing nonorthogonal quantum states. The teleportation channel can be seen as a coherent superposition of two channels, one of them being a maximally entangled state, thus leading to perfect teleportation, and the other, corresponding to a nonmaximally entangled state living in a subspace of the d-dimensional Hilbert space. The second channel leads to a teleported state with reduced fidelity. We calculate the average fidelity of the process and show its optimality.
We study the process of quantum telecloning of d -dimensional pure quantum states using partially entangled pure states as quantum channel. This process efficiently mixes optimal universal symmetric cloning with quantum teleportation. It is shown that it is possible to implement universal symmetric telecloning in a probabilistic way using unambiguous state discrimination and quantum state separation schemes. It is also shown that other strategies, such as minimum error discrimination, lead to a decrease in the fidelity of the copies and that certain partially entangled pure states with maximal Schmidt rank lead to an average telecloning fidelity which is always above the optimal fidelity of measuring and preparation of quantum states. We also discuss the case of partially entangled pure states with non-maximal Schmidt rank. The results presented here are valid for arbitrary numbers of copies of a single-input qudit state of any dimension.
Symmetric N→MN \to MN→M telecloning and remote quantum state inference
Teleporting unknown quantum states between distant nodes of a network is a significant feature of quantum communication. Few studies, however, have been conducted on N→MN \to MN→M telecloning, in which NNN copies of an unknown quantum state are optimally teleported to M≥NM \geq NM≥N receivers. Previous work requires global POVMs on all copies and auxiliaries; here, we show that symmetric N→MN \to MN→M telecloning can be probabilistically performed using only sequential (or parallel) Bell state measurements (BSMs), allowing the copies to be spatially separated. When successful, the fidelity of each receiver's reduced state saturates the bound imposed by the no-cloning theorem, with the probability of success being independent of MMM. In the case of an `unsuccessful' BSM, we show that the teleportation fidelity is likely to remain high, with the measurement outcome also providing information about the closest Pauli eigenbasis to the unknown state being telecloned. In this sense, each receiver can remotely infer the unknown quantum state with a level of confidence that scales with the number of copies, even if the fidelity of their own reduced state is sub-optimal. We additionally analyze the required resources to ensure the classical-communication fidelity bound is surpassed, both in terms of two-qubit inseparability and varying classes of multipartite entanglement. Surprisingly, we uncover that, at a given iteration of the protocol, pairwise entanglement is not always necessary to increase the teleportation fidelity and is never required to beat the classical bound for N≥2N \geq 2N≥2.
Sequential quantum information processing may lie in the peaceful coexistence of no-go theorems on quantum operations, such as the no-cloning theorem, the monogamy of correlations, and the no-signalling principle. In this work, we investigate a sequential scenario of quantum state discrimination with maximum confidence, called maximum-confidence discrimination, which generalizes other strategies such as minimum-error and unambiguous discrimination. We show that sequential discrimination with equally high confidence can be realized if and only if positive-operator-valued measure elements for a maximum-confidence measurement can be unambiguously discriminated, i.e., linearly independent; otherwise, a party will have strictly less confidence in measurement outcomes than the previous one. We investigate the tradeoff between state disturbance and information gain in sequential state discrimination and show that the less guessing probability there is from conclusive outcomes for each party, the more parties can participate in the sequential scenario.