Scaling-optimal purification of noisy qubit unitary channels

• URL: http://arxiv.org/abs/2606.12394v1
• Date: Wed, 10 Jun 2026 17:55:25 GMT
• Title: Scaling-optimal purification of noisy qubit unitary channels
• Abstract summary: 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.
• Score: 12.189743655923008
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We consider the problem of purifying noisy qubit unitary channels. Given the ability to apply an unknown qubit unitary channel followed by depolarizing noise, we aim to construct a superchannel that purifies the noisy unitary back to the original unknown unitary. We first provide numerical evidence that sequential strategies can strictly outperform parallel strategies when the number of channel uses is finite, highlighting the fundamental distinction from state purification. We then provide a concrete $\mathrm{U}(2)$-covariant parallel protocol based on a novel entanglement-assisted quantum error-correcting code that suppresses the first-order noise strength as $O(1/n)$ with $n$ channel uses and show this scaling is asymptotically optimal in the low-noise regime, even when sequential strategies are allowed.

Related papers

• Asymptotically optimal purification of noisy unitary channels in any dimension [0.0]
  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.
  arXiv  Detail & Related papers  (2026-08-26T17:30:35Z)
• The Gain-Engineered Transmon [68.89136228609398]
  We introduce and experimentally realize a noise-biased qubit in a standard transmon-readout resonator circuit.<n>Our results open a path towards using this system as a simple building-block for hardware-efficient quantum error detection and correction schemes.
  arXiv  Detail & Related papers  (2026-08-26T17:00:42Z)
• Convex combinations of bosonic pure-loss channels [4.458381173954051]
  We show that entanglement distribution and quantum key distribution can always be achieved at a strictly positive rate over any fading channel.<n>We identify regimes where the coherent information of thermal inputs vanishes, while optimized non-Gaussian states achieve strictly positive values.
  arXiv  Detail & Related papers  (2026-04-29T16:42:12Z)
• 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)
• Classical capacity of quantum non-Gaussian attenuator and amplifier channels [0.8409980020848168]
  We consider a quantum bosonic channel that couples the input mode via a beam splitter or two-mode squeezer to an environmental mode prepared in an arbitrary state. We investigate the classical capacity of this channel, which we call a non-Gaussian attenuator or amplifier channel.
  arXiv  Detail & Related papers  (2023-12-25T06:05:51Z)
• Rethinking SIGN Training: Provable Nonconvex Acceleration without First- and Second-Order Gradient Lipschitz [66.22095739795068]
  Sign-based methods have gained attention due to their ability to achieve robust performance despite only using only the sign information for parameter updates. The current convergence analysis of sign-based methods relies on the strong assumptions of first-order acceleration and second-order acceleration. In this paper we analyze their convergence under more realistic assumptions of first- and second-order acceleration.
  arXiv  Detail & Related papers  (2023-10-23T06:48:43Z)
• Scalable noisy quantum circuits for biased-noise qubits [37.69303106863453]
  We consider biased-noise qubits affected only by bit-flip errors, which is motivated by existing systems of stabilized cat qubits. For realistic noise models, phase-flip will not be negligible, but in the Pauli-Twirling approximation, we show that our benchmark could check the correctness of circuits containing up to $106$ gates.
  arXiv  Detail & Related papers  (2023-05-03T11:27:50Z)
• Doubly optimal parallel wire cutting without ancilla qubits [0.4394730767364254]
  A restriction in the quality and quantity of available qubits presents a substantial obstacle to the application of near-term and early fault-tolerant quantum computers. This paper studies the problem of decomposing the parallel $n$-qubit identity channel into a set of local operations and classical communication. We give an optimal wire-cutting method comprised of channels based on mutually unbiased bases, that achieves minimal overheads in both the sampling overhead and the number of channels.
  arXiv  Detail & Related papers  (2023-03-13T17:59:18Z)
• Channel Simulation: Finite Blocklengths and Broadcast Channels [13.561997774592667]
  We study channel simulation under common randomness assistance in the finite-blocklength regime. We identify the smooth channel max-information as a linear program one-shot converse on the minimal simulation cost for fixed error tolerance.
  arXiv  Detail & Related papers  (2022-12-22T13:08:55Z)
• Suppressing Amplitude Damping in Trapped Ions: Discrete Weak Measurements for a Non-unitary Probabilistic Noise Filter [62.997667081978825]
  We introduce a low-overhead protocol to reverse this degradation. We present two trapped-ion schemes for the implementation of a non-unitary probabilistic filter against amplitude damping noise. This filter can be understood as a protocol for single-copy quasi-distillation.
  arXiv  Detail & Related papers  (2022-09-06T18:18:41Z)
• Revisiting Random Channel Pruning for Neural Network Compression [159.99002793644163]
  Channel (or 3D filter) pruning serves as an effective way to accelerate the inference of neural networks. In this paper, we try to determine the channel configuration of the pruned models by random search. We show that this simple strategy works quite well compared with other channel pruning methods.
  arXiv  Detail & Related papers  (2022-05-11T17:59:04Z)
• Weighted Quantum Channel Compiling through Proximal Policy Optimization [0.0]
  We propose a strategy to compile arbitrary quantum channels without using ancillary qubits. We show that our proposed algorithm can conveniently and effectively reduce the use of expensive elementary gates.
  arXiv  Detail & Related papers  (2021-11-03T18:00:03Z)
• Overhead for simulating a non-local channel with local channels by quasiprobability sampling [0.8206877486958002]
  We provide a framework for a resource reduction suitable for first-generation quantum devices. This work develops a framework for a resource reduction suitable for first-generation quantum devices.
  arXiv  Detail & Related papers  (2020-06-19T15:04:26Z)

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.