Searcharxiv⌕ Search

arXiv subjects

Chi Zhang

Publications and source records attributed to Chi Zhang.

904 records · Page 51Linked to original sources

Unambiguous discrimination of mixed quantum states

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 states. The first part will not contribute anything to the discrimination, the second part has support space linearly independent to each other. Then the problem we consider can be reduced to a problem in which the strategy of set discrimination can be used in designing measurements to discriminate mixed states unambiguously. We find a necessary and sufficient condition of unambiguous mixed state discrimination, and also point out that searching the optimal success probability of unambiguous discrimination is mathematically the well-known semi-definite programming problem. A upper bound of the optimal success probability is also presented. Finally, We generalize the concept of set discrimination to mixed state and point out that the problem of discriminating it unambiguously is equivalent to that of unambiguously discriminating mixed states.

quant-ph↗

Optimal universal programmable detectors for unambiguous discrimination

We discuss the problem of designing unambiguous programmable discriminators for any n unknown quantum states in an m-dimensional Hilbert space. The discriminator is a fixed measurement that has two kinds of input registers: the program registers and the data register. The quantum state in the data register is what users want to identify, which is confirmed to be among the n states in program registers. The task of the discriminator is to tell the users which state stored in the program registers is equivalent to that in the data register. First, we give a necessary and sufficient condition for judging an unambiguous programmable discriminator. Then, if $m=n$, we present an optimal unambiguous programmable discriminator for them, in the sense of maximizing the worst-case probability of success. Finally, we propose a universal unambiguous programmable discriminator for arbitrary n quantum states.

quant-ph↗

Universal programmable devices for unambiguous discrimination

We discuss the problem of designing unambiguous programmable discriminators for any $n$ unknown quantum states in an $m$-dimensional Hilbert space. The discriminator is a fixed measurement which has two kinds of input registers: the program registers and the data register. The program registers consist of the $n$ states, while the data register is prepared among them. The task of the discriminator is to tell us which state stored in the program registers is equivalent to that in the data register. First, we give a necessary and sufficient condition for judging an unambiguous programmable discriminator. Then, if $m=n$, we present an optimal unambiguous programmable discriminator for them, in the sense of maximizing the worst-case probability of success. Finally, we propose a universal unambiguous programmable discriminator for arbitrary $n$ quantum states. We also show how to use this universal discriminator to unambiguously discriminate mixed states.

quant-ph↗

Unbound Protein-Protein Docking Selections by the DFIRE-based Statistical Pair Potential

A newly developed statistical pair potential based on Distance-scaled Finite Ideal-gas REference (DFIRE) state is applied to unbound protein-protein docking structure selections. The performance of the DFIRE energy function is compared to those of the well-established ZDOCK energy scores and RosettaDock energy function using the comprehensive decoy sets generated by ZDOCK and RosettaDock. Despite significant difference in the functional forms and complexities of the three energy scores, the differences in overall performance for docking structure selections are small between DFIRE and ZDOCK2.3 and between DFIRE and RosettaDock. This result is remarkable considering that a single-term DFIRE energy function was originally designed for monomer proteins while multiple-term energy functions of ZDOCK and RosettaDock were specifically optimized for docking. This provides hope that the accuracy of the existing energy functions for docking can be improved.

q-bio.BM↗