Related papers: Quantum process discrimination with restricted str…
We study a broad class of quantum process discrimination problems that can handle many optimization strategies such as the Bayes, Neyman-Pearson, and unambiguous strategies, where each process can consist of multiple time steps and can have…
We consider the problem of discriminating finite-dimensional quantum processes, also called quantum supermaps, that can consist of multiple time steps. Obtaining the ultimate performance for discriminating quantum processes is of…
Quantum state discrimination is a fundamental task that is meaningful in quantum information theory. In this manuscript, we consider a revised unambiguous discrimination of quantum resources. First, we present an upper bound of the success…
In this paper 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…
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…
We propose upper and lower bounds on the maximum success probability for discriminating given quantum states. The proposed upper bound is obtained from a suboptimal solution to the dual problem of the corresponding optimal state…
We investigate the performance of discrimination strategy in the comparison task of known quantum states. In the discrimination strategy, one infers whether or not two quantum systems are in the same state on the basis of the outcomes of…
In this paper, the problem of finding optimal success probabilities of static linear optics quantum gates is linked to the theory of convex optimization. It is shown that by exploiting this link, upper bounds for the success probability of…
We address the problem of discriminating with minimal error probability two given quantum operations. We show that the use of entangled input states generally improves the discrimination. For Pauli channels we provide a complete comparison…
I investigate the problem of optimally discriminating between two open quantum dynamical processes in a single-shot scenario, with the goal of minimizing the error probability of identification. This task involves optimising both the input…
The need of discriminating between different quantum states is a fundamental issue in Quantum Information and Communication. The actual realization of generally optimal strategies in this task is often limited by the need of supplemental…
In this paper, we address the problem of discriminating two given quantum operations. Firstly, based on the Bloch representation of single qubit systems, we give the exact minimum error probability of discriminating two single qubit quantum…
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…
A method to compute the optimal success probability of discrimination of N arbitrary quantum states is presented, based on the decomposition of any N-outcome measurement into sequences of nested two-outcome ones. In this way the…
A fundamental problem in Quantum Information Processing is the discrimination amongst a set of quantum states of a system. In this paper, we address this problem on an open quantum system described by a graph, whose evolution is defined by…
In this paper, we consider the problem of unambiguous discrimination between a set of mixed quantum states. We first divide the density matrix of each mixed state into two parts by the fact that it comes from ensemble of pure quantum…
We propose an approach to solving constrained combinatorial optimization problems based on embedding the concept of Lagrangian duality into the framework of adiabatic quantum computation. Within the setting of circuit-model fault-tolerant…
A programmable quantum processor is a fundamental model of quantum computation. In this model, any quantum channel can be approximated by applying a fixed universal quantum operation onto an input state and a quantum `program' state, whose…
There are two common settings in a quantum-state discrimination problem. One is minimum-error discrimination where a wrong guess (error) is allowed and the discrimination success probability is maximized. The other is unambiguous…
We study the problem of discriminating between non-orthogonal quantum states with least probability of error. We demonstrate that this problem can be simplified if we solve for the error itself rather than solving directly for the optimal…