Convex Optimization Approaches to Optimal Teleportation Fidelity in Linear Three-Party Networks

• URL: http://arxiv.org/abs/2401.17201v2
• Date: Sun, 02 Nov 2025 03:40:27 GMT
• Title: Convex Optimization Approaches to Optimal Teleportation Fidelity in Linear Three-Party Networks
• Authors: Arkaprabha Ghosal, Jatin Ghai, Tanmay Saha, Mir Alimuddin, Sibasish Ghosh,
• Abstract summary: We study the maximum achievable quantum teleportation fidelity between two distant parties, Alice and Charlie.<n>We formulate a convex optimization problem that provides upper bounds on the LOCC achievable fidelity value.<n>We show that protocols initiated by Bob by performing measurements in a maximally entangled basis are not necessarily optimal.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study the maximum achievable quantum teleportation fidelity between two distant parties, Alice and Charlie, where each of them share a bipartite quantum state only with a common intermediary, Bob, and all parties are allowed to perform {\it Local Operations and Classical Communication} (LOCC). As the structure of LOCC is complicated, we relax the set of free operations to separable (SEP) operations and formulate a convex optimization problem that provides upper bounds on the LOCC achievable fidelity value. We observe that the complexity of such optimization problem reduces significantly if we restrict ourselves to a subclass of SEP operations, where the Kraus operators of either Alice or Charlie are proportional to unitary operators, leading to a simplified convex optimization that matches the general LOCC limit for certain two-qubit states. Through explicit examples, we show that protocols initiated by Bob by performing measurements in a maximally entangled basis are not necessarily optimal, and alternative strategies can outperform them. Finally, we extend our analysis to linear networks and demonstrate that different LOCC strategies can achieve the same optimal fidelity while consuming different amounts of entanglement content.

Related papers

• Operationalizing Stein's Method for Online Linear Optimization: CLT-Based Optimal Tradeoffs [40.656446349258964]
  We show that Stein's method, a classical framework underlying the proofs of probabilistic limit theorems, can be operationalized as computationally efficient OLO algorithms.<n>The associated regret and total loss upper bounds are "additively sharp", meaning that they surpass the conventional big-O optimality.<n>Our algorithm improves upon the total loss upper bounds of online gradient descent (OGD) and multiplicative weight update (MWU)
  arXiv  Detail & Related papers  (2026-02-06T09:50:15Z)
• Optimizing LOCC Protocols on Product Stiefel Manifold [3.7715498552640434]
  Local operations and classical communication (LOCC) is a foundational framework in quantum information from both theoretical and experimental perspectives.<n>We develop a framework to optimize fixed-round LOCC via Riemannian optimization on the product Stiefel manifold.<n>We demonstrate the applicability of this framework through key tasks in quantum information processing, such as entanglement distillation and state merging.
  arXiv  Detail & Related papers  (2025-10-08T11:43:47Z)
• Learn to Relax with Large Language Models: Solving Nonlinear Combinatorial Optimization Problems via Bidirectional Coevolution [10.160534429260228]
  We introduce the first end-to-end textbfAutomated textbfConst textbfOptimization (AutoCO) method, which revolutionizes NCOPs resolution through learning to relax with code.
  arXiv  Detail & Related papers  (2025-09-16T03:59:51Z)
• Advancing CMA-ES with Learning-Based Cooperative Coevolution for Scalable Optimization [12.899626317088885]
  This paper introduces LCC, a pioneering learning-based cooperative coevolution framework.<n> LCC dynamically schedules decomposition strategies during optimization processes.<n>It offers certain advantages over state-of-the-art baselines in terms of optimization effectiveness and resource consumption.
  arXiv  Detail & Related papers  (2025-04-24T14:09:22Z)
• SCOOP: A Quantum-Computing Framework for Constrained Combinatorial Optimization [0.0]
  We present SCOOP, a novel framework for solving constrained optimization problems.<n>SCOOP transforms a constrained problem into an unconstrained counterpart, forming SCOOP problem twins.<n>We demonstrate the framework on three NP-hard problems, Minimum Dominating Set, Minimum Maximal Matching, and Minimum Set Cover.
  arXiv  Detail & Related papers  (2025-04-15T06:17:23Z)
• Offline Learning for Combinatorial Multi-armed Bandits [56.96242764723241]
  Off-CMAB is the first offline learning framework for CMAB.<n>Off-CMAB combines pessimistic reward estimations with solvers.<n>Experiments on synthetic and real-world datasets highlight the superior performance of CLCB.
  arXiv  Detail & Related papers  (2025-01-31T16:56:18Z)
• Optimal Second-Order Rates for Quantum Information Decoupling [14.932939960009605]
  We consider the standard quantum information decoupling, in which Alice aims to decouple her system from the environment by local operations and discarding some of her systems. We find an achievability bound in entanglement distillation protocol, where the objective is for Alice and Bob to transform their quantum state to maximally entangled state with largest possible dimension.
  arXiv  Detail & Related papers  (2024-03-21T12:06:30Z)
• Quantum advantage in a unified scenario and secure detection of resources [55.2480439325792]
  We consider a single task to study different approaches of having quantum advantage. We show that the optimal success probability in the overall process for a qubit communication might be higher than that for a cbit communication.
  arXiv  Detail & Related papers  (2023-09-22T23:06:20Z)
• Probabilistic pure state conversion on the majorization lattice [0.0]
  Entanglement is among the most fundamental-and at the same time puzzling-properties of quantum physics. We show that the majorization lattice provides an efficient framework in order to characterize the allowed transformations of pure entangled states.
  arXiv  Detail & Related papers  (2023-03-17T16:10:50Z)
