A minimum-disturbing quantum state discriminator

Quantum correlations and least disturbing local measurements

We examine the evaluation of the minimum information loss due to an unread local measurement in mixed states of bipartite systems, for a general entropic form. Such quantity provides a measure of quantum correlations, reducing for pure states to the generalized entanglement entropy, while in the case of mixed states it vanishes just for classically correlated states with respect to the measured system, as the quantum discord. General stationary conditions are provided, together with their explicit form for general two-qubit states. Closed expressions for the minimum information loss as measure…

Group-theoretic approach for multi-copy programmable discriminators between two unknown qudit states

The discrimination between two unknown states can be performed by a universal programmable discriminator, where the copies of the two possible states are stored in two program systems respectively and the copies of data, which we want to confirm, are provided in the data system. In the present paper, we propose a group-theretic approach to the multi-copy programmable state discrimination problem. By equivalence of unknown pure states to known mixed states and with the representation theory of U(n) group, we construct the Jordan basis to derive the analytical results for both the optimal unambi…

用于监督机器学习的变分量子态鉴别器

Variational quantum state discriminator for supervised machine learning

本文提出变分量子态鉴别器（VQSD），通过参数化量子电路和代价函数最小化寻找最优POVM，实现最小误差量子态鉴别，无需量子态层析，并可作为监督机器学习分类器，在Iris数据集上取得平均AUC 0.985的优异性能。

Information-disturbance tradeoff for spin coherent state estimation

We show how to quantify the optimal tradeoff between the amount of information retrieved by a quantum measurement in estimating an unknown spin coherent state and the disturbance on the state itself, and how to derive the corresponding minimum-disturbing measurement.

Programmable unknown quantum-state discriminators with multiple copies of program and data: A Jordan basis approach

The discrimination of any pair of unknown quantum states is performed by devices processing three parts of inputs: copies of the pair of unknown states we want to discriminate are respectively stored in two program systems and copies of data, which is guaranteed to be one of the unknown states, in a third system. We study the efficiency of such programmable devices with the inputs prepared with $n$ and $m$ copies of unknown qubits used as programs and data, respectively. By finding a symmetry in the average inputs, we apply the Jordan basis method to derive their optimal unambiguous discrimina…

Programmable quantum state discriminators with simple programs

We describe a class of programmable devices that can discriminate between two quantum states. We consider two cases. In the first, both states are unknown. One copy of each of the unknown states is provided as input, or program, for the two program registers, and the data state, which is guaranteed to be prepared in one of the program states, is fed into the data register of the device. This device will then tell us, in an optimal way, which of the templates stored in the program registers the data state matches. In the second case, we know one of the states while the other is unknown. One cop…