No Universal Purification in Quantum Mechanics

• URL: http://arxiv.org/abs/2509.21111v1
• Date: Thu, 25 Sep 2025 12:56:17 GMT
• Title: No Universal Purification in Quantum Mechanics
• Authors: Zhenhuan Liu, Zhenyu Du, Zhenyu Cai, Zi-Wen Liu,
• Abstract summary: We prove that the linearity and positivity of quantum mechanics impose general restrictions on quantum purification.<n>No quantum operation can transform a finite number of copies of an unknown quantum state or channel into a pure state or channel that depends on the input.
• Score: 2.398093012442426
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We prove that the linearity and positivity of quantum mechanics impose general restrictions on quantum purification, unveiling a new fundamental limitation of quantum information processing. In particular, no quantum operation can transform a finite number of copies of an unknown quantum state or channel into a pure state or channel that depends on the input, thereby ruling out an important form of universal purification in both static and dynamical settings. Relaxing the requirement of exact pure output, we further extend our result to establish quantitative sample complexity bounds for approximate purification, independent of any task details or operational constraints. To illustrate the practical consequences of this principle, we examine the task of approximately preparing pure dilation and, for the first time, prove an exponential lower bound on the required sample complexity.

Related papers

• Tight any-shot quantum decoupling [23.729027844524893]
  We prove a novel one-shot decoupling theorem formulated in terms of quantum entropy relative distance.<n>We show that this bound is ensemble-tight in quantum relative entropy distance.
  arXiv  Detail & Related papers  (2026-02-19T15:01:26Z)
• No-Go Theorems for Universal Quantum State Purification via Classically Simulable Operations [13.576795471740633]
  We investigate the limitations of classically simulable operations for quantum state purification.<n>We prove that neither deterministic nor probabilistic protocols using only classically simulable operations can achieve universal purification.<n>Our findings highlight the indispensable role of non-stabilizer resources and the inherent limitations of classically simulable operations in quantum state purification.
  arXiv  Detail & Related papers  (2025-04-10T17:03:10Z)
• Quantum extreme learning machines for photonic entanglement witnessing [30.432877421232842]
  Quantum extreme learning machines (QELMs) embody a powerful alternative for witnessing quantum entanglement.<n>We implement a photonic QELM that leverages the orbital angular momentum of photon pairs as an ancillary degree of freedom.<n>Unlike conventional methods, our approach does not require fine-tuning, precise calibration, or refined knowledge of the apparatus.
  arXiv  Detail & Related papers  (2025-02-25T16:55:35Z)
• Exponential Separations between Quantum Learning with and without Purification [0.7908933308312488]
  In quantum learning tasks, quantum memory can offer exponential reductions in statistical complexity compared to any single-copy strategies.<n>We show that such exponential reductions can also be achieved by having access to the purification of the target mixed state.
  arXiv  Detail & Related papers  (2024-10-23T09:47:43Z)
• One-Shot Min-Entropy Calculation Of Classical-Quantum States And Its Application To Quantum Cryptography [21.823963925581868]
  We develop a one-shot lower bound calculation technique for the min-entropy of a classical-quantum state.<n>It offers an alternative tight finite-data analysis for the BB84 quantum key distribution scheme.<n>It gives the best finite-key bound known to date for a variant of device independent quantum key distribution protocol.
  arXiv  Detail & Related papers  (2024-06-21T15:11:26Z)
• Computable and Faithful Lower Bound on Entanglement Cost [5.086696108576776]
  We develop computable and faithful lower bounds on the entanglement cost under quantum operations.<n>Our bounds are efficiently computable via semidefinite programming.<n>We extend our methodology to derive lower bounds on the entanglement cost of both point-to-point and bipartite quantum channels.
  arXiv  Detail & Related papers  (2023-11-17T17:07:26Z)
• Quantification of Entanglement and Coherence with Purity Detection [16.01598003770752]
  Entanglement and coherence are fundamental properties of quantum systems, promising to power near future quantum technologies. Here, we demonstrate quantitative bounds to operationally useful entanglement and coherence. Our research offers an efficient means of verifying large-scale quantum information processing.
  arXiv  Detail & Related papers  (2023-08-14T11:03:40Z)
• Universality of critical dynamics with finite entanglement [68.8204255655161]
  We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement. Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
  arXiv  Detail & Related papers  (2023-01-23T19:23:54Z)
• Approximation of the Nearest Classical-Classical State to a Quantum State [0.0]
  A revolutionary step in computation is driven by quantumness or quantum correlations, which are permanent in entanglements but often in separable states. The exact quantification of quantumness is an NP-hard problem; thus, we consider alternative approaches to approximate it. We show that the objective value decreases along the flow by proofs and numerical results.
  arXiv  Detail & Related papers  (2023-01-23T08:26:17Z)
• Real quantum operations and state transformations [44.99833362998488]
  Resource theory of imaginarity provides a useful framework to understand the role of complex numbers. In the first part of this article, we study the properties of real'' (quantum) operations in single-party and bipartite settings. In the second part of this article, we focus on the problem of single copy state transformation via real quantum operations.
  arXiv  Detail & Related papers  (2022-10-28T01:08:16Z)
• The power of noisy quantum states and the advantage of resource dilution [62.997667081978825]
  Entanglement distillation allows to convert noisy quantum states into singlets. We show that entanglement dilution can increase the resilience of shared quantum states to local noise.
  arXiv  Detail & Related papers  (2022-10-25T17:39:29Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Cost of quantum entanglement simplified [13.683637401785505]
  We introduce an entanglement measure that has a precise information-theoretic meaning as the exact cost required to prepare an entangled state. Our results bring key insights into the fundamental entanglement structure of arbitrary quantum states, and they can be used directly to assess and quantify the entanglement produced in quantum-physical experiments.
  arXiv  Detail & Related papers  (2020-07-28T14:36:23Z)

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.