Pith. sign in

REVIEW 5 minor 34 references

Quantum state rotation: Circularly transferring quantum states of multiple users

T0 review · 0 major / 5 minor · reviewed 2026-08-27 · deepseek-v4-flash

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

Pith's one-line read For every M≥6 there is an environment-free pure state whose quantum state rotation cannot be done at zero total entanglement cost, unlike two-party state exchange.

desk verdict Solid M-user generalization of QSE with a real M≥6 separation; Proposition 16 is terse but sound. read the letter →

arxiv 2009.11539 v3 pith:KSDBRJR3 submitted 2020-09-24 quant-ph

Yonghae Lee , Hayata Yamasaki , Soojoon Lee This is my paper · ORCID
classification quant-ph PACS 03.67.Hk89.70.Cf03.67.Mn
keywords quantumstaterotationexchangeoptimalentanglementcostLOCCmultipartiteGHZstatesdistillationasymptoticcommunication
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

The paper introduces quantum state rotation (QSR), the M-user analogue of two-party quantum state exchange, in which each user's part of an initial state moves one step around a circle via entanglement-assisted local operations and classical communication. It defines the optimal entanglement cost of the task and provides lower and upper bounds on that cost. The central result is a multipartite separation: for every M at least 6, there exists a pure state with no environment system for which zero total entanglement rate is impossible, although every two-user state without an environment can be exchanged for free. This shows that multi-user rotation has an intrinsic entanglement requirement that two-user exchange lacks.

What carries the argument

The load-bearing object is the segment entanglement rate e_{i,j}(ψ,{R_n}) = lim_{n→∞}(1/n)(log d_{B_{i,j}} − log d_{C_{i,j}}), the asymptotic net entanglement consumed between users i and j, with total rate the sum over all pairs. The zero-total-rate condition forces these rates to satisfy the linear equations l_P(ψ) = sum over cut pairs e_{i,j} for every subset P, and Theorem 13 solves this system uniquely in terms of entropy differences. The second load-bearing tool is Lemma 17, which rules out catalytic LOCC conversion of two three-party GHZ states into three ebits at zero segment rates; its proof uses the relative entropy of entanglement as an LOCC monotone between two of the users.

What would settle it

Exhibit an explicit asymptotic LOCC protocol that, with vanishing error, transforms two GHZ states shared by three users into three ebits while consuming and producing equal entanglement for every pair; that would overturn Lemma 17 and with it Proposition 16. Equivalently, find a QSR protocol for the six-user state φ5 defined in Eq. (52) whose total entanglement rate is 0.

Watch

Extended reading notes

Core claim

The paper's central claim is Proposition 16: for each M≥6 there exists an M-partite pure state |ψ⟩_A with no environment whose QSR task cannot be performed at zero total entanglement rate. The witness is φ5, built from two GHZ states shared by users 1, 3, and 5, together with arbitrary pure states for the other users. Assuming a zero-total-rate protocol existed, the paper's Theorem 13 fixes the segment entanglement rates: +1 between each pair among users {2,4,6}, −1 between each pair among {1,3,5}, and 0 otherwise. The paper argues these rates could be rearranged into a catalytic LOCC protocol that asymptotically converts two GHZ states into three ebits with zero per-pair entanglement rate, contradicting Lemma 17. Hence the achievable total entanglement rate for φ5 must be positive.

Load-bearing premise

The proof's pivotal step assumes that the positive and negative per-pair entanglement rates of a hypothetical zero-total-rate rotation protocol can be exactly cancelled by adding three ebits to the input and three to the output, producing a per-pair catalytic LOCC transformation from two GHZ states to three ebits.

Editorial extensions

If this is right

  • For any multiparty communication task built on circular transfers, entanglement is not automatically free even when the initial state is pure and has no environment.
  • The witness state φ5 gives a concrete environment-free state for which the optimal entanglement cost is provably positive, with segment rates computable from von Neumann entropies.
  • Whenever a zero-total-rate rotation protocol exists, Theorem 13 fixes the per-pair entanglement flow uniquely, so all zero-cost strategies have the same resource-allocation pattern.
  • Quantum state permutation tasks that decompose into cycles inherit this cost structure: a cycle of length at least 6 can force positive entanglement cost.
  • In distributed quantum computing or quantum networks with more than two parties, routing a state around a cycle may require nonzero entanglement even when all shared states are pure and no environment is present.

Reading between the lines

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

  • The paper leaves M=3,4,5 open; a natural next test is whether other environment-free witnesses, beyond the two-GHZ construction, can force positive entanglement cost for those cases.
  • The complete entanglement allocation is essential to the zero-cost examples: the same initial state can have zero optimal cost under all-pair resources but strictly positive cost under cycle-only resources, suggesting that resource-graph topology is part of the cost question.
  • Lemma 17's relative-entropy argument could likely be turned into a quantitative lower bound on the per-pair entanglement rate needed to convert GHZ states to ebits, not just an impossibility statement.
  • If zero-total-rate rotation is interpreted as catalytic rotation, Theorem 13 identifies which states admit a catalytic rotation and prescribes the unique catalytic resource flow, which may inform routing in entanglement-limited networks.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Request a human review

A listed scientist reviews the paper for a fee and the review publishes here regardless of verdict. See the reviewers or get listed.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

0 major / 5 minor

Summary. The paper introduces the asymptotic quantum state rotation (QSR) task for M users, in which each user's part of a shared pure state is circularly transferred to the next user by LOCC under a complete entanglement allocation. The main results are: a lower bound on the optimal entanglement cost (OEC) in terms of the maximum over partitions of entropic quantities; an achievable upper bound via a merge-and-send strategy; a necessary condition for zero total entanglement rate that determines all segment rates as the unique solution of a linear system (Theorem 13); a sufficient condition for positive OEC based on conditional entropies (Theorem 11); and a separation from two-user quantum state exchange: for every M ≥ 6 there exists an environment-free state for which no zero total entanglement rate is achievable (Proposition 16). Detailed proofs are given in Appendices A through F.

Significance. The QSR task is a natural multipartite generalization of quantum state exchange, and the separation result for M ≥ 6 is an interesting and non-obvious finding. The proofs are detailed and rely on standard tools such as state merging, Schumacher compression, and the relative entropy of entanglement; no fitted parameters appear anywhere in the derivations. The explicit inversion of the segment-rate linear system in Theorem 13 is a useful technical contribution in its own right. The paper honestly acknowledges the open cases M = 3, 4, 5 and the need for tighter lower bounds. If the main result stands, it establishes an intrinsic difference between two-user and multi-user state transfer that goes beyond a trivial composition of two-user protocols.

minor comments (5)
  1. [Abstract and Introduction] The abstract and the first paragraph of the introduction state that the difference between QSR and QSE is shown for 'three or more users,' but Proposition 16 is proved only for M ≥ 6, while the cases M = 3, 4, 5 are left open in Section VI. Please adjust the wording to say 'six or more users' or otherwise clarify that the proven separation is for M ≥ 6.
  2. [Section VI, proof of Proposition 16] The passage from the zero-total-rate QSR sequence to a catalytic TU protocol with zero segment rates for every pair is stated tersely. The bookkeeping is sound: for the pairs (1,3), (3,5), (5,1) with rate -1, one extracts n ebits from each output resource so that the remaining output dimension matches the input; for the pairs (2,4), (4,6), (6,2) with rate +1, the extra input ebits are locally supplied by the first user and the output dimension is unchanged. The manuscript would be easier to verify if this accounting were made explicit with the relevant dimensions in Eqs. (53)-(57).
  3. [Appendix D, Eq. (D15)] In the definition of the bit string b after Eq. (D15), the phrase 'when M < D' should read 'when M ∉ D' (i.e., when M is not an element of the subset D).
  4. [Section II A, Eq. (1)] Equation (1) appears to have a typesetting error: it should be 'ψ = |ψ⟩⟨ψ|' rather than 'ψ B|ψ⟩⟨ψ|'.
  5. [Appendix F, Eq. (F8)] In the definition of I_n(i,j), the summation index is also denoted j, which conflicts with the second index of I_n(i,j). Renaming the summation index (e.g., k) would avoid confusion.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity found; the derivation is self-contained and the terse bookkeeping step is not circular.

full rationale

The paper's derivation chain is self-contained and does not reduce any central claim to its own inputs. The lower bound in Lemma 2 and Theorem 3 is obtained from an independent entropic quantity l_P(psi), defined by entropy differences under isometries, combined with the standard monotonicity of entanglement under LOCC and the Fannes-Audenaert inequality; no target result is assumed. The upper bound in Theorem 7 is constructive: it concatenates standard quantum state merging and Schumacher-compression-with-teleportation protocols, and the segment rates follow by direct calculation from the known entanglement costs of those protocols. Theorem 13 is a purely mathematical consequence of Lemma 21, which shows that a zero total rate forces every bipartite rate to equal its lower bound; solving the resulting linear system determines the segment rates uniquely. Proposition 16 uses Theorem 13 to derive the segment rates in Eq. (53), then observes that these rates allow the QSR protocol to be reinterpreted as a catalytic LOCC protocol for the three-user task; the added ebits are resource bookkeeping, not fitted parameters or renamed predictions. Lemma 17 is proven independently using the relative entropy of entanglement and its monotonicity under LOCC, with explicit inequalities in Appendix F that do not rely on Proposition 16. The contradiction obtained in Proposition 16 therefore depends on an external impossibility result, not on a circular reuse of the statement being proved. The self-citations to the authors' earlier works [10,11,12] are used for proof techniques, such as the merge-and-send strategy and the QSE lower bound, and are not load-bearing premises that smuggle in the QSR result. No fitted input is called a prediction, and no uniqueness theorem from the authors' prior work is invoked to force the choice of protocol. Accordingly, the paper merits a circularity score of 0.

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

No free parameters are fitted; QSR introduces no new physical entities. All assumptions are standard quantum information results or the explicit resource model of the task.

assumptions (6)
  • standard math Asymptotic quantum state merging can merge system A to B at entanglement cost H(A|B) (Horodecki et al.).
    Used in Lemma 6 and Appendix C to implement the M-partite merge-and-send strategy with rates H(A_i|A_{i+1}).
  • standard math Schumacher compression together with quantum teleportation can transmit a system at cost H(A_M).
    Used in Lemma 6 for the final hop from user M to user 1.
  • standard math Fannes-Audenaert continuity of von Neumann entropy.
    Used in Appendix A in the proof of Lemma 2 to pass from finite-error protocols to asymptotic rates.
  • standard math Monotonicity of entanglement under LOCC and monotonicity of trace distance under partial trace.
    Used in Proposition 18 and Appendix F to lower-bound resource differences.
  • standard math Relative entropy of entanglement is monotone under LOCC and satisfies a continuity bound.
    Used in Appendix F in the proof of Lemma 17.
  • domain assumption Complete entanglement allocation is the allowed resource model.
    The task definition allows every pair of users to share and gain entanglement; Remark 10 justifies this choice against cycle allocation via the φ3 example.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Quantum state rotation: Circularly transferring quantum states of multiple users." pith.science (2026). https://pith.science/paper/KSDBRJR3

@misc{pith2026200911539,
  author       = {Pith},
  title        = {Pith review of: Quantum state rotation: Circularly transferring quantum states of multiple users},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/KSDBRJR3}},
  note         = {Machine review of arXiv:2009.11539}
}
abstract

Quantum state exchange is a quantum communication task for two users in which the users faithfully exchange their respective parts of an initial state under the asymptotic scenario. In this work, we generalize the quantum state exchange task to a quantum communication task for $M$ users in which the users circularly transfer their respective parts of an initial state. We assume that every pair of users may share entanglement resources, and they use local operations and classical communication in order to perform the task. We call this generalized task the (asymptotic) quantum state rotation. First of all, we formally define the quantum state rotation task and its optimal entanglement cost, which means the least amount of total entanglement required to carry out the task. We then present lower and upper bounds on the optimal entanglement cost, and provide conditions for zero optimal entanglement cost. Based on these results, we find out a difference between the quantum state rotation task for three or more users and the quantum state exchange task.

Figures

Figures reproduced from arXiv: 2009.11539 by the authors.

