Parametrization of quantum states and the quantum state discrimination problem
Seyed Arash Ghoreishi, Seyed Javad Akhtarshenas, and Mohsen Sarbishaei

TL;DR
This paper introduces a new parametrization of quantum states based on discrimination problem parameters, linking quantum and classical distinguishability, and proposes a fidelity measure to quantify discriminability.
Contribution
It defines a unique pair of density matrices for each discrimination problem, connecting quantum overlaps and classical probabilities, and introduces a fidelity-based measure of discriminability.
Findings
The pair of density matrices captures quantum and classical discrimination information.
Fidelity between the matrices quantifies the set's discriminability.
The measure is computationally simple and applicable to estimate discriminability extent.
Abstract
A discrimination problem consists of linearly independent pure quantum states and the corresponding occurrence probabilities . To any such problem we associate, up to a permutation over the probabilities , a unique pair of density matrices and defined on the -dimensional Hilbert space . The first one, , provides a new parametrization of a generic full-rank density matrix in terms of the parameters of the discrimination problem, i.e. the mutual overlaps and the occurrence probabilities . The second one is defined as a diagonal density matrix with the diagonal entries given by the probabilities with the ordering induced by the permutation of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
