Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

AIP Advances

Universal programmable unambiguous discrimination of two unknown states with two copies

Shouya Wang, Wen‐Hai Zhang

Published Oct 1, 2024• 0 citations
Publisher

Abstract

We investigate the universal programmable unambiguous discrimination of two unknown quantum states with two copies. We first present the optimal positive-operator valued measure (POVM) elements that determine the individual success probabilities. In terms of the positivity of an inconclusive operator, we derive the average success probability, which is higher than the average success probability of discriminating two unknown states with one copy given in the reference [Bergou and Hillery, Phys. Rev. Lett. 94, 160501 (2005)].

DOI
10.1063/5.0232590

Related papers

Designing an optimal, universal, programmable, and unambiguous discriminator for N unknown qubits

M. A. Jafarizadeh, Payman Mahmoudi, Derakhshan Akhgar +1 more

The universal programmable discriminator is a device for discrimination between unknown quantum states. It has two kinds of registers: the program register and the data register. The states that are stored in registers are all unknown. It is assured that the data state is identical with one of the program states with the certain probability. The aim is to optimally identify the state stored in the data register with one of the program states that it is done by discriminating between unknown states of the combined system contains program and data registers. We design an optimal universal unambiguous programmable discriminator that has $N$ qubit systems in the program register, to unambiguously identify the qubit state of data with one of $N$ program qubit states. All unknown qubit states are pure and ${N}_{D}$ copies of the data state are available. We determine the optimal positive-operator valued measure (POVM) elements in two different ways. First, we find optimal POVMs that maximize the average of the overall success probability of discrimination between $N$ unknown pure states of the combined system. In another way, the problem of discrimination between $N$ unknown pure states of the combined system is reduced to discrimination between $N$ known average mixed states. It is shown that theses two different ways lead to the same results. We show that at least $N\ensuremath{-}1$ copies of the data state are necessary for discriminating between $N$ unknown states of the combined system.

Physical Review A•Nov 9, 2017•9 citations

Success probabilities for universal unambiguous discriminators between unknown pure states

Tao Zhou

A universal programmable discriminator can perform discrimination between two unknown states, and the optimal solution can be approached via discrimination between the two averages over the uniformly distributed unknown input pure states, as has been widely discussed in previous works. In this paper, we consider the success probabilities of the optimal universal programmable unambiguous discriminators when applied to the pure input states. More precisely, the analytic results of the success probabilities are derived with the expressions of the optimal measurement operators for the universal discriminators, and we find that the success probabilities are independent of the dimension $d$ while the amount of copies in the two program registers is equal. The success probability of the programmable unambiguous discriminator can asymptotically approach that of the usual unambiguous discrimination (state comparison) as the number of copies in the program registers (data register) goes to infinity.

arXiv:1308.0707•Physical Review A•Jan 3, 2014•13 citations

Universal programmable maximum confidence quantum measurement of two unknown states

Shouya Wang, Xiaodong Zheng, Wenhai Zhang

In this study, the universal programmable maximum confidence quantum measurement of two unknown states is investigated. The set of measurement operators includes the correct operators and an inconclusive operator. We first determine the two correct operators of the optimal positive-operator valued measure, from which the individual correct probabilities can be obtained. In order to evaluate the efficiency of the correct operators, the average confidence probability is defined. In terms of the positivity of an inconclusive operator, we calculate the value of the average confidence probability and present the explicit expression of the maximum of the average confidence probability. Finally, the application of the research results to quantum key distribution is discussed.

Zhongguo kexue. Wulixue Lixue Tianwenxue•Oct 30, 2024•0 citations

Optical realization of the unambiguous discriminator for unknown quantum states

Xiaohua Wu, Yixi Gong

With a single-photon representation of the quantum states and a multirail optical network for performing the unitary transformation, we give a scheme for an optical implementation of the universal programmable quantum state discriminator that unambiguously discriminates between two unknown states with optimal probability of success.

Physical Review A•Oct 16, 2008•9 citations

Multicopy programmable discriminators between two unknown qudit states with group-theoretic approach

Tao Zhou, Jing Xin Cui, Xiaohua Wu +1 more

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 unambiguous discrimination and minimum-error discrimination. The POVM operators for unambiguous discrimination and orthogonal measurement operators for minimum-error discrimination are obtained. We find that the optimal failure probability and minimum-error probability for the discrimination between the mean input mixd states are dependent on the dimension of the unknown qudit states. We applied the approach to generalize the results of He and Bergou (2007) from qubit to qudit case, and we further solve the problem of programmable dicriminators with arbitrary copies of unknown states in both program and data systems.

