Pith. sign in

REVIEW 3 major objections 3 minor 29 references

Port-based telecloning of an unknown quantum state

T0 review · 3 major / 3 minor · reviewed 2026-08-10 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Port-based telecloning—receivers keep or discard a port, no corrections—attains the optimal universal cloning fidelity as the number of ports grows.

desk verdict New protocol and POVM construction, but the PGM is never shown to be a complete POVM, so the main asymptotic and finite-N claims rest on a trace-decreasing map. read the letter →

arxiv 2501.16878 v2 pith:CNIQEILX submitted 2025-01-28 quant-ph

Reiji Okada , Kohtaro Kato , Francesco Buscemi This is my paper · ORCID
classification quant-ph MSC 81P4581P50
keywords port-basedtelecloningteleportationuniversalquantumcloningprettygoodmeasurementsymmetricsubspaceentanglementfidelityno-cloningtheoremWernermap
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Telecloning distributes approximate copies of an unknown quantum state to many receivers, but every existing version requires the receivers to apply corrective unitaries announced by the sender. This paper introduces port-based telecloning (PBTC), in which Alice shares $N$ maximally entangled port pairs, performs one measurement, and announces a subset of $M$ ports; the chosen receivers simply keep their ports. The main result (Theorem 1) is that the average single-clone fidelity of this protocol satisfies $\lim_{N\to\infty} f(R\circ D^{\mathrm{std}}_{N,M}) = \frac{d+2M-1}{M(d+1)}$, exactly the fidelity of the optimal universal $1\to M$ cloning map. Making the receivers passive therefore costs nothing in the many-port limit. A numerical comparison for $d=2$, $M=2$ shows the new protocol strictly beats the naive clone-and-multi-port-teleport strategy for $N=2,\dots,6$, and the authors conjecture the gap persists for all finite $N$.

What carries the argument

The load-bearing construction is a partially symmetrized ensemble: for each $M$-element port subset $I$, the paper forms $\eta^I_{XA^N} = \frac{d^M}{d[M]}\,\Pi_{A_I}\,\rho^{i_1}_{XA^N}\,\Pi_{A_I}$, where $\rho^{i_1}_{XA^N}$ is the state underlying the optimal PBT measurement and $\Pi_{A_I}$ projects onto the symmetric subspace of the chosen ports (Definition 2). Standard PBTC is defined as the PGM for the uniform ensemble of these states, and Proposition 1 shows each PGM element is supported inside the symmetrized subspace, which lets Lemma 2 convert the channel's entanglement fidelity into a success probability for discriminating the states $\rho^{i_1}$. The asymptotic argument then chains the PGM success bound (Lemma 3), the average rank $d[M-1]d^{N-M}$ (Proposition 2), and trace estimates (Lemmas 4–7) proving $d^{N+1}\mathrm{Tr}[\bar{\eta}^2]\to 1$ (Proposition 3), forcing the fidelity up to the optimal-cloning value that the optimal universal cloning map supplies as the matching upper bound.

What would settle it

Compute the operator sum of the standard PBTC PGM for a small explicit case ($d=2$, $M=2$, $N=2$): if $\sum_I E^I \neq \mathbb{1}$, the channel (14) is trace-decreasing as defined and the claimed deterministic fidelity requires the explicitly missing completion. Independently, evaluate $f(R\circ D^{\mathrm{std}}_{N,M})$ for $d=2$, $M=2$ at $N>6$ to test whether the strict advantage over clone-and-MPBT reported in Fig. 2 persists beyond the computed range.

Watch

Extended reading notes

Core claim

The central claim is Theorem 1: for the standard PBTC channel $D^{\mathrm{std}}_{N,M}$, built from $N$ maximally entangled port pairs and the pretty good measurement (PGM) for a partially symmetrized ensemble, $\lim_{N\to\infty} f(R\circ D^{\mathrm{std}}_{N,M}) = \frac{d+2M-1}{M(d+1)}$. The right-hand side is the fidelity of the optimal universal $1\to M$ cloning map, so in the many-port limit port-based, correction-free telecloning loses no fidelity relative to optimal cloning itself. The proof bounds the protocol's entanglement fidelity from below by a state-discrimination success probability, evaluates the ensemble's average rank and the second moment of its average state, and shows the bound tightens to the optimal-cloning value as $N$ grows; the converse inequality holds because no symmetric cloning protocol can exceed that fidelity. As a second result, numerical evaluation reported in Fig. 2 shows that for $d=2$, $M=2$, the standard PBTC single-clone fidelity is strictly higher than that of the clone-and-MPBT protocol for $2\le N\le 6$.

