A Nonstabilizerness Resource Law for Universal Quantum State Purification

• URL: http://arxiv.org/abs/2607.08626v1
• Date: Thu, 09 Jul 2026 15:57:19 GMT
• Title: A Nonstabilizerness Resource Law for Universal Quantum State Purification
• Abstract summary: Quantum state purification aims to recover higher-fidelity quantum states from multiple noisy copies.<n>Recent no-go results show that classically simulable operations cannot achieve a nontrivial universal fidelity gain.<n>We prove an exact linear mana law in odd dimensions and a two-sided linear robustness law for multi-qubit systems.
• Score: 4.024858069868145
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum state purification aims to recover higher-fidelity quantum states from multiple noisy copies and is a fundamental primitive for quantum information processing. Magic resources enable operations beyond classically simulable dynamics and are central to universal fault-tolerant quantum computation. Recent no-go results show that classically simulable operations cannot achieve a nontrivial universal fidelity gain. This motivates a quantitative theory of the magic required for purification at prescribed success probability and target fidelity. For universal purification with two input copies, we prove an exact linear mana law in odd dimensions and a two-sided linear robustness law for multi-qubit systems, which becomes exact for a single qubit. We also identify an explicit successful purification map that makes the tradeoff transparent. These results establish universal purification as a task obeying a quantitative magic-fidelity law and link magic resources to error mitigation and fault-tolerant quantum information processing.

Related papers

• Universal quantum resource distillation via composite generalised quantum Stein's lemma [11.278903078792915]
  We show that distillation of quantum resources in the framework of resource non-generating operations can be performed universally.<n>The findings apply in particular to the purification of quantum entanglement under non-ent maps.
  arXiv  Detail & Related papers  (2026-05-14T17:57:05Z)
• Quantum-Classical Separation in Bounded-Resource Tasks Arising from Measurement Contextuality [107.84586711462556]
  We show that quantum contextuality enables certain tasks to be performed with success probabilities beyond classical limits.<n>Our work proposes novel ways to benchmark quantum processors using contextuality-based algorithms.
  arXiv  Detail & Related papers  (2025-12-01T23:54:32Z)
• No Universal Purification in Quantum Mechanics [2.398093012442426]
  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.
  arXiv  Detail & Related papers  (2025-09-25T12:56:17Z)
• 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)
• Experimental Demonstration of Logical Magic State Distillation [62.77974948443222]
  We present the experimental realization of magic state distillation with logical qubits on a neutral-atom quantum computer.<n>Our approach makes use of a dynamically reconfigurable architecture to encode and perform quantum operations on many logical qubits in parallel.
  arXiv  Detail & Related papers  (2024-12-19T18:38:46Z)
• Detection of mode-intrinsic quantum entanglement [0.0]
  We propose a witness to detect a strong form of entanglement that only non-Gaussian states possess. The strength of our witness is two-fold: it only requires measurements in one basis to check entanglement in any arbitrary mode basis.
  arXiv  Detail & Related papers  (2024-07-25T15:01:47Z)
• Unconditional quantum magic advantage in shallow circuit computation [2.517043342442487]
  Quantum theory promises computational speed-ups over classical approaches.<n>The Gottesman-Knill Theorem implies that the full power of quantum computation resides in the specific resource of "magic" states.<n>In this work, we demonstrate the first unconditional magic advantage.
  arXiv  Detail & Related papers  (2024-02-19T15:59:48Z)
• 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)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)
• 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)
• Stochastic approximate state conversion for entanglement and general quantum resource theories [41.94295877935867]
  An important problem in any quantum resource theory is to determine how quantum states can be converted into each other. Very few results have been presented on the intermediate regime between probabilistic and approximate transformations. We show that these bounds imply an upper bound on the rates for various classes of states under probabilistic transformations. We also show that the deterministic version of the single copy bounds can be applied for drawing limitations on the manipulation of quantum channels.
  arXiv  Detail & Related papers  (2021-11-24T17:29:43Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)

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.