Near-optimal entanglement-communication tradeoffs for remote state preparation
Pith reviewed 2026-05-21 13:57 UTC · model grok-4.3
The pith
Nearly-matching bounds on entanglement and communication costs for remote state preparation of rank-k projector states P/k, with a direct link to entanglement distillation.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
Any pure entangled state that can be used to do RSP of these states with o(d) bits of communication can distill log d ebits of entanglement, and conversely any state that can distill log d ebits can be used to do RSP of these states efficiently.
Load-bearing premise
The analysis assumes that the shared resource is a pure entangled state and that the target states are exactly of the form P/k for a rank-k projector P; if the shared state is mixed or the target deviates from this form, the claimed equivalence between efficient RSP and log d ebit distillation may not hold.
read the original abstract
We study the following task: Alice is given a classical description of a rank-$k$ projector $P$ on $\mathbb{C}^d$, and Alice and Bob want to prepare the quantum state $P/k$ on Bob's side using shared entanglement and classical communication. The general form of this task is known as remote state preparation (RSP). We give nearly-matching lower and upper bounds for the entanglement cost and communication cost for RSP of the states $P/k$. Ours are the first nearly matching upper and lower bounds for RSP of mixed states, and in the special case of pure states, our lower bound outperforms the best previously known lower bound. Our results show that any pure entangled state that can be used to do RSP of these states with $o(d)$ bits of communication, can distill $\log d$ ebits of entanglement, and conversely, any state that can distill $\log d$ ebits of entanglement can be used to do RSP of these states efficiently. As applications of our results, we rederive a previously-known incompressibility result for states of the form $P/k$, and give a new entanglement-assisted communication protocol for the equality function that uses $\frac{1}{2}\log n + O(1)$ many ebits, and $O(1)$ communication.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript studies remote state preparation (RSP) of states of the form P/k, where P is a rank-k projector on C^d. Alice receives a classical description of P and, using shared entanglement and classical communication, the parties prepare the mixed state P/k on Bob's side. The paper derives nearly-matching upper and lower bounds on the required entanglement and communication resources. It establishes that, for pure shared states, the ability to perform this RSP task with o(d) bits of communication is equivalent to the distillability of log d ebits, and conversely. Applications include a rederivation of an incompressibility result for such states and a new entanglement-assisted protocol for the equality function using (1/2)log n + O(1) ebits and O(1) communication.
Significance. If the near-optimality of the bounds is confirmed with explicit error terms, the work supplies the first nearly-matching bounds for RSP of mixed states and strengthens the best prior lower bound for the pure-state case. The equivalence result provides a concrete link between communication-efficient RSP and standard entanglement distillation, which may prove useful for resource characterization in quantum information. The equality-function application demonstrates a concrete communication-complexity payoff from the main technical development.
major comments (2)
- [Abstract and §3] Abstract and §3 (main theorems): the central claim of 'nearly-matching' bounds is load-bearing, yet the abstract and theorem statements do not display the precise additive or multiplicative gaps (e.g., whether the communication lower bound is d - o(d) or d - O(log d)). Without these explicit factors it is impossible to verify that the upper and lower bounds meet within the stated o(d) or O(1) terms.
- [§4] §4 (equivalence proof): the lower-bound direction converting an o(d)-communication RSP protocol into a log d ebit distillation procedure relies on the shared state being pure. The manuscript should explicitly state whether the argument extends to mixed states with identical marginals or whether the equivalence is strictly limited to pure states, as a mixed state could in principle support low-communication RSP while possessing strictly lower distillable entanglement.
minor comments (2)
- [§2] Notation for the target state P/k should be introduced once with a clear reminder that k may depend on d; subsequent sections occasionally use P without the normalization, which can be confusing.
- [Applications] The equality-function protocol in the applications section would benefit from a short comparison table against the best known entanglement-assisted protocols to highlight the improvement.
Simulated Author's Rebuttal
We thank the referee for their careful reading of the manuscript and for the constructive comments. We address each major comment below and indicate the revisions we will make to improve clarity.
read point-by-point responses
-
Referee: [Abstract and §3] Abstract and §3 (main theorems): the central claim of 'nearly-matching' bounds is load-bearing, yet the abstract and theorem statements do not display the precise additive or multiplicative gaps (e.g., whether the communication lower bound is d - o(d) or d - O(log d)). Without these explicit factors it is impossible to verify that the upper and lower bounds meet within the stated o(d) or O(1) terms.
Authors: We agree that making the precise gaps explicit will strengthen the presentation. The theorems in Section 3 establish communication costs that match within o(d) additive terms (upper bound d + o(d), lower bound d - o(d)) and analogous entanglement costs. In the revised manuscript we will update the abstract and the statements of the main theorems to display these explicit additive gaps, along with a brief remark on the o(d) and O(1) error terms. revision: yes
-
Referee: [§4] §4 (equivalence proof): the lower-bound direction converting an o(d)-communication RSP protocol into a log d ebit distillation procedure relies on the shared state being pure. The manuscript should explicitly state whether the argument extends to mixed states with identical marginals or whether the equivalence is strictly limited to pure states, as a mixed state could in principle support low-communication RSP while possessing strictly lower distillable entanglement.
Authors: The equivalence is stated for pure shared states, as the lower-bound direction uses purity to convert the RSP protocol into a distillation procedure. We will add an explicit clarifying sentence in Section 4 noting that the equivalence is limited to pure states and need not hold for mixed states with identical marginals, since a mixed state could in principle support o(d)-communication RSP while having strictly lower distillable entanglement. revision: yes
Circularity Check
No circularity: RSP-entanglement equivalence derived from independent bounds
full rationale
The paper derives nearly-matching upper and lower bounds on entanglement and communication costs for RSP of states P/k. The central equivalence (pure states enabling o(d)-bit RSP distill log d ebits, and conversely) is explicitly a consequence of these bounds under the stated assumptions of pure shared states and exact normalized rank-k projectors. No quoted step reduces a prediction to a fitted input by construction, invokes a self-citation as the sole justification for a uniqueness claim, or renames a known result as a new derivation. The rederivation of the incompressibility result is presented as an application of the new bounds rather than an input. The analysis remains self-contained against external benchmarks for this task family.
Axiom & Free-Parameter Ledger
axioms (1)
- standard math Standard quantum mechanics: states are density operators on finite-dimensional Hilbert spaces, entanglement is quantified by distillable ebits, and classical communication is free of quantum noise.
Lean theorems connected to this paper
-
IndisputableMonolith/Cost/FunctionalEquation.leanwashburn_uniqueness_aczel unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
Our results show that any pure entangled state that can be used to do RSP of these states with o(d) bits of communication, can distill log d ebits of entanglement, and conversely, any state that can distill log d ebits of entanglement can be used to do RSP of these states efficiently.
-
IndisputableMonolith/Foundation/AlphaCoordinateFixation.leanJ_uniquely_calibrated_via_higher_derivative unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
Theorem 4.3 … H^δ+γ_min(A)σ ≥ log d − 3 log(1/γ) − O(1) where δ = F(k/d + O(√(m/d)), 1−ε_r)
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.