Load-bearing premise

The argument assumes the partially symmetrized measurement is a valid deterministic measurement on the whole Hilbert space, yet the paper never states how the standard PBTC POVM is completed to sum to the identity; at $N=M$ the uncompleted PGM is only a projector, so the channel in Eq. (14) is trace-decreasing as written.

Editorial extensions

If this is right

  • Receivers become fully passive: after Alice announces the chosen port subset, each receiver's only action is keeping or discarding a port, so PBTC operates where corrective feedforward is unavailable or undesirable.
  • In the many-port limit the protocol reaches the fidelity of optimal universal $1\to M$ cloning, so correction-free delivery imposes no asymptotic fidelity penalty.
  • Joint cloning-and-port-teleporting strictly outperforms the sequential clone-and-MPBT strategy for small port numbers (numerically for $d=2$, $M=2$, $N=2,\dots,6$).
  • The channel $R\circ D^{\mathrm{std}}_{N,M}$ converges in fidelity to the optimal universal cloning map, so asymptotically PBTC implements optimal cloning as a distributed, feedforward-free operation.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A testable extension: evaluate the operator sum $\sum_{I\in I^M_N} E^I$ of the standard PBTC PGM at finite $N$ (especially $N=M$), because the paper does not state how the correction term (6) completes it to a proper deterministic POVM.
  • The same partial-symmetrization recipe should extend to $K\to M$ cloning and asymmetric cloning tasks, since only the symmetrizer $\Pi_{A_I}$ and the dimension factor $d[M]$ depend on the chosen variant.
  • Optimizing the shared resource state, which upgrades PBT fidelity from $1-O(1/N)$ to $1-\Theta(N^{-2})$, may accelerate convergence to the optimal-cloning bound in PBTC as well; the fidelity-as-discrimination-success machinery here gives a concrete starting point for that optimization.
  • If the conjectured finite-$N$ gap over clone-and-MPBT is real for all port numbers, it would establish a genuine advantage of joint over sequential cloning-and-teleporting at every scale of resources, relevant to one-way communication settings where passivity is at a premium.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 3 minor

Summary. The paper introduces port-based telecloning (PBTC), a protocol that distributes M approximate clones of an unknown qudit state to receivers using port-based teleportation. For maximally entangled resource states, the authors define 'standard PBTC' via the pretty good measurement (PGM) for a partially symmetrized ensemble, prove in Theorem 1 that the asymptotic single-clone fidelity equals the optimal universal 1-to-M cloning fidelity (d+2M-1)/(M(d+1)), and provide numerical evidence that standard PBTC outperforms a clone-and-MPBT benchmark for d=2, M=2, and N=2..6.

