Year: 2025
Type: article
Abstract: Sequential methods for quantum hypothesis testing offer significant advantages over fixed-length approaches, which rely on a predefined number of state copies. Despite their potential, these methods remain underexplored for unambiguous discrimination. In this work, we derive performance bounds for such methods when applied to the discrimination of a set of pure states. The performance is evaluated based on the expected number of copies required. We establish a lower bound applicable to any sequential method and an upper bound on the optimal sequential method. The upper bound is derived using a novel and simple non-adaptive method. Importantly, the gap between these bounds is minimal, scaling logarithmically with the number of distinct states.
Source: Quantum
Institution: Universitat Politècnica de Catalunya
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $215
OpenAlex ID: W4416425667