Hypothesis testing between quantum ensembles

• URL: http://arxiv.org/abs/2608.21321v1
• Date: Fri, 21 Aug 2026 17:29:43 GMT
• Title: Hypothesis testing between quantum ensembles
• Abstract summary: Quantum state ensembles are important in quantum information processing.<n>We formulate binary hypothesis testing between finite quantum ensembles.<n>We show that discrimination is governed by the full moment hierarchy up to the number of samples.
• Score: 1.370074756133613
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum state ensembles are important in quantum information processing. For example, quantum $t$-designs model highly entangled states in complex systems, while projected ensembles appear in generative quantum machine learning and studies of thermalization. With their sample state accompanied by a classical label, these ensembles contain operational information beyond their average density operators. Yet an ensemble differs from a classical-quantum state because it is invariant under permutations of labels. We formulate binary hypothesis testing between finite quantum ensembles and derive fundamental limits on error probability. Given an observed label pattern, we show that the joint sampled state can be described by power-weighted ensemble moments. This yields the Bayes-optimal measurement and exact finite-sample error, revealing that discrimination is governed by the full moment hierarchy up to the number of samples. In the many-sample limit, we derive Chernoff bounds and obtain exact error exponents for finite uniform pure-state ensembles. We apply these results to optical communication and $t$-designs. For finite uniform pure-state $t$-designs with large $t$, the maximal discrimination exponent scales sharply as $\sim t^{-2}$, while equal-prior fixed-error testing requires $\sim t^2$ samples.

Related papers

• Universal Scaling of the Minimum Error Probability in Qualification of Quantum States [2.8195287696258196]
  Qualification of quantum states judges which of two sets of quantum states an unknown state lies in, where the two sets are labeled by two distinct parameter regions.<n>We show that the $N$-copy permutation symmetry and the geometric symmetries of the parameter regions identify the optimal measurements and the "worst pairwise states"<n>Our approach determines whether a quantum state belongs to a given set without full state tomography, thereby enabling qualification of large ensembles using finite samples.
  arXiv  Detail & Related papers  (2026-08-05T14:00:45Z)
• Optimal Error Exponents for Composite Sequential Quantum Hypothesis Testing [1.376408511310322]
  We propose a mixture-sequential quantum probability ratio test that adaptively selects measurements based on the current mixture estimate of the alternative set.<n>Under an expected sample size constraint, we show that our proposed strategy simultaneously achieves the Type-I and (worst-case) Type-II error exponents.
  arXiv  Detail & Related papers  (2026-05-06T13:44:17Z)
• Hierarchy of discriminative power and complexity in learning quantum ensembles [15.100044984577915]
  We introduce a hierarchy of integral probability metrics, termed MMD-$k$, which generalizes the maximum mean discrepancy to quantum ensembles.<n>We show that for pure-state ensembles of size $N$, estimating MMD-$k$ using experimentally feasible SWAP-test-based estimators requires $(N2-2/k)$ samples for constant $k$, and $(N3)$ samples for constant $k$.
  arXiv  Detail & Related papers  (2026-01-29T17:13:48Z)
• Generalized quantum Chernoff bound [1.8371802327210847]
  We establish a quantum Chernoff bound for the discrimination of multiple sets of quantum states.<n>We show that discriminating between sets of quantum states is no harder than discriminating between their worst-case elements in terms of error probability.
  arXiv  Detail & Related papers  (2025-08-18T12:41:04Z)
• Detecting quantum non-Gaussianity with a single quadrature [0.5242869847419834]
  We show that the statistics of a single quadrature measurement can witness arbitrary degrees of non-Gaussianity as quantified by stellar rank.<n>We provide an analysis of sample complexity, noise robustness, and experimental prospects.
  arXiv  Detail & Related papers  (2025-07-30T18:09:46Z)
• 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)
• Optimal lower bounds for Quantum Learning via Information Theory [3.093890460224435]
  We derive optimal lower bounds for quantum sample complexity in both the PAC and models via an information-theoretic approach. We then turn to a quantum analogue of the Coupon Collector problem, a classic problem from probability theory. All the aspects of the Quantum Coupon Collector problem we study rest on properties of the spectrum of the associated Gram matrix.
  arXiv  Detail & Related papers  (2023-01-05T18:55:04Z)
• Validation tests of GBS quantum computers give evidence for quantum advantage with a decoherent target [62.997667081978825]
  We use positive-P phase-space simulations of grouped count probabilities as a fingerprint for verifying multi-mode data. We show how one can disprove faked data, and apply this to a classical count algorithm.
  arXiv  Detail & Related papers  (2022-11-07T12:00:45Z)
• Efficient Bipartite Entanglement Detection Scheme with a Quantum Adversarial Solver [89.80359585967642]
  Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits. We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
  arXiv  Detail & Related papers  (2022-03-15T09:46:45Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• Bose-Einstein condensate soliton qubit states for metrological applications [58.720142291102135]
  We propose novel quantum metrology applications with two soliton qubit states. Phase space analysis, in terms of population imbalance - phase difference variables, is also performed to demonstrate macroscopic quantum self-trapping regimes.
  arXiv  Detail & Related papers  (2020-11-26T09:05:06Z)
• Quantum Communication Complexity of Distribution Testing [114.31181206328276]
  Two players each receive $t$ samples from one distribution over $[n]$. The goal is to decide whether their two distributions are equal, or are $epsilon$-far apart. We show that the quantum communication complexity of this problem is $tildeO$(tepsilon2))$ qubits when distributions have low $l$-norm.
  arXiv  Detail & Related papers  (2020-06-26T09:05:58Z)

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.