High-Dimensional Carrier-Assisted Entanglement Purification Based on Mutually Unbiased Bases

• URL: http://arxiv.org/abs/2605.20958v2
• Date: Mon, 25 May 2026 04:10:11 GMT
• Title: High-Dimensional Carrier-Assisted Entanglement Purification Based on Mutually Unbiased Bases
• Abstract summary: We introduce a deterministic pre-processing scheme based on mutually unbiased bases (MUB)<n>We rigorously prove that the MUB-adapted mCAEPP yields fidelity for any two-qutrit Pauli channel with initial fidelity $p_00>(d-1)/ (2d)$.
• Score: 4.146329485823113
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Distilling high-dimensional quantum entanglement under realistic, general asymmetric noise remains a formidable challenge. Standard entanglement purification protocols inevitably fail to satisfy convergence constraints under severe asymmetric noise. In this paper, we investigate carrier-assisted entanglement purification protocols, namely CAEPP and mCAEPP, first for two-qutrit systems, demonstrating that without adaptive pre-processing, convergence is strictly bottlenecked by marginal $X$-error probabilities. To overcome this limitation, we introduce a deterministic pre-processing scheme based on mutually unbiased bases (MUBs). By actively rotating the qutrit phase space to establish primary-axis error dominance, we rigorously prove that, conditioned on successful syndrome outcomes, the MUB-adapted mCAEPP yields unit asymptotic fidelity for any two-qutrit Pauli channel with initial fidelity $p_{00} > 1/3$. We further extend the algebraic carrier-assisted framework and the asymmetric-noise bottleneck to arbitrary qudit dimensions, and show that in prime-power dimensions the MUB-geometric preprocessing gives the sufficient high-dimensional threshold $p_{00}>(d-1)/(2d)$.

Related papers

• Central Limit Theorem for Two-Time-Scale Approximate Distributionally Robust RL [8.809468023364703]
  Design of robust reinforcement learning algorithms poses fundamental challenges.<n>We propose an approximate DRRL framework based on a first-order expansion of the relevant robust functional.<n>To learn the fixed point of this approximate equation, we propose Mean-Variance Approximation (MVSA)
  arXiv  Detail & Related papers  (2026-05-08T19:24:28Z)
• Structured Quantum Optimal Control under Bandwidth and Smoothness Constraints-An Inexact Proximal-ADMM Approach for Low-Complexity Pulse Synthesis [0.0]
  I study an inexact Proximal-ADMM framework that combines gate-infidelity with sparsity, total-variation regularization, explicit band-limit projection, and box constraints in a single loop.<n>It is benchmarked against GRAPE, standard Krotov, and L-BFGS-B on a single-qubit $X$ gate, a leakage-prone qutrit task, and a two-qubit entangling gate.<n>The contribution should still be read as a numerical framework for constrained pulse synthesis rather than as a finished route to immediately deployable high-fidelity gates
  arXiv  Detail & Related papers  (2026-03-13T14:27:40Z)
• Regularized Online RLHF with Generalized Bilinear Preferences [68.44113000390544]
  We consider the problem of contextual online RLHF with general preferences.<n>We adopt the Generalized Bilinear Preference Model to capture preferences via low-rank, skew-symmetric matrices.<n>We prove that the dual gap of the greedy policy is bounded by the square of the estimation error.
  arXiv  Detail & Related papers  (2026-02-26T15:27:53Z)
• Stability and Generalization of Push-Sum Based Decentralized Optimization over Directed Graphs [55.77845440440496]
  Push-based decentralized communication enables optimization over communication networks, where information exchange may be asymmetric.<n>We develop a unified uniform-stability framework for the Gradient Push (SGP) algorithm.<n>A key technical ingredient is an imbalance-aware generalization bound through two quantities.
  arXiv  Detail & Related papers  (2026-02-24T05:32:03Z)
• Information Fidelity in Tool-Using LLM Agents: A Martingale Analysis of the Model Context Protocol [69.11739400975445]
  We introduce the first theoretical framework for analyzing error accumulation in Model Context Protocol (MCP) agents.<n>We show that cumulative distortion exhibits linear growth and high-probability deviations bounded by $O(sqrtT)$.<n>Key findings include: semantic weighting reduces distortion by 80%, and periodic re-grounding approximately every 9 steps suffices for error control.
  arXiv  Detail & Related papers  (2026-02-10T21:08:53Z)
• Ordinal Label-Distribution Learning with Constrained Asymmetric Priors for Imbalanced Retinal Grading [9.147336466586017]
  Diabetic retinopathy grading is inherently ordinal and long-tailed.<n>We propose the Constrained Asymmetric Prior Wasserstein Autoencoder (CAP-WAE)<n>CAP-WAE consistently achieves state-of-the-art Quadratic Weighted Kappa, accuracy, and macro-F1.
  arXiv  Detail & Related papers  (2025-09-30T11:58:49Z)
• Unsupervised Conformal Inference: Bootstrapping and Alignment to Control LLM Uncertainty [49.19257648205146]
  We propose an unsupervised conformal inference framework for generation.<n>Our gates achieve close-to-nominal coverage and provide tighter, more stable thresholds than split UCP.<n>The result is a label-free, API-compatible gate for test-time filtering.
  arXiv  Detail & Related papers  (2025-09-26T23:40:47Z)
• Revisiting Follow-the-Perturbed-Leader with Unbounded Perturbations in Bandit Problems [60.58442311545223]
  Follow-the-Regularized-Leader (FTRL) policies have achieved Best-of-Both-Worlds (BOBW) results in various settings through hybrid regularizers.<n>We revisit classical FTRL-FTPL duality for unbounded perturbations and establish BOBW results for FTPL under a broad family of asymmetric Fr'echet-type perturbations.
  arXiv  Detail & Related papers  (2025-08-26T02:12:18Z)
• Finite-Sample Analysis of Policy Evaluation for Robust Average Reward Reinforcement Learning [50.81240969750462]
  We present first finite-sample analysis of policy evaluation in robust average Markov Decision Processes (PMDs)<n>We show that the robust Bellman operator is a contraction under a carefully constructed semi-norm, and developing a framework with controlled bias.<n>Our method achieves the order-optimal sample complexity of $tildemathcalO(epsilon-2)$ for robust policy evaluation and robust average reward estimation.
  arXiv  Detail & Related papers  (2025-02-24T03:55:09Z)
• Stable Symmetry-Protected Topological Phases in Systems with Heralded Noise [0.0]
  We present a family of local quantum channels whose steady-states exhibit stable mixed-state symmetry-protected topological (SPT) order.<n>We construct a correction protocol that confines errors into short-ranged pairs in the steady-state.<n>As the rate of heralded noise increases, SPT order is eventually lost through a directed percolation transition.
  arXiv  Detail & Related papers  (2024-04-25T18:21:48Z)
• Efficient and robust certification of genuine multipartite entanglement in noisy quantum error correction circuits [58.720142291102135]
  We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME) We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME. We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
  arXiv  Detail & Related papers  (2020-10-06T18:00:07Z)

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.