• TAMUNA: Doubly Accelerated Distributed Optimization with Local Training, Compression, and Partial Participation [53.84175614198885]
  In distributed optimization and learning, several machines alternate between local computations in parallel and communication with a distant server. We propose TAMUNA, the first algorithm for distributed optimization that leveraged the two strategies of local training and compression jointly and allows for partial participation.
  arXiv  Detail & Related papers  (2023-02-20T08:37:44Z)
• UNETR++: Delving into Efficient and Accurate 3D Medical Image Segmentation [93.88170217725805]
  We propose a 3D medical image segmentation approach, named UNETR++, that offers both high-quality segmentation masks as well as efficiency in terms of parameters, compute cost, and inference speed. The core of our design is the introduction of a novel efficient paired attention (EPA) block that efficiently learns spatial and channel-wise discriminative features. Our evaluations on five benchmarks, Synapse, BTCV, ACDC, BRaTs, and Decathlon-Lung, reveal the effectiveness of our contributions in terms of both efficiency and accuracy.
  arXiv  Detail & Related papers  (2022-12-08T18:59:57Z)
• Nesterov Meets Optimism: Rate-Optimal Separable Minimax Optimization [108.35402316802765]
  We propose a new first-order optimization algorithm -- AcceleratedGradient-OptimisticGradient (AG-OG) Ascent. We show that AG-OG achieves the optimal convergence rate (up to a constant) for a variety of settings. We extend our algorithm to extend the setting and achieve the optimal convergence rate in both bi-SC-SC and bi-C-SC settings.
  arXiv  Detail & Related papers  (2022-10-31T17:59:29Z)
• Non-interactive XOR quantum oblivious transfer: optimal protocols and their experimental implementations [0.0]
  Oblivious transfer (OT) is an important cryptographic primitive. We present an optimal protocol, which outperforms classical protocols. We optically implement both the unreversed and the reversed protocols, and cheating strategies, noting that the reversed protocol is easier to implement.
  arXiv  Detail & Related papers  (2022-09-22T20:28:39Z)
• Quantum cryptography with classical communication: parallel remote state preparation for copy-protection, verification, and more [125.99533416395765]
  Many cryptographic primitives are two-party protocols, where one party, Bob, has full quantum computational capabilities, and the other party, Alice, is only required to send random BB84 states to Bob. We show how such protocols can generically be converted to ones where Alice is fully classical, assuming that Bob cannot efficiently solve the LWE problem. This means that all communication between (classical) Alice and (quantum) Bob is classical, yet they can still make use of cryptographic primitives that would be impossible if both parties were classical.
  arXiv  Detail & Related papers  (2022-01-31T18:56:31Z)
• Limits on sequential sharing of nonlocal advantage of quantum coherence [13.46516066673]
  We show how many observers can share the nonlocal advantage of quantum coherence (NAQC) in a $(dtimes d)$-dimensional state. Results may shed light on the interplay between nonlocal correlations and quantum measurements on high-dimensional systems.
  arXiv  Detail & Related papers  (2022-01-31T07:08:13Z)
• Faster Algorithm and Sharper Analysis for Constrained Markov Decision Process [56.55075925645864]
  The problem of constrained decision process (CMDP) is investigated, where an agent aims to maximize the expected accumulated discounted reward subject to multiple constraints. A new utilities-dual convex approach is proposed with novel integration of three ingredients: regularized policy, dual regularizer, and Nesterov's gradient descent dual. This is the first demonstration that nonconcave CMDP problems can attain the lower bound of $mathcal O (1/epsilon)$ for all complexity optimization subject to convex constraints.
  arXiv  Detail & Related papers  (2021-10-20T02:57:21Z)
• Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
  Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks. Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts. We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
  arXiv  Detail & Related papers  (2021-06-11T18:00:09Z)
• Lower Bounds and Optimal Algorithms for Smooth and Strongly Convex Decentralized Optimization Over Time-Varying Networks [79.16773494166644]
  We consider the task of minimizing the sum of smooth and strongly convex functions stored in a decentralized manner across the nodes of a communication network. We design two optimal algorithms that attain these lower bounds. We corroborate the theoretical efficiency of these algorithms by performing an experimental comparison with existing state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-06-08T15:54:44Z)
• Universal Online Convex Optimization Meets Second-order Bounds [74.0120666722487]
  We propose a simple strategy for universal online convex optimization. The key idea is to construct a set of experts to process the original online functions, and deploy a meta-algorithm over the linearized losses. In this way, we can plug in off-the-shelf online solvers as black-box experts to deliver problem-dependent regret bounds.
  arXiv  Detail & Related papers  (2021-05-08T11:43:49Z)
• Quantifying the performance of bidirectional quantum teleportation [6.345523830122166]
  Bidirectional teleportation is a fundamental protocol for exchanging quantum information between two parties. We develop two ways of quantifying the simulation error of unideal bidirectional teleportation. We find semi-definite programming lower bounds on the simulation error of unideal bidirectional teleportation.
  arXiv  Detail & Related papers  (2020-10-15T17:36:17Z)
• Gaussian conversion protocols for cubic phase state generation [104.23865519192793]
  Universal quantum computing with continuous variables requires non-Gaussian resources. The cubic phase state is a non-Gaussian state whose experimental implementation has so far remained elusive. We introduce two protocols that allow for the conversion of a non-Gaussian state to a cubic phase state.
  arXiv  Detail & Related papers  (2020-07-07T09:19:49Z)

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.