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

Quantum Information Processing

Optimal unambiguous discrimination of pure qudits

Wen‐Hai Zhang, Long-Bao Yu, Zhuo‐Liang Cao, Liu Ye

Published Nov 6, 2013• 11 citations
Publisher
DOI
10.1007/s11128-013-0666-x

Related papers

Unambiguous correct discrimination among symmetric qudit states

Dawei Guo, Wen‐Hai Zhang

Quantum Information Processing•Apr 13, 2023•2 citations

Unambiguous discrimination between two unknown qudit states

Tao Zhou

arXiv:1105.3004•Quantum Information Processing•Nov 8, 2011•17 citations

Optimal unambiguous discrimination of pure quantum states using SDP method

Naser Karimi

Chinese Journal of Physics•May 26, 2021•4 citations

A minimal set of measurements for qudit-state tomography based on unambiguous discrimination

Donghoon Ha, Younghun Kwon

Quantum Information Processing•Jul 27, 2018•9 citations

Nonlocal unambiguous discrimination among N nonorthogonal qudit states lying in a higher-dimensional Hilbert space

Libing Chen, Haiping Lu

Science China Physics Mechanics and Astronomy•Dec 14, 2011•10 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.

arXiv:1112.0931•Quantum Information and Computation•Nov 1, 2012•6 citations
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.