Sample complexity of quantum resource testing via one-shot quantum blurring

• URL: http://arxiv.org/abs/2607.24712v1
• Date: Mon, 27 Jul 2026 17:51:15 GMT
• Title: Sample complexity of quantum resource testing via one-shot quantum blurring
• Abstract summary: Quantum resource testing is a fundamental primitive of quantum information processing.<n>We provide explicit estimates on the number of copies needed to achieve a prescribed performance.
• Score: 11.244000052204543
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum resource testing is a fundamental primitive of quantum information processing, profoundly connected to resource manipulation. Its goal is to discriminate $n$ copies of a given resourceful state $ρ$ from all free (i.e., resourceless) states; key instances for applications are entanglement testing and quantum magic testing. The asymptotic characterisation relies on the recently proven generalised quantum Stein's lemma, which establishes the rate of decay of the false negative error probability for a fixed false positive error probability. This result, however, is intrinsically asymptotic and thus can provide no finite-resource guarantees, which makes its practical implications unclear. Here, we establish the first rigorous finite-$n$ bounds on quantum resource testing and hence quantum resource manipulation, providing explicit estimates on the number of copies needed to achieve a prescribed performance. As notable consequences, we obtain (a) the convergence of the regularised Rényi relative entropies of a resource, which settles the important open problem from [Fang/Hayashi, IEEE ToIT 72:6, 2026]; and (b) the first sample-complexity bound for asymmetric resource testing: for any fixed false positive error probability, a false negative error probability of at most $δ$ can be achieved with $n=O\left(\frac{\log(1/δ)}{D^\infty(ρ\|F)}\right)$ copies of $ρ$, in the limit where $δ\to 0$.

Related papers

• Generalised quantum Stein's lemma more robust than ever [40.77349008361407]
  generalised quantum Stein's lemma is a key result in quantum hypothesis testing.<n>We establish a version of generalised quantum Stein's lemma that is conceptually much simpler and general.
  arXiv  Detail & Related papers  (2026-09-15T15:19:27Z)
• Dimension-Free Polylogarithmic Quantum Shadow Tomography from Sequential Pretty-Good Measurements [42.01011095596403]
  We give a quantum protocol for shadow tomography with sample complexity.<n>Our approach first reduces the general shadow-tomography problem to a finite-ensemble estimation problem.<n>A refined tail analysis of the resulting estimation error yields simultaneous accuracy guarantees for all observables.
  arXiv  Detail & Related papers  (2026-08-06T17:51:13Z)
• Generalised quantum Sanov theorem revisited [13.283296551055734]
  Given two families of quantum states $A$ and $B$, quantum hypothesis testing is the task of determining whether an unknown quantum state belongs to $A$ or $B$.<n>In quantum Shannon theory, a fundamental role is played by the Stein exponent, i.e. the rate of decay of the type II error probability for a given threshold on the type I error probability.<n>In this work, we establish a general formula for the Stein exponent where both hypotheses are allowed to be composite.
  arXiv  Detail & Related papers  (2025-10-07T18:05:25Z)
• Complexity Analysis of Normalizing Constant Estimation: from Jarzynski Equality to Annealed Importance Sampling and beyond [40.79840141270367]
  Given an unnormalized probability density $piproptomathrme-V$, estimating its normalizing constant $Z=int_mathbbRdmathrme-V(x)mathrmdx$ or free energy $F=-log Z$ is a crucial problem in Bayesian statistics, statistical mechanics, and machine learning.<n>We propose a new algorithm based on reverse diffusion samplers, establish a framework for analyzing its complexity, and empirically demonstrate its efficiency in tackling multimodality.
  arXiv  Detail & Related papers  (2025-02-07T00:05:28Z)
• General detectability measure [45.85698554568285]
  Distinguishing resource states from resource-free states is a fundamental task in quantum information.<n>We derived the optimal exponential decay rate of the failure probability for detecting a given $n$-tensor product state.
  arXiv  Detail & Related papers  (2025-01-16T05:39:22Z)
• Partition function estimation with a quantum coin toss [0.0]
  Estimating quantum partition functions is a critical task in a variety of fields.<n>This paper introduces a quantum algorithm for estimating the partition function $Z_beta$ of a generic Hamiltonian $H$ up to multiplicative error.
  arXiv  Detail & Related papers  (2024-11-26T19:01:19Z)
• Coherence in Property Testing: Quantum-Classical Collapses and Separations [42.44394412033434]
  We show that no tester can distinguish subset states of size $2n/8$ from $2n/4$ with probability better than $2-Theta(n)$.<n>We also show connections to disentangler and quantum-to-quantum transformation lower bounds.
  arXiv  Detail & Related papers  (2024-11-06T19:52:15Z)
• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• Hidden-State Proofs of Quantumness [1.0878040851638]
  An experimental cryptographic proof of quantumness will be a vital milestone in the progress of quantum information science. Error tolerance is a persistent challenge for implementing such tests. We present a proof of quantumness which maintains the same circuit structure as (Brakerski et al.)
  arXiv  Detail & Related papers  (2024-10-08T21:04:53Z)
• A solution of the generalised quantum Stein's lemma [6.1642231492615345]
  We prove that the Stein exponent associated with entanglement testing equals the regularised relative entropy of entanglement.<n>As a by-product, we prove that the same Stein exponent can also be achieved when the null hypothesis is only approximately i.i.d.
  arXiv  Detail & Related papers  (2024-08-12T18:00:01Z)
• The Power of Unentangled Quantum Proofs with Non-negative Amplitudes [55.90795112399611]
  We study the power of unentangled quantum proofs with non-negative amplitudes, a class which we denote $textQMA+(2)$. In particular, we design global protocols for small set expansion, unique games, and PCP verification. We show that QMA(2) is equal to $textQMA+(2)$ provided the gap of the latter is a sufficiently large constant.
  arXiv  Detail & Related papers  (2024-02-29T01:35:46Z)
• The role of shared randomness in quantum state certification with unentangled measurements [36.19846254657676]
  We study quantum state certification using unentangled quantum measurements. $Theta(d2/varepsilon2)$ copies are necessary and sufficient for state certification. We develop a unified lower bound framework for both fixed and randomized measurements.
  arXiv  Detail & Related papers  (2024-01-17T23:44:52Z)
• Heisenberg Limit beyond Quantum Fisher Information [0.0]
  Using entangled quantum states, it is possible to scale the precision with $N$ better than when resources would be used independently. I derive bounds on the precision of the estimation for the case of noiseless unitary evolution. I analyze the problem of the Heisenberg limit when multiple parameters are measured simultaneously on the same physical system.
  arXiv  Detail & Related papers  (2023-04-27T17:43:45Z)
• Quantum Heavy-tailed Bandits [36.458771174473924]
  We study multi-armed bandits (MAB) and linear bandits (SLB) with heavy-tailed rewards and quantum reward. We first propose a new quantum mean estimator for heavy-tailed distributions, which is based on the Quantum Monte Carlo Estimator. Based on our quantum mean estimator, we focus on quantum heavy-tailed MAB and SLB and propose quantum algorithms based on the Upper Confidence Bound (UCB) framework.
  arXiv  Detail & Related papers  (2023-01-23T19:23:10Z)

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.