Significance. If the technical gaps are fixed, the result is a natural port-based analogue of telecloning that is asymptotically optimal and correction-free, giving a genuinely new protocol rather than a repackaging of known results. The proof is largely self-contained and uses external benchmarks (Werner's optimal cloning bound, Beigi-Koenig PGM bound) without any fitted parameters, which is a strength. The finite-N numerical advantage over clone-and-MPBT is interesting, but it currently hinges on an incomplete POVM comparison. Two load-bearing issues—an incomplete POVM for standard PBTC and an algebraic error in Eq. (64)—prevent the paper as written from establishing the stated claims.

major comments (3)
  1. [Section III B, Definition 2 and Eq. (14)] The PGM defined in Eq. (5) for the ensemble with elements eta^I sums to the projector onto the support of the average state, not to the identity on the full Hilbert space; for N=M it is a proper subspace projector. The paper does not include the completion Delta of Eq. (6) for standard PBTC, although it explicitly does so for the clone-and-MPBT protocol. Consequently the map D^std in Eq. (14) is trace-decreasing rather than a deterministic quantum channel. Corollary 2 and the proof of Theorem 1 therefore compute the fidelity of a trace-decreasing map, for which the relation (4) and the deterministic-cloning upper bound (12) are not applicable. The proof must either incorporate Delta into the standard PBTC POVM and recompute the fidelity, or prove that the completion term is exactly zero or vanishes as N goes to infinity.
  2. [Section III C, Eq. (64)] The algebraic simplification in Eq. (64) is incorrect. Using d[k] = binom(d+k-1,k), one has d[M]/d[M-1] = (d+M-1)/M, and the denominator contains d^{M+2} d^{N-M} = d^{N+2}. The resulting lower bound is F >= (d+M-1)/(M d^{N+2} Tr[bar-eta^2]), not F >= (d+M-1) d^{-M} (d^{N+1} Tr[bar-eta^2])^{-1}; the two agree only when M = d^{M-1}. Consequently Eq. (65) should state liminf F >= (d+M-1)/(M d), which is exactly the optimal entanglement fidelity, whereas the printed (d+M-1)/d^M is too weak for general d and M and does not imply Eq. (66). This is a local algebraic error, but as written the proof of the lower bound is invalid.
  3. [Fig. 2 and Section III B] The numerical comparison in Fig. 2 evaluates standard PBTC without the completion Delta, while clone-and-MPBT is explicitly completed to a proper POVM. The reported finite-N advantage of standard PBTC may therefore be an artifact of applying a trace-decreasing map that discards the unnormalized failure outcomes. The comparison should be repeated using a valid POVM for standard PBTC, for example after adding Delta, or by reporting the success probability together with the normalized conditional fidelity.
minor comments (3)
  1. [Section III C, proof of Proposition 3] The line asserting lim |d^{N+1} Tr[bar-eta^2] - 1| = 0 uses only an upper bound; a matching lower bound (for example from Tr[bar-eta^2] >= 1/rank(bar-eta) >= 1/d^{N+1}) should be stated explicitly.
  2. [Lemma 4] The proof ends with 'the proposition is proved' although the statement is a lemma; please correct this wording.
  3. [Eq. (17)] The POVM element notation in Eq. (17) is slightly compressed: the adjoint C dagger and the reordering from ordered tuples J to unordered subsets I should be described in one more sentence to avoid confusion.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: Theorem 1 is an external-benchmark-matched lower-bound proof, with no fitted parameters or load-bearing self-citations.

full rationale

The central claim, Theorem 1, is not circular. Standard PBTC is defined through the PGM for a specific ensemble (Definition 2 and Section III B), and the proof derives a lower bound on its single-clone fidelity via Corollary 2, Lemma 3, and the asymptotic estimate in Proposition 3. The target value (d+2M-1)/(M(d+1)) is not an input to any fit; it is supplied as an external upper bound from Werner's independent optimal-cloning result (Eq. (12), Ref. [23]). The PBT ingredients used, Lemma 2 and Lemma 3, are cited from prior work by other authors (Refs. [4,6]), not from the present authors, and they are used as mathematical tools rather than as disguised restatements of the conclusion. The finite-N numerical comparison in Fig. 2 is a direct evaluation of the two defined fidelity expressions, not a fitted parameter renamed as a prediction. The only caveat worth recording is a technical completeness gap, not a circularity: the PGM defined in Eq. (5) sums to the projector onto the support of the average state, and the paper explicitly adds the correction Delta of Eq. (6) only for the clone-and-MPBT protocol, not for standard PBTC. If the standard PBTC POVM is not completed, the channel in Eq. (14) is trace-decreasing and the fidelity comparison may need extra justification. That is a correctness/technical issue and does not make the derivation circular.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

No free parameters are fitted; the only inputs are the dimension d, port number N, clone number M, and maximally entangled resource states. The claims rest on standard results: optimal cloning fidelity (Werner, Keyl-Werner), the PGM success bound (Beigi-König), and the PBT fidelity formula (Ishizaka-Hiroshima, Beigi-König). One nonstandard assumption is implicit: the PGM for the partially symmetrized ensemble is a valid POVM for a deterministic protocol, which is not proved and is questionable at N=M.

assumptions (5)
  • domain assumption The optimal 1→M cloning fidelity is (d+2M-1)/(M(d+1)) and no protocol can exceed it (Werner 1998; Keyl-Werner 1999).
    Assumed as the upper bound in the proof of Theorem 1 (Eq. 12, Section II B).
  • standard math The PGM success probability lower bound p_succ ≥ 1/(N r̄ Tr[σ̄²]) (Lemma 3, cited from Beigi-König).
    Used to lower-bound the entanglement fidelity in Theorem 1 (Eq. 64).
  • standard math The entanglement fidelity of a PBT channel equals (1/d²) Σ Tr[E^i ρ^i] (Lemma 2, cited from Ishizaka-Hiroshima and Beigi-König).
    Basis for Corollary 2 and the fidelity calculation.
  • ad hoc to paper The PGM for the ensemble in Definition 2 can be completed to a valid POVM on the full Hilbert space, or already sums to identity.
    The paper does not specify the completion for standard PBTC; for N=M the PGM without correction is not a POVM, so the deterministic nature of the protocol is an unproven assumption.
  • domain assumption For N>M, the support of the average η̄ spans the full Hilbert space, so the PGM sums to identity (implicit).
    Needed to make standard PBTC a deterministic channel without correction; not stated or proved.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Port-based telecloning of an unknown quantum state." pith.science (2026). https://pith.science/paper/CNIQEILX

@misc{pith2026250116878,
  author       = {Pith},
  title        = {Pith review of: Port-based telecloning of an unknown quantum state},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/CNIQEILX}},
  note         = {Machine review of arXiv:2501.16878}
}
read the original abstract

