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

DOI10.1007/s11128-010-0185-yzbMath1217.81036arXiv0910.5415OpenAlexW3101513155MaRDI QIDQ548211

Yong-Cai Geng, Sumit K. Garg

Publication date: 28 June 2011

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

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

zbMATH Keywords

convex optimizationmeasurementsuccess probabilityconjugate statesHelstrom family of ensemblesminimum-error discriminationPOVM elements

Mathematics Subject Classification ID

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

Related Items (5)

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 ⋮ Qubit state discrimination using post-measurement information ⋮ Process estimation in qubit systems: a quantum decision theory approach

Cites Work

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

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