Quantum Information and Computation•Nov 1, 2012•5 citations

The universal unambiguous discriminator between two unknown qudit states

Wenshi Wang, Tao Zhou

Abstract In this work, the unambiguous discrimination between two unknown states in d -dimensional Hilbert space is investigated. To achieve this goal, the Hilbert space of the states is divided into a series of subspaces, where the components of the two states projected in some of these subspaces can be unambiguously distinguished, and then the unambiguous discriminator between two unknown qudit states can be constructed. Moreover, the optimal success probability of the discrimination between two unknown states is obtained and the form of detection operators is given.

Europhysics Letters (EPL)•Jul 29, 2021•1 citation
We investigate the universal programmable unambiguous discrimination of two unknown quantum states with two copies. We first present the optimal positive-operator valued measure (POVM) elements that determine the individual success probabilities. In terms of the positivity of an inconclusive operator, we derive the average success probability, which is higher than the average success probability of discriminating two unknown states with one copy given in the reference [Bergou and Hillery, Phys. Rev. Lett. 94, 160501 (2005)].
The universal programmable discriminator is a device for discrimination between unknown quantum states. It has two kinds of registers: the program register and the data register. The states that are stored in registers are all unknown. It is assured that the data state is identical with one of the program states with the certain probability. The aim is to optimally identify the state stored in the data register with one of the program states that it is done by discriminating between unknown states of the combined system contains program and data registers. We design an optimal universal unambiguous programmable discriminator that has NNN qubit systems in the program register, to unambiguously identify the qubit state of data with one of NNN program qubit states. All unknown qubit states are pure and ND{N}_{D}ND​ copies of the data state are available. We determine the optimal positive-operator valued measure (POVM) elements in two different ways. First, we find optimal POVMs that maximize the average of the overall success probability of discrimination between NNN unknown pure states of the combined system. In another way, the problem of discrimination between NNN unknown pure states of the combined system is reduced to discrimination between NNN known average mixed states. It is shown that theses two different ways lead to the same results. We show that at least $N\ensuremath{-}1$ copies of the data state are necessary for discriminating between NNN unknown states of the combined system.
A universal programmable discriminator can perform discrimination between two unknown states, and the optimal solution can be approached via discrimination between the two averages over the uniformly distributed unknown input pure states, as has been widely discussed in previous works. In this paper, we consider the success probabilities of the optimal universal programmable unambiguous discriminators when applied to the pure input states. More precisely, the analytic results of the success probabilities are derived with the expressions of the optimal measurement operators for the universal discriminators, and we find that the success probabilities are independent of the dimension ddd while the amount of copies in the two program registers is equal. The success probability of the programmable unambiguous discriminator can asymptotically approach that of the usual unambiguous discrimination (state comparison) as the number of copies in the program registers (data register) goes to infinity.
In this study, the universal programmable maximum confidence quantum measurement of two unknown states is investigated. The set of measurement operators includes the correct operators and an inconclusive operator. We first determine the two correct operators of the optimal positive-operator valued measure, from which the individual correct probabilities can be obtained. In order to evaluate the efficiency of the correct operators, the average confidence probability is defined. In terms of the positivity of an inconclusive operator, we calculate the value of the average confidence probability and present the explicit expression of the maximum of the average confidence probability. Finally, the application of the research results to quantum key distribution is discussed.
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)U(n)U(n) group, we construct the Jordan basis to derive the analytical results for both the optimal unambiguous discrimination and minimum-error discrimination. The POVM operators for unambiguous discrimination and orthogonal measurement operators for minimum-error discrimination are obtained. We find that the optimal failure probability and minimum-error probability for the discrimination between the mean input mixd states are dependent on the dimension of the unknown qudit states. We applied the approach to generalize the results of He and Bergou (2007) from qubit to qudit case, and we further solve the problem of programmable dicriminators with arbitrary copies of unknown states in both program and data systems.
Abstract In this work, the unambiguous discrimination between two unknown states in d -dimensional Hilbert space is investigated. To achieve this goal, the Hilbert space of the states is divided into a series of subspaces, where the components of the two states projected in some of these subspaces can be unambiguously distinguished, and then the unambiguous discriminator between two unknown qudit states can be constructed. Moreover, the optimal success probability of the discrimination between two unknown states is obtained and the form of detection operators is given.