Telecloning is a protocol introduced by Murao et al. [Phys. Rev. A 59, 156 (1999)] to distribute copies of an unknown quantum state to many receivers in a way that beats the trivial ``clone-and-teleport'' protocol. In the last decade, a new type of teleportation called port-based teleportation, in which the receiver can recover the state without having to actively perform correction operations, but simply by looking at the correct port, has been widely studied. In this paper, we consider the analog of telecloning, where conventional teleportation is replaced by the port-based variant. To achieve this, we generalize the optimal measurement used in port-based teleportation and develop a new one that achieves port-based telecloning. Numerical results show that, in certain cases, the proposed protocol is strictly better than the trivial clone-and-teleport approach.

Figures

Figures reproduced from arXiv: 2501.16878 by the authors.

Figure 1
Figure 1. FIG. 1. (a) The setting of port-based teleportation (PBT). [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. FIG. 2. The fidelity of the PBTC protocol proposed here [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

29 extracted references · 23 canonical work pages

  1. [1]

    Extreme Universe

    δki1 1 ,lτ −1(j1 1 ) cσ 1Y p=2 δki1p ,kσ−1(i1p) cτ 1Y q=2 δlj1q ,lτ −1(j1q)   ×   l(σ)Y m=2 cσ mY n=1 δkimn ,kσ−1(imn )     l(τ )Y s=2 cτ sY t=1 δljs t ,lτ −1 (js t )   . (49) When cσ 1 = 1 or cτ 1 = 1, Qcσ 1 p=2 δki1p ,kσ−1(i1p) or Qcτ 1 q=2 δlj1q ,lτ −1(j1q) in (49) is disregarded, respectively. The right-hand side of (49) corresponds to cycle...

    work page

  2. [2]

    C. H. Bennett, G. Brassard, C. Cr´ epeau, R. Jozsa, A. Peres, and W. K. Wootters, Teleporting an unknown quantum state via dual classical and einstein-podolsky- rosen channels, Physical review letters 70, 1895 (1993)

    work page 1993

  3. [3]

    H. J. Briegel, W. D¨ ur, J. I. Cirac, and P. Zoller, Quantum repeaters: the role of imperfect local operations in quan- 10 tum communication, Physical Review Letters 81, 5932 (1998)

    work page 1998

  4. [4]

    Ishizaka and T

    S. Ishizaka and T. Hiroshima, Asymptotic teleportation scheme as a universal programmable quantum processor, Physical review letters 101, 240501 (2008)

    work page 2008

  5. [5]

    Ishizaka and T

    S. Ishizaka and T. Hiroshima, Quantum teleportation scheme by selecting one of multiple output ports, Phys- ical Review A—Atomic, Molecular, and Optical Physics 79, 042306 (2009)

    work page 2009

  6. [6]

    M. A. Nielsen and I. L. Chuang, Programmable quantum gate arrays, Physical Review Letters 79, 321 (1997)

    work page 1997

  7. [7]

    Beigi and R

    S. Beigi and R. K¨ onig, Simplified instantaneous non-local quantum computation with applications to position- based cryptography, New Journal of Physics 13, 093036 (2011)

    work page 2011

  8. [8]

    Buhrman, L

    H. Buhrman, L. Czekaj, A. Grudka, M. Horodecki, P. Horodecki, M. Markiewicz, F. Speelman, and S. Strelchuk, Quantum communication complexity ad- vantage implies violation of a bell inequality, Proceedings of the National Academy of Sciences 113, 3191 (2016)

    work page 2016

Show all 29 references
  1. [9]

    Wang and S

    Z.-W. Wang and S. L. Braunstein, Higher-dimensional performance of port-based teleportation, Scientific Re- ports 6, 33004 (2016)

    2016

  2. [10]

    Studzi´ nski, S

    M. Studzi´ nski, S. Strelchuk, M. Mozrzymas, and M. Horodecki, Port-based teleportation in arbitrary di- mension, Scientific reports 7, 10871 (2017)

    2017

  3. [11]

    Mozrzymas, M

    M. Mozrzymas, M. Studzi´ nski, S. Strelchuk, and M. Horodecki, Optimal port-based teleportation, New Journal of Physics 20, 053006 (2018)

    2018

  4. [12]

    Christandl, F

    M. Christandl, F. Leditzky, C. Majenz, G. Smith, F. Speelman, and M. Walter, Asymptotic performance of port-based teleportation, Communications in Mathe- matical Physics 381, 379 (2021)

    2021

  5. [13]

    Leditzky, Optimality of the pretty good measurement for port-based teleportation, Letters in Mathematical Physics 112, 98 (2022)

    F. Leditzky, Optimality of the pretty good measurement for port-based teleportation, Letters in Mathematical Physics 112, 98 (2022)

    2022

  6. [14]

    J. Fei, S. Timmerman, and P. Hayden, Efficient quantum algorithm for port-based teleportation, arXiv preprint arXiv:2310.01637 (2023)

    2023 arXiv

  7. [15]

    Grinko, A

    D. Grinko, A. Burchardt, and M. Ozols, Gelfand- tsetlin basis for partially transposed permutations, with applications to quantum information, arXiv preprint arXiv:2310.02252 (2023)

    2023 arXiv

  8. [16]

    Grinko, A

    D. Grinko, A. Burchardt, and M. Ozols, Efficient quan- tum circuits for port-based teleportation, arXiv preprint arXiv:2312.03188 (2023)

    2023 arXiv

  9. [17]

    Wills, M.-H

    A. Wills, M.-H. Hsieh, and S. Strelchuk, Efficient algo- rithms for all port-based teleportation protocols, PRX Quantum 5, 030354 (2024)

    2024

  10. [18]

    Murao, D

    M. Murao, D. Jonathan, M. B. Plenio, and V. Ve- dral, Quantum telecloning and multiparticle entangle- ment, Physical Review A 59, 156 (1999)

    1999

  11. [19]

    Murao, M

    M. Murao, M. B. Plenio, and V. Vedral, Quantum- information distribution via entanglement, Physical Re- view A 61, 032311 (2000)

    2000

  12. [20]

    J. L. Park, The concept of transition in quantum me- chanics, Foundations of Physics 1, 23 (1970)

    1970

  13. [21]

    W. K. Wootters and W. H. Zurek, A single quantum cannot be cloned, Nature 299, 802 (1982)

    1982

  14. [22]

    Dieks, Communication by epr devices, Physics Letters A 92, 271 (1982)

    D. Dieks, Communication by epr devices, Physics Letters A 92, 271 (1982)

    1982

  15. [23]

    Buˇ zek and M

    V. Buˇ zek and M. Hillery, Quantum copying: Beyond the no-cloning theorem, Phys. Rev. A 54, 1844 (1996)

    1996

  16. [24]

    R. F. Werner, Optimal cloning of pure states, Physical Review A 58, 1827 (1998)

    1998

  17. [25]

    Horodecki, P

    M. Horodecki, P. Horodecki, and R. Horodecki, General teleportation channel, singlet fraction, and quasidistilla- tion, Physical Review A 60, 1888 (1999)

    1999

  18. [26]

    V. P. Belavkin, Optimal multiple quantum statistical hy- pothesis testing, Stochastics 1, 315 (1975)

    1975

  19. [27]

    Hausladen and W

    P. Hausladen and W. K. Wootters, A ‘pretty good’measurement for distinguishing quantum states, Journal of Modern Optics 41, 2385 (1994)

    1994

  20. [28]

    Keyl and R

    M. Keyl and R. F. Werner, Optimal cloning of pure states, testing single clones, Journal of Mathematical Physics 40, 3283 (1999)

    1999

  21. [29]

    Studzi´ nski, M

    M. Studzi´ nski, M. Mozrzymas, P. Kopszak, and M. Horodecki, Efficient multi port-based teleportation schemes, IEEE Transactions on Information Theory 68, 7892 (2022). 11 Appendix A: Detailed derivation of Equation(47) In this appendix, we give a detailed derivation of Eq. (47...

    2022

Pith tools

Reviewed August 10, 2026 · model on record in the stance chip above.