Universal quantum resource distillation via composite generalised quantum Stein's lemma

• URL: http://arxiv.org/abs/2605.15174v1
• Date: Thu, 14 May 2026 17:57:05 GMT
• Title: Universal quantum resource distillation via composite generalised quantum Stein's lemma
• Abstract summary: 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.
• Score: 11.278903078792915
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The performance of quantum resource manipulation protocols, including key examples such as distillation of quantum entanglement, is measured in terms of the rate at which desired target states can be produced from a given noisy state. However, to achieve optimal rates, known protocols require precise tailoring to the quantum state in question, demanding a perfect knowledge of the input and allowing no errors in its preparation. Here we show that distillation of quantum resources in the framework of resource non-generating operations can be performed universally: optimal rates of distillation can be achieved with no knowledge of the input state whatsoever, certifying the robustness of quantum resource distillation. The findings apply in particular to the purification of quantum entanglement under non-entangling maps, where the optimal rates are governed by the regularised relative entropy of entanglement. Our result relies on an extension of the generalised quantum Stein's lemma in quantum hypothesis testing to a composite setting where the null hypothesis is no longer a fixed quantum state, but is rather composed of i.i.d. copies of an unknown state. The solution of this asymptotic problem is made possible through new developments in one-shot quantum information and a refinement of the blurring technique from [Lami, arXiv:2408.06410].

Related papers

• Optimal tomography of bosonic and fermionic Gaussian states [9.874317705613292]
  We show that both bosonic and fermionic Gaussian states can be learned using a number of copies that scales quadratically in the number of modes.<n>We derive these results by using the representation theory of Gaussian unitaries and by putting forth a generalization of the random purification channel to this setting and beyond.
  arXiv  Detail & Related papers  (2026-07-13T17:37:46Z)
• 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)
• Solving an Industrially Relevant Quantum Chemistry Problem on Quantum Hardware [31.15746974078601]
  We calculate the lowest energy eigenvalue of active space Hamiltonians of industrially relevant and strongly correlated metal chelates on trapped ion quantum hardware. We are able to achieve chemical accuracy by training a variational quantum algorithm on quantum hardware, followed by a classical diagonalization in the subspace of states measured as outputs of the quantum circuit.
  arXiv  Detail & Related papers  (2024-08-20T12:50:15Z)
• Generalized Quantum Stein's Lemma and Second Law of Quantum Resource Theories [47.02222405817297]
  A fundamental question in quantum information theory is whether an analogous second law can be formulated to characterize the convertibility of resources for quantum information processing by a single function.<n>In 2008, a promising formulation was proposed, linking resource convertibility to the optimal performance of a variant of the quantum version of hypothesis testing.<n>In 2023, a logical gap was found in the original proof of this lemma, casting doubt on the possibility of such a formulation of the second law.
  arXiv  Detail & Related papers  (2024-08-05T18:00:00Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• Estimate distillable entanglement and quantum capacity by squeezing useless entanglement [5.086696108576776]
  Quantum Internet relies on quantum entanglement as a fundamental resource for secure and efficient quantum communication. It remains challenging to accurately estimate the distillable entanglement and its closely related essential quantity, the quantum capacity. We propose efficiently computable upper bounds for both quantities based on the idea that the useless entanglement within a state or a quantum channel does not contribute to the distillable entanglement or the quantum capacity.
  arXiv  Detail & Related papers  (2023-03-13T16:02:18Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• Sparse random Hamiltonians are quantumly easy [105.6788971265845]
  A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. This paper shows that, for most random Hamiltonians, the maximally mixed state is a sufficiently good trial state. Phase estimation efficiently prepares states with energy arbitrarily close to the ground energy.
  arXiv  Detail & Related papers  (2023-02-07T10:57:36Z)
• 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)
• 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)
• 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)

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.