A Converse Bound via the Nussbaum-Szkoła Mapping for Quantum Hypothesis Testing
- URL: http://arxiv.org/abs/2601.13970v1
- Date: Tue, 20 Jan 2026 13:48:28 GMT
- Title: A Converse Bound via the Nussbaum-Szkoła Mapping for Quantum Hypothesis Testing
- Authors: Jorge Lizarribar-Carrillo, Gonzalo Vazquez-Vilar, Tobias Koch,
- Abstract summary: This paper introduces a novel lower bound for asymmetric quantum hypothesis testing based on the Nussbaum-Szkoa mapping.<n>The proposed bound arises from a single expression and enables, in some cases, the direct use of classical results.
- Score: 3.1351527202068445
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum hypothesis testing concerns the discrimination between quantum states. This paper introduces a novel lower bound for asymmetric quantum hypothesis testing that is based on the Nussbaum-Szkoła mapping. The lower bound provides a unified recovery of converse results across all major asymptotic regimes, including large-, moderate-, and small-deviations. Unlike existing bounds, which either rely on technically involved information-spectrum arguments or suffer from fixed prefactors and limited applicability in the non-asymptotic regime, the proposed bound arises from a single expression and enables, in some cases, the direct use of classical results. It is further demonstrated that the proposed bound provides accurate approximations to the optimal quantum error trade-off function at small blocklengths. Numerical comparisons with existing bounds, including those based on fidelity and information spectrum methods, highlight its improved tightness and practical relevance.
Related papers
- Tight any-shot quantum decoupling [23.729027844524893]
We prove a novel one-shot decoupling theorem formulated in terms of quantum entropy relative distance.<n>We show that this bound is ensemble-tight in quantum relative entropy distance.
arXiv Detail & Related papers (2026-02-19T15:01:26Z) - Quartic quantum speedups for community detection [84.14713515477784]
We develop a quantum algorithm for hypergraph community detection that achieves a quartic quantum speedup.<n>Our algorithm is based on the Kikuchi method, which we extend beyond previously considered problems such as PCA and $p$XORSAT.
arXiv Detail & Related papers (2025-10-09T17:35:17Z) - Quantum Sequential Universal Hypothesis Testing [62.751483592497806]
Quantum hypothesis testing (QHT) concerns the statistical inference of unknown quantum states.<n>We introduce the quantum sequential universal test (QSUT), a novel framework for sequential QHT in the general case of composite hypotheses.<n> QSUT builds on universal inference, and it alternates between adaptive local measurements aimed at exploring the hypothesis space and joint measurements optimized for maximal discrimination.
arXiv Detail & Related papers (2025-08-29T12:50:04Z) - Induced Quantum Divergence: A New Lens on Communication and Source Coding [4.3512163406552]
This paper introduces the induced divergence, a new quantum divergence measure that replaces the hypothesis testing divergence in position-based decoding.<n>Two key applications are considered: classical communication over quantum channels, and quantum state redistribution.<n>Results provide new insights into fundamental single-shot quantum information protocols.
arXiv Detail & Related papers (2025-02-19T12:25:56Z) - Reducing the sampling complexity of energy estimation in quantum many-body systems using empirical variance information [45.18582668677648]
We consider the problem of estimating the energy of a quantum state preparation for a given Hamiltonian in Pauli decomposition.<n>We construct an adaptive estimator using the state's actual variance.
arXiv Detail & Related papers (2025-02-03T19:00:01Z) - Converse bounds for quantum hypothesis exclusion: A divergence-radius approach [14.499463058550683]
We apply strong converse results for asymmetric binary hypothesis testing to distinguishing an arbitrary dummy'' hypothesis from each of the concerned candidates.<n>This leads to the desired upper bounds in terms of divergence via a geometrically inspired argument.
arXiv Detail & Related papers (2025-01-16T18:01:19Z) - Generalized quantum asymptotic equipartition [11.59751616011475]
AEP states that in the limit of a large number of independent and identically distributed (i.i.d.) random experiments, the output sequence is virtually certain to come from the typical set.<n>We prove a generalized quantum AEP beyond the i.i.d. framework where the random samples are drawn from two sets of quantum states.<n>We propose a new framework for quantum resource theory in which state transformations are performed without requiring precise characterization of the states being manipulated.
arXiv Detail & Related papers (2024-11-06T16:33:16Z) - Contraction of Private Quantum Channels and Private Quantum Hypothesis Testing [19.69490455003981]
We study contraction coefficient for hockey-stick divergence under privacy constraints.<n>We also show how private quantum channels provide fairness and Holevo information stability in quantum learning settings.
arXiv Detail & Related papers (2024-06-26T18:00:03Z) - Analyzing Prospects for Quantum Advantage in Topological Data Analysis [35.423446067065576]
We analyze and optimize an improved quantum algorithm for topological data analysis.
We show that super-quadratic quantum speedups are only possible when targeting a multiplicative error approximation.
We argue that quantum circuits with tens of billions of Toffoli can solve seemingly classically intractable instances.
arXiv Detail & Related papers (2022-09-27T17:56:15Z) - 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) - Incompatibility measures in multi-parameter quantum estimation under
hierarchical quantum measurements [4.980960723762946]
We show an approach to study the incompatibility under general $p$-local measurements.
We demonstrate the power of the approach by presenting a hierarchy of analytical bounds on the tradeoff.
arXiv Detail & Related papers (2021-09-13T09:33:47Z) - 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) - Lower bounds in multiple testing: A framework based on derandomized
proxies [107.69746750639584]
This paper introduces an analysis strategy based on derandomization, illustrated by applications to various concrete models.
We provide numerical simulations of some of these lower bounds, and show a close relation to the actual performance of the Benjamini-Hochberg (BH) algorithm.
arXiv Detail & Related papers (2020-05-07T19:59:51Z) - Using Quantum Metrological Bounds in Quantum Error Correction: A Simple
Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates.
Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
arXiv Detail & Related papers (2020-04-24T17:58: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.