A semidefinite programming approach to optimal unambiguous discrimination of quantum states
type: Item
instance of: scholarly article
title: A semidefinite programming approach to optimal unambiguous discrimination of quantum states
zbMATH Open document ID: 1063.81013
DOI: 10.1109/TIT.2002.807291
author: Y. C. Eldar
published in: IEEE Transactions on Information Theory
publication date: 2005-05-31T00:00:00Z
full work available at URL: https://arxiv.org/abs/quant-ph/0206093
Mathematics Subject Classification ID: 81P15
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 94A99
zbMATH DE Number: 2172525
describes a project that uses: SeDuMi
MaRDI profile type: Publication
arXiv ID: quant-ph/0206093
Recommended article: Optimum unambiguous discrimination between subsets of quantum states
Recommended article: Optimal unambiguous discrimination of pure qudits
Recommended article: A semidefinite program for distillable entanglement
Recommended article: Finding Optimal Solutions for Generalized Quantum State Discrimination Problems
Recommended article: Asymptotically Optimal Discrimination between Pure Quantum States
Recommended article: A general approach to physical realization of unambiguous quantum-state discrimination
Recommended article: Optimum unambiguous discrimination of two mixed quantum states
Recommended article: Equiprobable unambiguous discrimination of quantum states by symmetric orthogonalisation
Recommended article: An optimal discrimination of two mixed qubit states with a fixed rate of inconclusive results
Recommended article: OPTIMAL UNAMBIGUOUS DISCRIMINATION OF TWO FINITE-DIMENSIONAL COHERENT STATES
description: scientific article; zbMATH DE number 2172525