Exact solution for the max-min quantum error recovery problem

研究成果: Conference contribution

4 被引用数 (Scopus)

抄録

This paper considers the max-min quantum error recovery problem; the recovery channel to be designed maximizes the fidelity between input and output states of a given noisy channel, while the minimum is taken over all possible pure input states. In general, this kind of max-min problem is cast as a non-convex optimization problem and is thus very hard to solve even with the aid of high-quality computational tools. Nevertheless, it is shown that, when the input takes a qubit, the problem is exactly convex for any size of error process. The Sum of Squares (SOS) characterization of a specific class of polynomial functions plays a crucial role in deriving this result.

本文言語English
ホスト出版物のタイトルProceedings of the 48th IEEE Conference on Decision and Control held jointly with 2009 28th Chinese Control Conference, CDC/CCC 2009
ページ1433-1438
ページ数6
DOI
出版ステータスPublished - 2009 12 1
イベント48th IEEE Conference on Decision and Control held jointly with 2009 28th Chinese Control Conference, CDC/CCC 2009 - Shanghai, China
継続期間: 2009 12 152009 12 18

出版物シリーズ

名前Proceedings of the IEEE Conference on Decision and Control
ISSN(印刷版)0191-2216

Other

Other48th IEEE Conference on Decision and Control held jointly with 2009 28th Chinese Control Conference, CDC/CCC 2009
CountryChina
CityShanghai
Period09/12/1509/12/18

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modelling and Simulation
  • Control and Optimization

フィンガープリント 「Exact solution for the max-min quantum error recovery problem」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル