Pith. sign in

REVIEW 3 major objections 5 minor 1 cited by

Minimal Help, Maximal Gain: Environmental Assistance Unlocks Encoding Strength

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

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

Pith's one-line read Minimal environment assistance can restore a quantum channel's full encoding strength even when its conventional capacity is suboptimal.

desk verdict Promising psd-rank framework undone by an empty channel class; the main example is vacuous as written. read the letter →

arxiv 2509.09340 v1 pith:CSHPSKQL submitted 2025-09-11 quant-ph

Snehasish Roy Chowdhury , Sutapa Saha , Subhendu B. Ghosh , Ranendu Adhikary , Tamal Guha This is my paper
classification quant-ph
keywords quantumchannelenvironment-assistedclassicalcapacityencodingstrengthpositivesemidefiniterankmatrixminimalenvironmentassistancenon-signalingcorrelationstransmissionfidelity
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 a way to measure classical communication through quantum channels that goes beyond mutual information, focusing on the set of input–output probability matrices a channel can generate and their positive-semidefinite (psd) rank. In this measure, a channel whose output dimension is smaller than its input can natively transmit at most as many symbols as its output dimension, but a minimal amount of environment help can restore the full input encoding strength. The authors construct channels, for every dimension d≥3, that have suboptimal environment-assisted classical capacity under the conventional definition yet, with minimal environment assistance, can generate a channel matrix of psd rank d^2−1, matching the performance of a perfect d^2−1-dimensional quantum channel. They also show that neither shared randomness nor any two-input two-output non-signaling correlation can replace this environment help. If correct, the result establishes a sharp separation between Shannon-style capacity and the structural encoding strength measured by psd rank.

What carries the argument

The key object is the positive-semidefinite rank (psd rank) of a channel matrix: the smallest integer r such that the matrix entry M_ij equals Tr(R_i C_j) for r×r positive semidefinite matrices R_i, C_j. Because any channel N: L(C^{d_A})→L(C^{d_B}) produces matrices with psd rank at most min(d_A,d_B), the psd rank acts as a dimension certificate: a channel matrix of psd rank r cannot be simulated by any perfect quantum channel of dimension less than r. The argument builds explicit channel matrices—M_7(p) for d=3 and M_{d^2−1} for general d—that have psd rank equal to the channel's input dimension, then shows these matrices are realized by the constructed channels under minimal environment as

What would settle it

Check whether the set S in Eq. (2) contains any isometry: compute the orthogonal complement of the seven vectors {|φ_3^+>, |0>|1>, |0>|2>, |1>|0>, |1>|2>, |2>|0>, |2>|1>} in C^3⊗C^3. If these seven vectors are linearly independent, the complement has dimension at most 2, so no 7-dimensional range can lie in it; exhibiting even one V_7 satisfying the condition would refute this dimensional obstruction and validate the existence of the constructed channels.

Watch

Extended reading notes

Core claim

The central claim is that the conventional environment-assisted classical capacity (EACC), computed via mutual information, systematically underestimates the communication utility of certain quantum channels. For channels N^{V_{d^2−1}}: L(C^{d^2−1}) → L(C^d) induced by isometries whose range is orthogonal to the maximally entangled state |φ_d^+>, the EACC is strictly below the maximum log(d^2−1), even when receiver and environment may use separable measurements. Yet with only minimal environment assistance—each side performs a local computational-basis measurement and the environment sends its outcome to the receiver—the channel can simulate a channel matrix whose psd rank is d^2−1, exactly

Load-bearing premise

The entire construction rests on the assumption that the set S of isometries defined in Eq. (2) is nonempty: that there exists an isometry V_7 from C^7 to C^3⊗C^3 whose 7-dimensional range is orthogonal to the seven listed vectors; since seven linearly independent vectors in a 9-dimensional space leave a 2-dimensional orthogonal complement, no such isometry exists, and if this premise fails the claimed counterexample and the universality of Theorem 1 do not go through.

Editorial extensions

