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

Physics Letters A

A generalized programmable unambiguous state discriminator for unknown qubit systems

Bing He, János A. Bergou

Published May 12, 2006• 13 citations
Publisher
DOI
10.1016/j.physleta.2006.05.002

Related papers

Unambiguous Discrimination Between Mixed Quantum States Based on Programmable Quantum State Discriminators

Daowen Qiu, Hongfeng Gan, Guangya Cai +1 more

Lecture notes in computer science•Jan 1, 2018•0 citations

A Simplified Quantum Logic Network for Unambiguous Discrimination of Two Nonlocal and Unknown Pure Qubit States

Libing Chen, H. Lu

International Journal of Theoretical Physics•Nov 23, 2010•0 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

Unambiguous quantum state elimination for qubit sequences

Ittoop Vergheese Puthoor

•Dec 31, 2020•0 citations

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

Tao Zhou, Xiaohua Wu, Long, Gui Lu

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 (Phys. Rev. A {\bf 75}, 032316 (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•Dec 5, 2011•0 citations

UNAMBIGUOUS STATE IDENTIFICATION APPLIED TO QUANTUM INFORMATION PROCESSING

Luis Roa, Carlos Enrique Saavedra Rubilar, Rodrigo Fuentes Inzunza

•Jan 1, 2004•0 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.
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 (Phys. Rev. A {\bf 75}, 032316 (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.