Near-optimal entanglement-communication tradeoffs for remote state preparation

• URL: http://arxiv.org/abs/2602.09428v1
• Date: Tue, 10 Feb 2026 05:46:41 GMT
• Title: Near-optimal entanglement-communication tradeoffs for remote state preparation
• Authors: Srijita Kundu, Olivier Lalonde,
• Abstract summary: General form of this task is known as remote state preparation (RSP)<n>We give nearly-matching lower and upper bounds for the entanglement cost and communication cost for RSP of the states $P/k$.<n>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.
• Score: 1.7188280334580195
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Scalable Multi-QPU Circuit Design for Dicke State Preparation: Optimizing Communication Complexity and Local Circuit Costs [13.575071625377097]
  The number of qubits available on a single quantum processing unit (QPU) is limited.<n>We investigate the distributed preparation of large-qubit Dicke states $D(n,k)$ across a general number $p$ of QPUs.<n>To the best of our knowledge, this is the first construction to simultaneously achieve logarithmic communication complexity and circuit size and depth.
  arXiv  Detail & Related papers  (2026-01-28T09:00:38Z)
• Improved Algorithm for Adversarial Linear Mixture MDPs with Bandit Feedback and Unknown Transition [71.33787410075577]
  We study reinforcement learning with linear function approximation, unknown transition, and adversarial losses. We propose a new algorithm that attains an $widetildeO(dsqrtHS3K + sqrtHSAK)$ regret with high probability.
  arXiv  Detail & Related papers  (2024-03-07T15:03:50Z)
• Trade-offs between Entanglement and Communication [5.88864611435337]
  We show that quantum simultaneous protocols with $tildeTheta(k5 log3 n)$ qubits of entanglement can exponentially outperform two-way randomized protocols with $O(k)$ qubits of entanglement. Prior to our work, only a relational separation was known.
  arXiv  Detail & Related papers  (2023-06-02T01:49:39Z)
• Cooperative Multi-Agent Reinforcement Learning: Asynchronous Communication and Linear Function Approximation [77.09836892653176]
  We study multi-agent reinforcement learning in the setting of episodic Markov decision processes. We propose a provably efficient algorithm based on value that enable asynchronous communication. We show that a minimal $Omega(dM)$ communication complexity is required to improve the performance through collaboration.
  arXiv  Detail & Related papers  (2023-05-10T20:29:29Z)
• Spacetime-Efficient Low-Depth Quantum State Preparation with Applications [93.56766264306764]
  We show that a novel deterministic method for preparing arbitrary quantum states requires fewer quantum resources than previous methods. We highlight several applications where this ability would be useful, including quantum machine learning, Hamiltonian simulation, and solving linear systems of equations.
  arXiv  Detail & Related papers  (2023-03-03T18:23:20Z)
• Local predictability and coherence versus distributed entanglement in entanglement swapping from partially entangled pure states [0.0]
  We study the relation between $P$, $C$ and the distributed entanglement in the entanglement swapping protocol (ESP) We use IBM's quantum computers to verify some instances of these general theoretical results.
  arXiv  Detail & Related papers  (2022-11-14T17:05:50Z)
• The minimal communication cost for simulating entangled qubits [0.0]
  We analyze the amount of classical communication required to reproduce the statistics of local projective measurements on a general pair of entangled qubits. We construct a protocol that perfectly simulates local projective measurements on all entangled qubit pairs by communicating one classical trit.
  arXiv  Detail & Related papers  (2022-07-25T18:25:49Z)
• Multi-Party Quantum Purity Distillation with Bounded Classical Communication [8.594140167290098]
  We consider the task of distilling local purity from a noisy quantum state $rhoABC$. We provide a protocol for three parties, Alice, Bob and Charlie, to distill local purity from many independent copies of a given quantum state $rhoABC$.
  arXiv  Detail & Related papers  (2022-03-10T18:04:33Z)
• Stochastic Shortest Path: Minimax, Parameter-Free and Towards Horizon-Free Regret [144.6358229217845]
  We study the problem of learning in the shortest path (SSP) setting, where an agent seeks to minimize the expected cost accumulated before reaching a goal state. We design a novel model-based algorithm EB-SSP that carefully skews the empirical transitions and perturbs the empirical costs with an exploration bonus. We prove that EB-SSP achieves the minimax regret rate $widetildeO(B_star sqrtS A K)$, where $K$ is the number of episodes, $S$ is the number of states, $A$
  arXiv  Detail & Related papers  (2021-04-22T17:20:48Z)
• Quantum communication with $SU(2)$ invariant separable $2\times N$ level systems [0.0]
  We propose protocols for remote transfers of information in a known and an unknown qubit to qudits. We also propose a protocol for swapping of quantum discord from $frac12otimes S$- systems to $Sotimes S$- systems.
  arXiv  Detail & Related papers  (2021-04-09T16:32:41Z)
• Nearly Horizon-Free Offline Reinforcement Learning [97.36751930393245]
  We revisit offline reinforcement learning on episodic time-homogeneous Markov Decision Processes with $S$ states, $A$ actions and planning horizon $H$. We obtain the first set of nearly $H$-free sample complexity bounds for evaluation and planning using the empirical MDPs.
  arXiv  Detail & Related papers  (2021-03-25T18:52:17Z)
• Improved Sample Complexity for Incremental Autonomous Exploration in MDPs [132.88757893161699]
  We learn the set of $epsilon$-optimal goal-conditioned policies attaining all states that are incrementally reachable within $L$ steps. DisCo is the first algorithm that can return an $epsilon/c_min$-optimal policy for any cost-sensitive shortest-path problem.
  arXiv  Detail & Related papers  (2020-12-29T14:06:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.