If this is right

  • For channels with input dimension exceeding output dimension, minimal environment assistance can restore full encoding strength even when standard EACC is suboptimal; the phenomenon is not an artifact of mutual information.
  • If a channel matrix of psd rank equal to the input dimension is generated with environment help, then no smaller perfect quantum channel can simulate the same input–output statistics, so the assistance is genuinely unlocking new capability.
  • In the broadcast interpretation, the two receivers (Bob and environment) communicating classically can outperform shared non-signaling resources between sender and receiver: environment help beats PR-box assistance for classical transmission fidelity.
  • The notion of 'unlocking encoding strength' provides a structural, majorization-like criterion for a resource to enhance communication utility in the single-shot regime, independent of which specific payoff function is chosen.
  • For every d≥3, the constructed channels show the separation is generic, not restricted to a low-dimensional example.

Reading between the lines

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

  • The psd-rank measure suggests that single-shot classical communication is characterized by the factorization dimension of the channel matrix; one could test whether all channels with d_A > d_B admit some environment-assisted protocol that saturates psd rank d_A, or whether the constructed class is special.
  • If the mathematical construction were made explicit with a valid isometry, the same technique would likely apply to other subspaces whose orthogonal complements are distinguishable; finding such subspaces would generalize the result beyond the maximally entangled state.
  • The separation between capacity and psd-rank encoding strength raises the question of whether an operational single-shot task can be designed whose success probability is exactly the max-monotone Λ_max, giving a direct experimental witness of the effect.
  • In a resource-theoretic reading, unlocking encoding strength could serve as a sufficient criterion for communication advantage in black-box scenarios; a natural extension is to characterize which other resources (beyond environment help) can unlock encoding strength for these channels.
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 / 5 minor

Summary. The paper introduces a psd-rank-based measure of the classical encoding strength of a quantum channel, formalizes the notion of 'unlocking' this strength via environment assistance, and claims to exhibit channels N^{V_7}: L(C^7)→L(C^3) whose conventional environment-assisted classical capacity (EACC) is suboptimal but whose encoding strength is optimally unlocked under minimal environment assistance. It further claims that shared randomness or any 2-input–2-output non-signaling correlation cannot substitute for this assistance, and it generalizes the construction to arbitrary dimensions via channels N^{V_{d^2-1}}. The central technical results are Theorem 1 (the d=3 showcase), Theorem 2 (comparison with non-signaling resources), and Theorem 3 (arbitrary dimension). The paper is organized around explicit channel-matrix constructions and psd-rank lower bounds.

Significance. If the constructions are corrected, the paper would establish a sharp separation between the conventional EACC measure and a single-shot, psd-rank-based measure of encoding strength, which is a genuinely interesting and under-explored direction. The framework of defining communication advantage through the psd rank of achievable channel matrices is coherent and builds on established tools (psd rank, separable measurements, environment-assisted capacities). The paper is mostly self-contained and provides explicit encoding/decoding strategies in Table I and Appendix J. However, as written, the central example is vacuous: the class S in Lemma 3 is empty, so Theorems 1 and 2 have no instances. The general-dimensional Theorem 3 also rests on a SEP/LOCC gap. These are load-bearing issues that must be addressed before the claims can be accepted.