Figure 1
Figure 1. FIG. 1: In these illustrations, quantum states are represented as [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. FIG. 2: In each illustration, quantum states are represented as poly [PITH_FULL_IMAGE:figures/full_fig_p002_2.png] view at source ↗
Figure 3
Figure 3. FIG. 3: Illustration of the quantum state rotation task for four [PITH_FULL_IMAGE:figures/full_fig_p003_3.png] view at source ↗
Figures from the paper (7 more)
Figure 4
Figure 4. Figure 4: FIG. 4: Initial state [PITH_FULL_IMAGE:figures/full_fig_p005_4.png]
Figure 5
Figure 5. Figure 5: FIG. 5: Illustrations of the complete entanglement allocation and [PITH_FULL_IMAGE:figures/full_fig_p007_5.png]
Figure 6
Figure 6. Figure 6: FIG. 6: Illustration for the three-user task of Alice, Bob, and Char [PITH_FULL_IMAGE:figures/full_fig_p009_6.png]
Figure 8
Figure 8. Figure 8: The sequence {Rn}n∈N and its segment entanglement rates ei, j in Eq. (53) imply that it is possible to carry out the TU task by means of LOCC assisted by the catalytic use of entangle￾ment under the asymptotic scenario. To be specific, recall that each Rn is LOCC proto…
Figure 8
Figure 8. Figure 8: FIG. 8: Systems of entanglement resources giving positive/ [PITH_FULL_IMAGE:figures/full_fig_p011_8.png]
Figure 9
Figure 9. Figure 9: FIG. 9: In each illustration, circles indicate quantum systems for [PITH_FULL_IMAGE:figures/full_fig_p012_9.png]
Figure 10
Figure 10. Figure 10: FIG. 10: (a) Initial state and input entanglement resources for the [PITH_FULL_IMAGE:figures/full_fig_p013_10.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

34 extracted references · 28 canonical work pages

  1. [1]

    Remark 1

    The optimal entanglement cost (OEC) eopt(ψ) of the QSR task for ψ is defined as the infimum of the achievable total entanglement rates. Remark 1. In the QSR task, the users obtain the final state ψf and the output entanglement resources ˜Φ by applying the QSR protocol to the initial stateψ and the input entanglement resources ˜Ψ. Note that the QSR protocol i...

    work page

  2. [2]

    Then the 1st user and the 2nd user asymptotically generate the same amount of entanglement by applying entanglement distillation [13–15] toϕ1 on quantum systems A1A2

    For this, the amount of entanglement consumed by them is H(A1)ϕ1. Then the 1st user and the 2nd user asymptotically generate the same amount of entanglement by applying entanglement distillation [13–15] toϕ1 on quantum systems A1A2. Finally, the 1st user locally prepares the pure quantum state ϕ2 on the system A′

    work page

  3. [3]

    In an illustration for input (out- put) entanglement resources, two circles connected by a line indicate consumed (gained) entanglement whose amount is H(A1)ϕ1. For example, let us consider a simple initial state |φ1⟩A =|ϕ1⟩A1A2⊗|ϕ2⟩A3, (13) where E is regarded as a one-dimensional system,|ϕ1⟩ is any two-qubit entangled state, and|ϕ2⟩ is any quantum state...

    work page

  4. [4]

    The positive (negative) segment entanglement rate is de- scribed in Fig. 4. III. LOWER BOUND In this section, we present a lower bound on the OEC of the QSR task. For a non-empty proper subset P of the set [M] and the ini- tial state|ψ⟩AE with A = A1A2··· AM, we consider a quantity lP(ψ) defined as lP(ψ) = max U H (⨂ i∈P Ai−1V ) U|ψ⟩ − H (⨂ i∈P AiV ...

    work page

  5. [5]

    C. H. Bennett, G. Brassard, C. Cr ´epeau, R. Jozsa, A. Peres, and W. K. Wootters, Phys. Rev. Lett.70, 1895 (1993)

    1993

  6. [6]

    Horodecki, J

    M. Horodecki, J. Oppenheim, and A. Winter, Nature (London) 436, 673 (2005)

    work page 2005

  7. [7]

    Horodecki, J

    M. Horodecki, J. Oppenheim, and A. Winter, Commun. Math. Phys. 269, 107 (2006)

    work page 2006

  8. [8]

    Devetak, Phys

    I. Devetak, Phys. Rev. Lett. 97, 140503 (2006)

    work page 2006

Show all 34 references
  1. [9]

    Oppenheim (2008), arXiv:0805.1065v1

    J. Oppenheim (2008), arXiv:0805.1065v1

    2008 arXiv

  2. [10]

    Devetak and J

    I. Devetak and J. Yard, Phys. Rev. Lett. 100, 230501 (2008)

    2008

  3. [11]

    J. T. Yard and I. Devetak, IEEE Trans. Inf. Theory 55, 5339 (2009)

    2009

  4. [12]

    Abeyesinghe, I

    A. Abeyesinghe, I. Devetak, P. Hayden, and A. Winter, Proc. R. Soc. A 465, 2537 (2009)

    2009

  5. [13]

    M. M. Wilde, Quantum Information Theory (Cambridge Uni- versity Press, Cambridge, England, 2013)

    2013

  6. [14]

    Oppenheim and A

    J. Oppenheim and A. Winter, arXiv:quant-ph/0511082

    arXiv

  7. [15]

    Y . Lee, R. Takagi, H. Yamasaki, G. Adesso, and S. Lee, Phys. Rev. Lett. 122, 010502 (2019)

    2019

  8. [16]

    Y . Lee, H. Yamasaki, G. Adesso, and S. Lee, Phys. Rev. A100, 042306 (2019)

    2019

  9. [17]

    C. H. Bennett, H. J. Bernstein, S. Popescu, and B. Schumacher, Phys. Rev. A 53, 2046 (1996)

    1996

  10. [18]

    C. H. Bennett, D. P. DiVincenzo, J. A. Smolin, and W. K. Woot- ters, Phys. Rev. A 54, 3824 (1996)

    1996

  11. [19]

    C. H. Bennett, G. Brassard, S. Popescu, B. Schumacher, J. A. Smolin, and W. K. Wootters, Phys. Rev. Lett.78, 2031 (1997)

    1997

  12. [20]

    Schumacher, Phys

    B. Schumacher, Phys. Rev. A 51, 2738 (1995)

    1995

  13. [21]

    D. M. Greenberger, M. A. Horne, and A. Zeilinger, Bell’s Theorem, Quantum Theory, and Conceptions of the Universe (Kluwer Academics, Dordrecht, 1989)

    1989

  14. [22]

    C. H. Bennett, S. Popescu, D. Rohrlich, J. A. Smolin, and A. V . Thapliyal, Phys. Rev. A 63, 012307 (2000)

    2000

  15. [23]

    Linden, S

    N. Linden, S. Popescu, B. Schumacher, and M. Westmoreland, Quantum Inf. Process. 4, 241 (2005)

    2005

  16. [24]

    J. I. Cirac, A. K. Ekert, S. F. Huelga, and C. Macchiavello, Phys. Rev. A 59, 4249 (1999)

    1999

  17. [25]

    D. Bruß, G. M. D’Ariano, M. Lewenstein, C. Macchiavello, A. Sen(De), and U. Sen, Phys. Rev. Lett. 93, 210501 (2004)

    2004

  18. [26]

    J. I. Cirac, P. Zoller, H. J. Kimble, and H. Mabuchi, Phys. Rev. Lett. 78, 3221 (1997)

    1997

  19. [27]

    Azuma, A

    K. Azuma, A. Mizutani, and H.-K. Lo, Nat. Commun. 7, 13523 (2016)

    2016

  20. [28]

    Fannes, Commun

    M. Fannes, Commun. Math. Phys. 31, 291 (1973)

    1973

  21. [29]

    K. M. R. Audenaert, J. Phys. A 40, 8127 (2007)

    2007

  22. [30]

    Anshu, R

    A. Anshu, R. Jain, and N. A. Warsi, IEEE Trans. Inf. Theory 64, 1436 (2018)

    2018

  23. [31]

    Dutil and P

    N. Dutil and P. Hayden, arXiv:1011.1974

    1974 arXiv

  24. [32]

    van Dam and P

    W. van Dam and P. Hayden, arXiv:quant-ph/0204093

    arXiv

  25. [33]

    M. J. Donald and M. Horodecki, Physics Letters A 264, 257 (1999)

    1999

  26. [34]

    K. G. H. V ollbrecht and R. F. Werner, Physics Letters A 64, 062307 (2001). Appendix A: Proof of Lemma 2 In this appendix, we prove Lemma 2 in the main text. If a protocolR in Eq. (8) satisfies (R⊗ idL(E))(ψ⊗ ˜Ψ) =ψf⊗ ˜Φ, thenR is said to be exact. The case regarding only exact...

    2001

Pith tools

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