Related papers: Asymptotically optimal purification of noisy unitary channels in any dimension

Asymptotically optimal purification of noisy unitary channels in any dimension

URL: http://arxiv.org/abs/2608.26061v1
Date: Wed, 26 Aug 2026 17:30:35 GMT
Title: Asymptotically optimal purification of noisy unitary channels in any dimension
Abstract summary: We construct a superchannel that universally purifies the noisy unitary back to the original unknown unitary.<n>We analytically derive the optimal fidelity to the leading order in the noise strength and number of channel uses.<n>Our result implies the query complexity $(d2p/)$ for achieving leading-order infidelity.
Score: 0.0
License: http://creativecommons.org/licenses/by/4.0/
Abstract: We consider the problem of noisy unitary purification. Given access to an unknown $d$-dimensional unitary channel followed by depolarizing noise of strength $p$, we aim to construct a superchannel that universally purifies the noisy unitary back to the original unknown unitary. We optimize over arbitrary adaptive sequential strategies and analytically derive the optimal fidelity to the leading order in the noise strength and number of channel uses, while also providing a concrete $\mathrm{SU}(d)$-covariant parallel strategy that attains the optimum. Our result implies the query complexity $Θ(d^2p/ε)$ for achieving leading-order infidelity $ε$ in the low-noise regime, which scales better than the naive approach combining optimal state purification and storage-and-retrieval of quantum channels. We also consider the dual problem of noisy unitary conjugation, where the goal is to obtain the best approximation of the complex conjugate of the original unknown unitary from access to noisy queries. We show that the optimal fidelity for this task coincides with that of noisy unitary purification to the leading-order in the low-noise and large-query limit.

Related papers

Scaling-optimal purification of noisy qubit unitary channels [12.189743655923008]
We construct a superchannel that purifies the noisy unitary back to the original unknown unitary.<n>We first provide numerical evidence that sequential strategies can strictly outperform parallel strategies when the number of channel uses is finite.<n>We then provide a concrete $mathrmU(2)$-covariant parallel protocol based on a novel entanglement-assisted quantum error-correcting code that suppresses the first-order noise strength.
arXiv Detail & Related papers (2026-06-10T17:55:25Z)
Second-order Optimization under Heavy-Tailed Noise: Hessian Clipping and Sample Complexity Limits [53.773695219320125]
We take a first step toward a theoretical understanding of second-order optimization under heavy-tailed noise.<n>We introduce a novel algorithm based on gradient and Hessian clipping, and prove high-probability upper bounds that nearly match the fundamental limits.
arXiv Detail & Related papers (2025-10-12T16:36:54Z)
Optimal High-probability Convergence of Nonlinear SGD under Heavy-tailed Noise via Symmetrization [50.49466204159458]
We propose two novel estimators based on the idea of noise symmetrization.<n>We provide a sharper analysis and improved rates.<n>Compared to works assuming symmetric noise with moments, we provide a sharper analysis and improved rates.
arXiv Detail & Related papers (2025-07-12T00:31:13Z)
Streaming quantum state purification for general mixed states [2.412198129884481]
We show that the same algorithm applies much more broadly, enabling the purification of arbitrary mixed states with a nondegenerate principal eigenvalue.<n>In the first approach, we show that, given the largest two eigenvalues, the depolarized noise is the most difficult noise to purify.<n>In the second approach, we provide a new and direct analysis for the performance of purification.
arXiv Detail & Related papers (2025-03-28T17:31:13Z)
Optimal twirling depths for shadow tomography in the presence of noise [0.1227734309612871]
We consider the sample complexity as a function of the depth of the circuit, in the presence of noise. We find that this noise has important implications for determining the optimal twirling ensemble. These thresholds strongly constrain the search for optimal strategies to implement shadow tomography.
arXiv Detail & Related papers (2023-11-16T19:00:01Z)
First Order Methods with Markovian Noise: from Acceleration to Variational Inequalities [91.46841922915418]
We present a unified approach for the theoretical analysis of first-order variation methods. Our approach covers both non-linear gradient and strongly Monte Carlo problems. We provide bounds that match the oracle strongly in the case of convex method optimization problems.
arXiv Detail & Related papers (2023-05-25T11:11:31Z)
Gaussian Blue Noise [49.45731879857138]
We show that a framework for producing point distributions with blue noise spectrum attains unprecedented quality. Our algorithm scales smoothly and feasibly to high dimensions while maintaining the same quality.
arXiv Detail & Related papers (2022-06-15T20:22:16Z)
High Probability Complexity Bounds for Non-Smooth Stochastic Optimization with Heavy-Tailed Noise [51.31435087414348]
It is essential to theoretically guarantee that algorithms provide small objective residual with high probability. Existing methods for non-smooth convex optimization have complexity bounds with dependence on confidence level. We propose novel stepsize rules for two methods with gradient clipping.
arXiv Detail & Related papers (2021-06-10T17:54:21Z)
Stochastic Optimization with Heavy-Tailed Noise via Accelerated Gradient Clipping [69.9674326582747]
We propose a new accelerated first-order method called clipped-SSTM for smooth convex optimization with heavy-tailed distributed noise in gradients. We prove new complexity that outperform state-of-the-art results in this case. We derive the first non-trivial high-probability complexity bounds for SGD with clipping without light-tails assumption on the noise.
arXiv Detail & Related papers (2020-05-21T17:05:27Z)

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