major comments (3)
  1. [Lemma 3, Eq. (2)] The set S defined in Eq. (2) is empty. The orthogonality constraints are to seven vectors: |φ3+⟩ and the six off-diagonal product states |i⟩⊗|j≠i⟩. These seven vectors are linearly independent (the six product states are mutually orthogonal, and |φ3+⟩ has support only on the diagonal subspace), so their span has dimension 7 in C^3⊗C^3. The orthogonal complement therefore has dimension 2, while an isometry V7: C^7→C^3⊗C^3 has a 7-dimensional range. No such isometry can satisfy Range(V7) ⊥ {|φ3+⟩, |i⟩⊗|j≠i⟩}. Hence S=∅, and Theorem 1 (and any statement quantifying over V7∈S) is vacuous. Appendix G confirms the inconsistency: the claimed basis of Range(V7) includes |02⟩, |10⟩, |12⟩, |20⟩, |21⟩, which Eq. (2) explicitly requires Range(V7) to be orthogonal to. The intended class is likely Range(V7) ⊥ |φ3+⟩ only; the proof strategy in Appendix G is compatible with that corrected definition. Th
  2. [Lemma 5 / Theorem 3] Lemma 5 asserts that the EACC of every channel N^{V_{d^2-1}} is suboptimal even when the decoding measurements of both receiver and environment are separable super-operators (SEP). The proof, however, cites Watrous [30], which establishes that a certain bipartite subspace has no basis distinguishable by local operations and classical communication (LOCC). Since SEP is strictly more powerful than LOCC, LOCC-indistinguishability does not imply SEP-indistinguishability. The EACC-suboptimality premise is necessary for the 'separation' claim in Theorem 3, so the argument is incomplete as written. The authors need either a direct SEP-indistinguishability argument or a citation that establishes exactly the SEP version (if [29] does, it should be cited here instead of or in addition to [30]).
  3. [Appendix I / Theorem 2] The proof of Theorem 2 contains a resource-counting issue. The simulation of the PR-box-assisted strategy uses a 1-cbit forward channel from Alice to Bob (so that Bob can compute b_i = λ ⊕ f(x_i)g(j)), which is an extra communication resource not present in the original PR-assisted protocol. While the resulting inclusion P_PR(N) ⊆ P_SR(N + 1cbit) is an upper bound and therefore legitimate for bounding F_c^PR, the next reduction P_SR(N + Q2) ⊆ P_SR(Q3 + Q2) ⊆ P_SR(Q5) is not justified: Q3 ⊗ Q2 is a 6-dimensional system, and the invoked no-hypersignaling principle [45] does not, as stated, reduce it to Q5. This step needs to be either carefully proved or replaced by a different argument, since Theorem 2's claim that no 2-2-2 non-signaling correlation can substitute for environment assistance depends on it.
minor comments (5)
  1. [Eq. (2)] The set notation '{|φ3+⟩, |i⟩⊗|j≠i⟩}' is ambiguous; it should state explicitly that i,j range over {0,1,2} with i≠j. More importantly, the correction of the class definition should be made prominent, since the empty-set issue is structural.
  2. [Appendix A] There are several typographical issues in the appendix, e.g., missing superscripts in expressions like 'P∈ P n→m (QdA)' and inconsistent use of Qd vs Q(d). These should be cleaned up.
  3. [Table I] The table is hard to read: rows for x6 and x7 have repeated lines with identical probabilities, and the dependence on p is not visually separated. Consider merging or reformatting.
  4. [Lemma 8/9] The notation P_SR(M(QdA)) is used in Lemma 8 and 9 without prior definition. Please define the SR-assisted channel-matrix set before Lemma 8.
  5. [Abstract / Introduction] The phrase 'unlock the encoding strength' could be accompanied by a one-sentence intuitive explanation in the introduction, since the formal definition appears only in Definition 3.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the central derivation is self-contained; the main risk is a non-circular correctness failure (the Eq. (2) class S appears empty).

full rationale

The paper's central claim is Theorem 3: for d≥3 the channels N^{V_{d^2-1}} have suboptimal EACC yet reach optimal encoding strength under minimal environmental assistance. The derivation is not circular: encoding strength is defined via psd-rank of achievable channel matrices (Defs. 2–3), and the theorems supply explicit matrices M7(p) and M_{k_d}, prove their psd-rank is d_A using external psd-rank lower bounds (Lemmas 6–7), and give explicit encoding/decoding strategies showing the assisted channel simulates those matrices. No parameter is fitted to the target quantity, no 'prediction' is just a re-read of an input, and no load-bearing step is justified by a self-citation: refs. [19,32,34] are contextual; the operative citations for indistinguishability ([29,30]) and psd-rank ([37,38,44]) are external and standard. The definition of optimal unlocking in terms of psd-rank is a modeling choice, not a circular reduction: the existence of a matrix with psd-rank above d_B is established independently. Separately, but not as circularity, the paper has a severe correctness problem: in Eq. (2), S = { V7 : C^7 → C^3⊗C^3 | Range(V7) ⊥ {|φ3+⟩, |i⟩⊗|j≠i⟩} } is empty, since the seven orthogonality vectors span a 7-dimensional subspace of the 9-dimensional C^3⊗C^3, leaving a 2-dimensional complement for a 7-dimensional range; and Appendix G's purported basis of Range(V7) includes |02⟩, |10⟩, |12⟩, |20⟩, |21⟩, which Eq. (2) requires the range to be orthogonal to. This vacuousness does not reduce the proof to its assumptions; it makes Theorem 1/2 vacuous as written. The d>3 class of Lemma 5/Theorem 3 is nonempty and appears independent, so the circularity score is not affected.

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

No fitted parameters are used. The paper relies on standard psd-rank facts, on the Stinespring dilation model, on an assumed free classical message from the environment to the receiver, and on indistinguishability results for subspaces. The indistinguishability assumptions are the most fragile because the cited results do not match the claims as stated.

assumptions (5)
  • standard math Standard psd-rank lower bounds: rank_psd(M) ≥ Λ_max(M) for row-stochastic M; block-matrix lower bound; triangular-matrix lower bound.
    Invoked in proofs of Lemma 4 and Lemma 10, cited to [37] and [44]. Lemma 7 as stated is false for zero diagonal entries, though the specific matrix M_Σ has positive diagonal.
  • domain assumption The subspace orthogonal to |φ_d^+> has no basis perfectly distinguishable by the allowed environment-assisted decoding measurements.
    Used to assert EACC suboptimality in Lemma 3 and Lemma 5. Lemma 3 defines S with an impossible range condition; Lemma 5 cites an LOCC result [30] to support a SEP claim, which is not automatically valid.
  • domain assumption The environment's measurement outcome can be sent to the receiver at no cost while still counting as 'minimal assistance'.
    Eq. (10) and Table I require Bob to know the environment outcome, but the main text and Appendix B state there is no communication between them. This is an unflagged modeling assumption.
  • standard math No-hypersignaling principle: a composite quantum communication resource can be simulated by a single quantum system of summed dimension.
    Used in Theorem 2 Part 2 to reduce Q3+Q2 to Q5, cited to [45].
  • standard math Every CPTP map has a Stinespring isometry, and P(Q^d) consists exactly of channel matrices with psd rank at most d.
    Basis for the framework, cited to [7,33,37].

how reviews work

0 comments
Cite this review

Pith. "Pith review of Minimal Help, Maximal Gain: Environmental Assistance Unlocks Encoding Strength." pith.science (2026). https://pith.science/paper/CSHPSKQL

@misc{pith2026250909340,
  author       = {Pith},
  title        = {Pith review of: Minimal Help, Maximal Gain: Environmental Assistance Unlocks Encoding Strength},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/CSHPSKQL}},
  note         = {Machine review of arXiv:2509.09340}
}
read the original abstract

For any quantum transmission line, with smaller output dimension than its input, the number of classical symbols that can be reliably encoded is strictly suboptimal. In other words, if the channel outputs a lesser number of symbols than it intakes, then rest of the symbols eventually leak into the environment, during the transmission. Can these lost symbols be recovered with minimal help from the environment? While the standard notion of environment-assisted classical capacity fails to fully capture this scenario, we introduce a generalized framework to address this question. Using an elegant example, we first demonstrate that the encoding capability of a quantum channel can be optimally restored with a minimal assistance of environment, albeit possessing suboptimal capacity in the conventional sense. Remarkably, we further prove that even the strongest two-input-two-output non-signaling correlations between sender and receiver cannot substitute for this assistance. Finally, we characterize a class of quantum channels, in arbitrary dimensions, exhibiting a sharp separation between the conventional environment-assisted capacity and the true potential for unlocking their encoding strength.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Lost and found charge in quantum batteries

    quant-ph 2025-11 conditional novelty 6.0 of 10

    For quantum batteries under thermal operations, the difference between charge recovered with and without access to the bath's purifying reference is lower-bounded by the entanglement of formation generated between bat...

