Optimizing LOCC Protocols on Product Stiefel Manifold

• URL: http://arxiv.org/abs/2510.06909v1
• Date: Wed, 08 Oct 2025 11:43:47 GMT
• Title: Optimizing LOCC Protocols on Product Stiefel Manifold
• Authors: Ze-Tong Li, Xin Wang,
• Abstract summary: 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.
• Score: 3.7715498552640434
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Local operations and classical communication (LOCC) is a foundational framework in quantum information from both theoretical and experimental perspectives. However, designing and optimizing LOCC protocols is intractable due to their complex structure. Determining achievable bounds and designing practically implementable LOCC protocols remain crucial challenges when the number of communication rounds is finite. In this work, we develop a framework to optimize fixed-round LOCC via Riemannian optimization on the product Stiefel manifold, which not only yields near-optimal objective function values but also produces fully implementable protocols. We demonstrate the applicability of this framework through key tasks in quantum information processing, such as entanglement distillation and state merging. Our results provide new insights into the achievable bounds for entanglement distillation and block entanglement state merging. We obtain improved distillation and state merging protocols, some of which match the upper bounds derived via positive partial transpose relaxations. These results demonstrate that optimizing LOCC via manifold optimization can serve as a powerful tool to advance research on distributed quantum information processing.

Related papers

• Rectifying LLM Thought from Lens of Optimization [48.98086817378953]
  Long chain-of-thought (CoT) prompting enables thorough exploration and deliberation.<n>Despite advances, long-CoT LLMs often exhibit suboptimal reasoning behaviors.<n>We introduce RePro, a novel approach to refine LLM reasoning during post-training.
  arXiv  Detail & Related papers  (2025-12-01T17:41:08Z)
• Unleashing Scientific Reasoning for Bio-experimental Protocol Generation via Structured Component-based Reward Mechanism [26.631284893550056]
  We introduce SciRecipe, a large-scale dataset of over 12K structured protocols spanning 27 biological subfields.<n>To further improve protocol generation, we propose the "Sketch-and-Fill" paradigm, which separates analysis, structuring, and expression.<n>We develop Thoth, trained through a staged Knowledge-to-Action process that progresses from knowledge acquisition to operational reasoning.
  arXiv  Detail & Related papers  (2025-10-17T12:47:50Z)
• Dynamic LOCC Circuits for Automated Entanglement Manipulation [8.101659301140087]
  We propose a general and flexible framework called dynamic LOCCNet to simulate and design LOCC protocols.<n>We demonstrate its effectiveness in two key applications: entanglement distillation and distributed state discrimination.<n>This work advances our understanding of the capabilities and limitations of LOCC while providing a powerful methodology for protocol design.
  arXiv  Detail & Related papers  (2025-09-09T15:14:43Z)
• 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)
• Implementing transferable annealing protocols for combinatorial optimisation on neutral atom quantum processors: a case study on smart-charging of electric vehicles [1.53934570513443]
  In this paper we build on the promising potential of parameter transferability across problem instances with similar local structures.<n>Our study reveals that, for maximum independent set problems on graph families with shared geometries, optimal parameters naturally concentrate.<n> Experimental results on the Orion Alpha platform validate the effectiveness of our approach, scaling to problems with up to $100$ qubits.
  arXiv  Detail & Related papers  (2024-11-25T18:41:02Z)
• Large Language Models to Enhance Bayesian Optimization [57.474613739645605]
  We present LLAMBO, a novel approach that integrates the capabilities of Large Language Models (LLM) within Bayesian optimization. At a high level, we frame the BO problem in natural language, enabling LLMs to iteratively propose and evaluate promising solutions conditioned on historical evaluations. Our findings illustrate that LLAMBO is effective at zero-shot warmstarting, and enhances surrogate modeling and candidate sampling, especially in the early stages of search when observations are sparse.
  arXiv  Detail & Related papers  (2024-02-06T11:44:06Z)
• Convex Optimization Approaches to Optimal Teleportation Fidelity in Linear Three-Party Networks [0.0]
  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.
  arXiv  Detail & Related papers  (2024-01-30T17:35:00Z)
• Constrained Bayesian Optimization Under Partial Observations: Balanced Improvements and Provable Convergence [6.461785985849886]
  We endeavor to design an efficient and provable method for expensive POCOPs under the framework of constrained Bayesian optimization. We present an improved design of the acquisition functions that introduces balanced exploration during optimization. We propose a Gaussian process embedding different likelihoods as the surrogate model for a partially observable constraint.
  arXiv  Detail & Related papers  (2023-12-06T01:00:07Z)
• BOtied: Multi-objective Bayesian optimization with tied multivariate ranks [33.414682601242006]
  In this paper, we show a natural connection between non-dominated solutions and the extreme quantile of the joint cumulative distribution function. Motivated by this link, we propose the Pareto-compliant CDF indicator and the associated acquisition function, BOtied. Our experiments on a variety of synthetic and real-world problems demonstrate that BOtied outperforms state-of-the-art MOBO acquisition functions.
  arXiv  Detail & Related papers  (2023-06-01T04:50:06Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• 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)
• Optimization-Inspired Learning with Architecture Augmentations and Control Mechanisms for Low-Level Vision [74.9260745577362]
  This paper proposes a unified optimization-inspired learning framework to aggregate Generative, Discriminative, and Corrective (GDC) principles. We construct three propagative modules to effectively solve the optimization models with flexible combinations. Experiments across varied low-level vision tasks validate the efficacy and adaptability of GDC.
  arXiv  Detail & Related papers  (2020-12-10T03:24:53Z)

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.