CyberIntel ⬡ News
★ Saved ◆ Cyber Reads
← Back ◌ Quantum Computing Apr 09, 2026

Probabilistic and approximate universal quantum purification machines

arXiv Quantum Archived Apr 09, 2026 ✓ Full text saved

arXiv:2604.06325v1 Announce Type: new Abstract: We study the task of lifting arbitrary quantum states and channels to purifications and Stinespring dilations, respectively, in both the probabilistic exact and deterministic approximate settings. We formalize this task through a general framework of quantum purification machines that, given a finite number of copies or uses of a black-box input, aim to output a corresponding purification or Stinespring dilation. In the probabilistic exact setting,

Full text archived locally
✦ AI Summary · Claude Sonnet


    Quantum Physics [Submitted on 7 Apr 2026] Probabilistic and approximate universal quantum purification machines Zoe G. del Toro, Jessica Bavaresco We study the task of lifting arbitrary quantum states and channels to purifications and Stinespring dilations, respectively, in both the probabilistic exact and deterministic approximate settings. We formalize this task through a general framework of quantum purification machines that, given a finite number of copies or uses of a black-box input, aim to output a corresponding purification or Stinespring dilation. In the probabilistic exact setting, we show that universality is not necessary to rule out such transformations: the simple requirement that a machine purifies two inputs of different rank with non-zero probability already implies that it cannot be described by a linear positive map. This simple argument captures a fundamental obstruction of quantum theory and recovers the impossibility of universal probabilistic purification from finitely many copies. In the approximate setting, we allow for general machines that are not required, in general, to produce a pure output. Using the minimum average error as our figure of merit, we derive analytical expressions for the performance of several physically motivated strategies as well as a general upper bound on the achievable error, which is tight in a specific regime. Our analysis reveals a trade-off: strategies that produce a pure output - among which we prove the optimal to be a strategy that produces as a fixed output a maximally entangled purification of the fully depolarizing channel - perform optimally between those considered for large environment dimension, while append-environment strategies that generally produce non-pure outputs perform better at small environment dimension. Comments: 13 + 17 pages, 4 + 3 figures Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2604.06325 [quant-ph]   (or arXiv:2604.06325v1 [quant-ph] for this version)   https://doi.org/10.48550/arXiv.2604.06325 Focus to learn more Submission history From: Zoe Garcia Del Toro [view email] [v1] Tue, 7 Apr 2026 18:01:03 UTC (258 KB) Access Paper: HTML (experimental) view license Current browse context: quant-ph < prev   |   next > new | recent | 2026-04 References & Citations INSPIRE HEP NASA ADS Google Scholar Semantic Scholar Export BibTeX Citation Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Demos Related Papers About arXivLabs Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
    💬 Team Notes
    Article Info
    Source
    arXiv Quantum
    Category
    ◌ Quantum Computing
    Published
    Apr 09, 2026
    Archived
    Apr 09, 2026
    Full Text
    ✓ Saved locally
    Open Original ↗