Postselected quantum hypothesis testing
- URL: http://arxiv.org/abs/2209.10550v2
- Date: Sat, 9 Sep 2023 15:45:25 GMT
- Title: Postselected quantum hypothesis testing
- Authors: Bartosz Regula, Ludovico Lami, Mark M. Wilde
- Abstract summary: We study a variant of quantum hypothesis testing wherein an additional 'inconclusive measurement outcome' is added.
The error probabilities are conditioned on a successful attempt, with inconclusive trials disregarded.
We prove that the error exponent of discriminating any two quantum states $rho$ and $sigma$ is given by the Hilbert projective metric $D_max(|sigma) + D_max(sigma | rho)$ in asymmetric hypothesis testing.
- Score: 9.131273927745731
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We study a variant of quantum hypothesis testing wherein an additional
'inconclusive' measurement outcome is added, allowing one to abstain from
attempting to discriminate the hypotheses. The error probabilities are then
conditioned on a successful attempt, with inconclusive trials disregarded. We
completely characterise this task in both the single-shot and asymptotic
regimes, providing exact formulas for the optimal error probabilities. In
particular, we prove that the asymptotic error exponent of discriminating any
two quantum states $\rho$ and $\sigma$ is given by the Hilbert projective
metric $D_{\max}(\rho\|\sigma) + D_{\max}(\sigma \| \rho)$ in asymmetric
hypothesis testing, and by the Thompson metric $\max \{ D_{\max}(\rho\|\sigma),
D_{\max}(\sigma \| \rho) \}$ in symmetric hypothesis testing. This endows these
two quantities with fundamental operational interpretations in quantum state
discrimination. Our findings extend to composite hypothesis testing, where we
show that the asymmetric error exponent with respect to any convex set of
density matrices is given by a regularisation of the Hilbert projective metric.
We apply our results also to quantum channels, showing that no advantage is
gained by employing adaptive or even more general discrimination schemes over
parallel ones, in both the asymmetric and symmetric settings. Our state
discrimination results make use of no properties specific to quantum mechanics
and are also valid in general probabilistic theories.
Related papers
- Hypothesis testing of symmetry in quantum dynamics [4.385096865598734]
We develop a hypothesis-testing framework for quantum dynamics symmetry using a limited number of queries.
We construct optimal ancilla-free protocols that achieve optimal type-II error probability for testing time-reversal symmetry (T-symmetry) and diagonal symmetry (Z-symmetry) with limited queries.
arXiv Detail & Related papers (2024-11-21T16:39:35Z) - Connecting classical finite exchangeability to quantum theory [69.62715388742298]
Exchangeability is a fundamental concept in probability theory and statistics.
We show how a de Finetti-like representation theorem for finitely exchangeable sequences requires a mathematical representation which is formally equivalent to quantum theory.
arXiv Detail & Related papers (2023-06-06T17:15:19Z) - Quantum hypothesis testing between qubit states with parity [7.586817293358619]
Two types of decision errors in a Quantum hypothesis testing (QHT) can occur.
We show that the minimal probability of type-II error occurs when the null hypothesis is accepted when it is false.
We replace one of the two pure states with a maximally mixed state, and similarly characterize the behavior of the minimal probability of type-II error.
arXiv Detail & Related papers (2022-12-04T08:30:25Z) - 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) - Analytical bounds for non-asymptotic asymmetric state discrimination [0.0]
Asymmetric state discrimination involves minimizing the probability of one type of error, subject to a constraint on the other.
We give explicit expressions bounding the set of achievable errors using the trace norm, the fidelity, and the quantum Chernoff bound.
Unlike bounds, our bounds give error values instead of exponents, so can give more precise results when applied to finite-copy state discrimination problems.
arXiv Detail & Related papers (2022-07-21T18:21:04Z) - Why we should interpret density matrices as moment matrices: the case of
(in)distinguishable particles and the emergence of classical reality [69.62715388742298]
We introduce a formulation of quantum theory (QT) as a general probabilistic theory but expressed via quasi-expectation operators (QEOs)
We will show that QT for both distinguishable and indistinguishable particles can be formulated in this way.
We will show that finitely exchangeable probabilities for a classical dice are as weird as QT.
arXiv Detail & Related papers (2022-03-08T14:47:39Z) - Tight Exponential Analysis for Smoothing the Max-Relative Entropy and
for Quantum Privacy Amplification [56.61325554836984]
The max-relative entropy together with its smoothed version is a basic tool in quantum information theory.
We derive the exact exponent for the decay of the small modification of the quantum state in smoothing the max-relative entropy based on purified distance.
arXiv Detail & Related papers (2021-11-01T16:35:41Z) - On the properties of the asymptotic incompatibility measure in
multiparameter quantum estimation [62.997667081978825]
Incompatibility (AI) is a measure which quantifies the difference between the Holevo and the SLD scalar bounds.
We show that the maximum amount of AI is attainable only for quantum statistical models characterized by a purity larger than $mu_sf min = 1/(d-1)$.
arXiv Detail & Related papers (2021-07-28T15:16:37Z) - Optimal Adaptive Strategies for Sequential Quantum Hypothesis Testing [87.17253904965372]
We consider sequential hypothesis testing between two quantum states using adaptive and non-adaptive strategies.
We show that these errors decrease exponentially with decay rates given by the measured relative entropies between the two states.
arXiv Detail & Related papers (2021-04-30T00:52:48Z) - Interpolating between symmetric and asymmetric hypothesis testing [7.741539072749043]
We define a one- parameter family of binary quantum hypothesis testing tasks, which we call $s$-hypothesis testing.
In particular, $s$-hypothesis testing interpolates between the regimes of symmetric and asymmetric hypothesis testing.
We show that if arbitrarily many identical copies of the system are assumed to be available, then the minimal error probability of $s$-hypothesis testing is shown to decay exponentially in the number of copies.
arXiv Detail & Related papers (2021-04-19T18:29:55Z) - Asymptotic relative submajorization of multiple-state boxes [0.0]
Pairs of states are the basic objects in the resource theory of asymmetric distinguishability (Wang and Wilde, 2019), where free operations are arbitrary quantum channels that are applied to both states.
We consider boxes of a fixed finite number of states and study an extension of the relative submajorization preorder to such objects.
This preorder characterizes error probabilities in the case of testing a composite null hypothesis against a simple alternative hypothesis, as well as certain error probabilities in state discrimination.
arXiv Detail & Related papers (2020-07-22T08:29:52Z)
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.