Interpolation for completely positive maps: Numerical solutions

Simple item page
buir.contributor.authorGheondea, Aurelian
dc.citation.epage22en_US
dc.citation.issueNumber1en_US
dc.citation.spage13en_US
dc.citation.volumeNumber61en_US
dc.contributor.authorAmbrozie, C.en_US
dc.contributor.authorGheondea, Aurelianen_US
dc.date.accessioned2019-02-21T16:09:51Z
dc.date.available2019-02-21T16:09:51Z
dc.date.issued2018en_US
dc.departmentDepartment of Mathematicsen_US
dc.description.abstractWe present a few techniques to find completely positive maps between full matrix algebras taking prescribed values on given data, based on semidefinite programming, convex minimization supported by a numerical example, as well as representations by linear functionals. The particular case of commutative data is also discussed.
dc.description.provenanceMade available in DSpace on 2019-02-21T16:09:51Z (GMT). No. of bitstreams: 1 Bilkent-research-paper.pdf: 222869 bytes, checksum: 842af2b9bd649e7f548593affdbafbb3 (MD5) Previous issue date: 2018en
dc.identifier.issn1220-3874
dc.identifier.urihttp://hdl.handle.net/11693/50480
dc.language.isoEnglish
dc.publisherSocietatea de Stiinte Matematice din Romania
dc.source.titleBulletin Mathematique de la Societe des Sciences Mathematiques de Roumanieen_US
dc.subjectChoi matrixen_US
dc.subjectCompletely positiveen_US
dc.subjectConvex minimizationen_US
dc.subjectInterpolationen_US
dc.subjectQuantum channelen_US
dc.subjectSemidefinite programmingen_US
dc.titleInterpolation for completely positive maps: Numerical solutionsen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
Interpolation_for_completely_positive_maps_numerical_solutions.pdf
Size:
348.5 KB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download

Collections

Scholarly Publications - Mathematics