The minimum-error discrimination via Helstrom family of ensembles and convex optimization

DOI10.1007/S11128-010-0185-YzbMATH Open1217.81036arXiv0910.5415OpenAlexW3101513155MaRDI QIDQ548211FDOQ548211

Sumit K. Garg, Yong-Cai Geng

Publication date: 28 June 2011

Published in: Quantum Information Processing (Search for Journal in Brave)

Abstract: Using the convex optimization method and Helstrom family of ensembles introduced in Ref. [1], we have discussed optimal ambiguous discrimination in qubit systems. We have analyzed the problem of the optimal discrimination of N known quantum states and have obtained maximum success probability and optimal measurement for N known quantum states with equiprobable prior probabilities and equidistant from center of the Bloch ball, not all of which are on the one half of the Bloch ball and all of the conjugate states are pure. An exact solution has also been given for arbitrary three known quantum states. The given examples which use our method include: 1. Diagonal N mixed states; 2. N equiprobable states and equidistant from center of the Bloch ball which their corresponding Bloch vectors are inclined at the equal angle from z axis; 3. Three mirror-symmetric states; 4. States that have been prepared with equal prior probabilities on vertices of a Platonic solid. Keywords: minimum-error discrimination, success probability, measurement, POVM elements, Helstrom family of ensembles, convex optimization, conjugate states PACS Nos: 03.67.Hk, 03.65.Ta

Full work available at URL: https://arxiv.org/abs/0910.5415

Recommendations

• Structure of minimum-error quantum state discrimination
• Optimum unambiguous discrimination between subsets of quantum states
• Minimum-error discrimination between two sets of similarity-transformed quantum states
• Minimum error discrimination for an ensemble of linearly independent pure states
• A semidefinite programming approach to optimal unambiguous discrimination of quantum states

zbMATH Keywords

measurementconvex optimizationsuccess probabilityconjugate statesHelstrom family of ensemblesminimum-error discriminationPOVM elements

Mathematics Subject Classification ID

Quantum computation (81P68) Vector-valued set functions, measures and integrals (28B05) Quantum measurement theory, state operations, state preparations (81P15) Statistical mechanics of crystals (82D25) Quantum state spaces, operational and probabilistic concepts (81P16)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Quantum detection and estimation theory
• Finite quantum tomography and semidefinite programming
• On the conditions for discrimination between quantum states with minimum error
• Optimal distinction between non-orthogonal quantum states
• Designing optimal quantum detectors via semidefinite programming
• Distinguishing separable and entangled states
• BEST SEPARABLE APPROXIMATION WITH SEMI-DEFINITE PROGRAMMING METHOD
• EXACT CALCULATION OF ROBUSTNESS OF ENTANGLEMENT VIA CONVEX SEMI-DEFINITE PROGRAMMING

Cited In (5)

• Qubit state discrimination using post-measurement information
• Process estimation in qubit systems: a quantum decision theory approach
• Minimum-error discrimination between two sets of similarity-transformed quantum states
• An optimal discrimination of two mixed qubit states with a fixed rate of inconclusive results
• Minimum-error discrimination among three pure linearly independent symmetric qutrit states

This page was built for publication: The minimum-error discrimination via Helstrom family of ensembles and convex optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548211)