Reference graph

Works this paper leans on

49 extracted references · 2 linked inside Pith · cited by 1 Pith paper

  1. [30]

    Watrous, Bipartite subspaces having no bases distin- guishable by local operations and classical communica- tion, Phys

    J. Watrous, Bipartite subspaces having no bases distin- guishable by local operations and classical communica- tion, Phys. Rev. Lett.95,080505(2005)

    2005

  2. [29]

    R. Duan, Y. Feng, Y. Xin, and M. Ying, Distinguishability of quantum states by separable operations, IEEE Transac- tions on Information Theory55,1320(2009)

    2009

  3. [45]

    Dall’Arno, S

    M. Dall’Arno, S. Brandsen, A. Tosini, F. Buscemi, and V . Vedral, No-hypersignaling principle, Physical Review Letters119,020401(2017). APPENDIX A. Proof of Proposition1 Let us first consider a quantum channel N: L(HdA )7→ L(HdB ), for which dA ≤d B. Suppose, P is an arbitrary n-input-m-output channel matrix, ob- tained by sending the quantum states {ρi}n...

    2017

  4. [1]

    M. A. Nielsen and C. M. Caves, Reversible quantum oper- ations and their application to teleportation, Phys. Rev. A 55,2547(1997)

    1997

  5. [2]

    M. A. Nielsen, C. M. Caves, B. Schumacher, and H. Barnum, Information-theoretic approach to quantum error correction and reversible measurement, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences454,277–304(1998)

    1998

  6. [3]

    Ambainis, M

    A. Ambainis, M. Mosca, A. Tapp, and R. De Wolf, Private quantum channels, inProceedings41st Annual Symposium on Foundations of Computer Science, SFCS-00(IEEE Comput. Soc,2000) p.547–553

    2000

  7. [4]

    P . O. Boykin and V . Roychowdhury, Optimal encryption of quantum bits, Phys. Rev. A67,042317(2003)

    2003

  8. [5]

    Nayak and P

    A. Nayak and P . Sen, Invertible quantum operations and perfect encryption of quantum states, Quantum Info. Com- put.7,103–110(2007)

    2007

