Identifying the precise moment when a quantum channel undergoes a change is a fundamental problem in quantum information theory. We study how accurately one can determine the time at which a channel transitions to another. We investigate the quantum limit of the average success probability in unambiguous discrimination, in which errors are completely avoided by allowing inconclusive results with a certain probability. This problem can be viewed as a quantum process discrimination task, where the process consists of a sequence of quantum channels; however, obtaining analytical solutions for quantum process discrimination is generally extremely challenging. In this paper, we propose a method to derive lower and upper bounds on the maximum average success probability in unambiguous discrimination. In particular, when the channels before and after the change are unitary, we show that the maximum average success probability can be analytically expressed in terms of the length of the channel sequence and the discrimination limits for the two channels.
Identifying the precise moment when a quantum channel undergoes a change is a fundamental problem in quantum information theory. We study how accurately one can determine the time at which a channel transitions to another. We investigate the quantum limit of the average success probability in unambiguous discrimination, in which errors are completely avoided by allowing inconclusive results with a certain probability. This problem can be viewed as a quantum process discrimination task, where the process consists of a sequence of quantum channels; however, obtaining analytical solutions for quantum process discrimination is generally extremely challenging. In this paper, we propose a method to derive lower and upper bounds on the maximum average success probability in unambiguous discrimination. In particular, when the channels before and after the change are unitary, we show that the maximum average success probability can be analytically expressed in terms of the length of the channel sequence and the discrimination limits for the two channels.
Quantum hypothesis testing is an important tool for quantum information processing.Two main strategies have been widely adopted: in a minimum error discrimination strategy, the average error probability is minimized; while in an unambiguous discrimination strategy, an inconclusive decision (abstention) is allowed to vanish any possibility of errors when a conclusive result is obtained.In both scenarios, the testing between quantum states is relatively well understood, for example, the ultimate limits of the performance are established decades ago; however, the testing between quantum channels is less understood.Although the ultimate limit of minimum error discrimination between channels has been explored recently, the corresponding limit of unambiguous discrimination is unknown.In this paper, we formulate an approximate unambiguous discrimination scenario, and derive the ultimate limits of the performance for both states and channels.In particular, in the channel case, our lower bound of the inconclusive probability holds for arbitrary adaptive sensing protocols.For the special class of "teleportation-covariant" channels, the lower bound is achievable with maximum entangled inputs and no adaptive strategy is necessary.
We formulate minimum-error and unambiguous discrimination problems for quantum processes in the language of process positive operator valued measures (PPOVM). In this framework we present the known solution for minimum-error discrimination of unitary channels. We derive a ‘fidelity-like’ lower bound on the failure probability of the unambiguous discrimination of arbitrary quantum processes. This bound is saturated (in a certain range of a priori probabilities) in the case of unambiguous discrimination of unitary channels. Surprisingly, the optimal solution for both tasks is based on the optimization of the same quantity called completely bounded process fidelity.
Detecting sudden changes in the environment is crucial in many statistical applications. We mainly focus on identifying sudden changes in weak signals transmitted by electromagnetic or gravitational waves. Assuming that the Hamiltonians representing the signals before and after the change are known, we aim to find a discrimination strategy that can detect the change point with the best possible accuracy. This problem has potential applications in accurately detecting the precise timing of events such as stellar explosions, foreign object intrusions, specific chemical bonds, and phase transitions. We formulate this problem as a quantum process discrimination problem by discretizing the time evolution of a quantum system as a sequence of unitary channels. However, due to the complexity of the dynamics, solving such a multiple process discrimination problem is typically challenging. We demonstrate that the maximum success probability for the Hamiltonian change point problem with any finite number of candidate change points can be determined and has a simple analytical form.
Quantum state discrimination is a fundamental task that is meaningful in quantum information theory. In this manuscript, we consider an extended unambiguous discrimination of quantum resources. First, we present an upper bound of the success probability for an extended unambiguous discrimination task in the non-asymptotic and asymptotic scenarios. Next, we generalize the task from quantum states to quantum channels. We present an upper bound of the success probability for the task under the adaptive strategy. Furthermore, we show the bound can be computed efficiently. Finally, compared with the classical generalized unambiguous discrimination, we show the advantage of the quantum with the aid of a quantifier based on a set of semi-definite positive operators.
We present the solution to the problem of optimally discriminating among quantum states, i.e., identifying the states with maximum probability of success when a certain fixed rate of inconclusive answers is allowed. By varying the inconclusive rate, the scheme optimally interpolates between unambiguous and minimum error discrimination, the two standard approaches to quantum state discrimination. We introduce a very general method that enables us to obtain the solution in a wide range of cases and give a complete characterization of the minimum discrimination error as a function of the rate of inconclusive answers. A critical value of this rate is identified that coincides with the minimum failure probability in the cases where unambiguous discrimination is possible and provides a natural generalization of it when states cannot be unambiguously discriminated. The method is illustrated on two explicit examples: discrimination of two pure states with arbitrary prior probabilities and discrimination of trine states.
The discrimination of two mixed quantum states is a fundamental task in quantum state estimation and quantum information theory. In quantum state discrimination a quantum system is assumed to be in one of two possible – in general mixed – non-orthogonal quantum states. The discrimination then consists of a measurement strategy that allows to decide in which state the system was before the measurement. In unambiguous state discrimination the aim is to make this decision without errors, but it is allowed to give an inconclusive answer.
Especially interesting are measurement strategies that minimize the probability of an inconclusive answer. A starting point for the analysis of this optimization problem was a result by Eldar et al. [Phys. Rev. A 69, 062318 (2004)], which provides non-operational necessary and sufficient conditions for a given measurement strategy to be optimal. These conditions are reconsidered and simplified in such a way that they become operational. The simplified conditions are the basis for further central results: It is shown that the optimal measurement strategy is unique, a statement that is e.g. of importance for the complexity analysis of optimal measurement devices. The optimal measurement strategy is derived for the case, where one of the possible input states has at most rank two, which was an open problem for many years. Furthermore, using the optimality criterion it is shown that there always exists a threshold probability for each state, such that below this probability it is optimal to exclude this state from the discrimination strategy.
If the two states subject to discrimination can be brought to a diagonal structure with (2×2)-dimensional blocks, then the unambiguous discrimination of these states can be reduced to the unambiguous discrimination of pure states.
A criterion is presented that allows to identify the presence of such a structure for two self-adjoint operators. This criterion consists of the evaluation of three commutators and allows an explicit construction of the (2×2)-dimensional blocks.
As an important application of unambiguous state discrimination, unambiguous
state comparison, i.e., the question whether two states are identical or not, is generalized and optimal measurements for this problem are constructed.
If for a certain family of states, a physical device maps the input state to an output state, such that a second device can be built that yields back the original input state, such a map is called reversible on this family. With respect to state discrimination, such reversible maps are particularly interesting, if the output states are pure. A complete characterization of all families that allow such a reversible and purifying map is provided. If the states are mapped to pure states, but the map itself is not reversible, upper and lower bounds are analyzed for the “deviation from perfect faithfulness”, a quantity which measures the deviation from a reversible mapping.