Show all 49 references
  1. [6]

    M. A. Nielsen and I. L. Chuang,Quantum computation and quantum information, Vol.2(Cambridge university press Cambridge,2001)

    2001

  2. [7]

    W. F. Stinespring, Positive functions on c star -algebras, Proceedings of the American Mathematical Society6,211 (1955)

    1955

  3. [8]

    Macchiavello and G

    C. Macchiavello and G. M. Palma, Entanglement- enhanced information transmission over a quantum chan- nel with correlated noise, Phys. Rev. A65,050301(2002)

    2002

  4. [9]

    Bowen and S

    G. Bowen and S. Mancini, Quantum channels with a finite memory, Phys. Rev. A69,012306(2004)

    2004

  5. [10]

    J. Ball, A. Dragan, and K. Banaszek, Exploiting entangle- ment in communication channels with correlated noise, Phys. Rev. A69,042324(2004)

    2004

  6. [11]

    Gregoratti and R

    M. Gregoratti and R. F. Werner, Quantum lost and found, Journal of Modern Optics50,915–933(2003)

    2003

  7. [12]

    Gregoratti and R

    M. Gregoratti and R. Werner, On quantum error- correction by classical feedback in discrete time, Journal of mathematical physics45,2600(2004)

    2004

  8. [13]

    Buscemi, G

    F. Buscemi, G. Chiribella, and G. Mauro D’Ariano, Invert- ing quantum decoherence by classical feedback from the environment, Phys. Rev. Lett.95,090501(2005)

    2005

  9. [14]

    Karumanchi, S

    S. Karumanchi, S. Mancini, A. Winter, and D. Yang, Quantum channel capacities with passive environment assistance, IEEE Transactions on Information Theory62, 1733(2016)

    2016

  10. [15]

    S. K. Oskouei, S. Mancini, and A. Winter, Capacities of 6 gaussian quantum channels with passive environment assistance, IEEE Transactions on Information Theory68, 339(2022)

    2022

  11. [16]

    Harraz, S

    S. Harraz, S. Cong, and J. J. Nieto, Quantum state recovery via environment-assisted measurement and weak meas- urement, International Journal of Theoretical Physics61, 140(2022)

    2022

  12. [17]

    Harraz, J.-Y

    S. Harraz, J.-Y. Zhang, and S. Cong, High-fidelity quantum teleportation through noisy channels via weak measurement and environment-assisted measurement, Results in Physics55,107164(2023)

    2023

  13. [18]

    Chiribella and H

    G. Chiribella and H. Kristjánsson, Quantum shannon the- ory with superpositions of trajectories, Proceedings of the Royal Society A475,20180903(2019)

    2019

  14. [19]

    T. Guha, S. Roy, and G. Chiribella, Quantum networks boosted by entanglement with a control system, Phys. Rev. Res.5,033214(2023)

    2023

  15. [20]

    Lai, J.-D

    P .-R. Lai, J.-D. Lin, Y.-T. Huang, H.-C. Jan, and Y.-N. Chen, Quick charging of a quantum battery with superposed trajectories, Phys. Rev. Res.6,023136(2024)

    2024

  16. [21]

    Saha and U

    S. Saha and U. Sen, Interference between lossy quantum evolutions activates information backflow, arXiv:2507.22150 10.48550/arXiv.2507.22150(2025)

    2025 doi

  17. [22]

    Banaszek, A

    K. Banaszek, A. Dragan, W. Wasilewski, and C. Radzewicz, Experimental demonstration of entanglement-enhanced classical communication over a quantum channel with correlated noise, Phys. Rev. Lett.92,257901(2004)

    2004

  18. [23]

    Pirandola, C

    S. Pirandola, C. Ottaviani, C. S. Jacobsen, G. Sped- alieri, S. L. Braunstein, T. Gehring, and U. L. Andersen, Environment-assisted bosonic quantum communications, npj Quantum Information7,77(2021)

    2021

  19. [24]

    Rubino, L

    G. Rubino, L. A. Rozema, D. Ebler, H. Kristjánsson, S. Salek, P . Allard Guérin, A. A. Abbott, C. Branciard, i. c. v. Brukner, G. Chiribella, and P . Walther, Experimental quantum communication enhancement by superposing trajectories, Phys. Rev. Res.3,013093(2021)

    2021

  20. [25]

    Wang and L

    Z. Wang and L. Jiang, Passive environment-assisted quantum communication with gkp states, Phys. Rev. X15, 021003(2025)

    2025

  21. [26]

    Hayden and C

    P . Hayden and C. King, Correcting quantum channels by measuring the environment, Quantum Info. Comput.5, 156–160(2005)

    2005

  22. [27]

    Winter, On environment-assisted capacities of quantum channels, arXiv preprint quant-ph/0507045 10.48550/arxiv.quant-ph/0507045(2005)

    A. Winter, On environment-assisted capacities of quantum channels, arXiv preprint quant-ph/0507045 10.48550/arxiv.quant-ph/0507045(2005)

    2005 doi arXiv

  23. [28]

    Karumanchi, S

    S. Karumanchi, S. Mancini, A. Winter, and D. Yang, Clas- sical capacities of quantum channels with environment assistance, Problems of Information Transmission52,214 (2016)

    2016

  24. [31]

    P . E. Frenkel and M. Weiner, Classical information stor- age in an n-level quantum system, Communications in Mathematical Physics340,563–574(2015)

    2015

  25. [32]

    R. K. Patra, S. G. Naik, E. P . Lobo, S. Sen, T. Guha, S. S. Bhattacharya, M. Alimuddin, and M. Banik, Classical ana- logue of quantum superdense coding and communication advantage of a single quantum system, Quantum8,1315 (2024)

    2024

  26. [33]

    Heinosaari and O

    T. Heinosaari and O. Kerppo, Maximal Elements of Quantum Communication, Quantum8,1515(2024)

    2024

  27. [34]

    Chiribella, S

    G. Chiribella, S. Roy, T. Guha, and S. Saha, Communica- tion power of a noisy qubit, Physical Review Letters134, 080803(2025)

    2025

  28. [35]

    Holevo, The capacity of the quantum channel with general signal states, IEEE Transactions on Information Theory44,269–273(1998)

    A. Holevo, The capacity of the quantum channel with general signal states, IEEE Transactions on Information Theory44,269–273(1998)

    1998

  29. [36]

    Schumacher and M

    B. Schumacher and M. D. Westmoreland, Sending clas- sical information via noisy quantum channels, Physical Review A56,131(1997)

    1997

  30. [37]

    T. Lee, Z. Wei, and R. de Wolf, Some upper and lower bounds on psd-rank (2014), arXiv:1407.4308[cs.CC]

    2014 arXiv

  31. [38]

    Gouveia, P

    J. Gouveia, P . A. Parrilo, and R. R. Thomas, Lifts of convex sets and cone factorizations, Mathematics of Operations Research38,248–264(2013)

    2013

  32. [39]

    Z. Song, L. Chen, and D. Ž. Ðokovi´ c, The existence of distinguishable bases in three-dimensional subspaces of qutrit-qudit systems under one-way local projective meas- urements and classical communication, IEEE Transactions on Information Theory70,8806(2024)

    2024

  33. [40]

    Horodecki, P

    M. Horodecki, P . Horodecki, and J. Oppenheim, Revers- ible transformations from pure to mixed states and the unique measure of information, Phys. Rev. A67,062104 (2003)

    2003

  34. [41]

    G. Gour, M. P . Müller, V . Narasimhachar, R. W. Spekkens, and N. Y. Halpern, The resource theory of informational nonequilibrium in thermodynamics, Physics Reports583, 1(2015)

    2015

  35. [42]

    J. Yard, P . Hayden, and I. Devetak, Quantum broadcast channels, IEEE Transactions on Information Theory57, 7147(2011)

    2011

  36. [43]

    S. S. Bhattacharya, A. G. Maity, T. Guha, G. Chiribella, and M. Banik, Random-Receiver Quantum Communication, PRX Quantum2,020350(2021)

    2021

  37. [44]

    Fawzi, J

    H. Fawzi, J. Gouveia, P . A. Parrilo, R. Z. Robinson, and R. R. Thomas, Positive semidefinite rank, Mathematical Programming153,133(2015)

    2015

  38. [46]

    She sends the quantum system reliably through a perfect seven-dimensional quantum channel to Bob

    Alice uses theseven-dimensional computational basis {|i⟩} 6 i=0 to encode her input random vari- ables X:={x 0,· · ·,x6} respectively. She sends the quantum system reliably through a perfect seven-dimensional quantum channel to Bob

  39. [47]

    Upon receiving the system Bob performs the com- putational basis measurement{P j :=|j⟩⟨j|} 6 j=0

  40. [48]

    Addition- ally, after getting the click of the P5 (P6) projector, he uses a {p, 1−p} ({ p 3 , 1− p 3 }) local randomness to outputy 5 andy 6 respectively

    He then outputs the random variable {yj}4 j=0 whenever the projector {Pj}4 j=0 clicks. Addition- ally, after getting the click of the P5 (P6) projector, he uses a {p, 1−p} ({ p 3 , 1− p 3 }) local randomness to outputy 5 andy 6 respectively. To prove the converse, that is rank...

  41. [49]

    Note that, in either cases j∈ {d−1,d,· · ·,d(d−1)}

    + (d−1) when b<e . Note that, in either cases j∈ {d−1,d,· · ·,d(d−1)}. It can be trivially argued from Eq. (25) and (26) that such an instance of click- ing the projectors |b⟩⟨b| ⊗ |e⟩⟨e|can only happen when 13 |ψj⟩=|b⟩ B ⊗ |e⟩E where b̸=e . That is, the state sent by Alice is...

Pith tools

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