Computational approach to quantum encoder design for purity optimization
Download (199.2 kB)
-
Altmetric Citations
Yamamoto, Naoki; Fazel, Maryam
Description
In this paper, we address the problem of designing a quantum encoder that maximizes the minimum output purity of a given decohering channel, where the minimum is taken over all possible pure inputs. This problem is cast as a max-min optimization problem with a rank constraint on an appropriately defined matrix variable. The problem is computationally very hard because it is nonconvex with respect to both the objective function (output purity) and the rank constraint. Despite this difficulty, we...[Show more]
dc.contributor.author | Yamamoto, Naoki | |
---|---|---|
dc.contributor.author | Fazel, Maryam | |
dc.date.accessioned | 2015-12-10T21:54:36Z | |
dc.identifier.issn | 1050-2947 | |
dc.identifier.uri | http://hdl.handle.net/1885/39013 | |
dc.description.abstract | In this paper, we address the problem of designing a quantum encoder that maximizes the minimum output purity of a given decohering channel, where the minimum is taken over all possible pure inputs. This problem is cast as a max-min optimization problem with a rank constraint on an appropriately defined matrix variable. The problem is computationally very hard because it is nonconvex with respect to both the objective function (output purity) and the rank constraint. Despite this difficulty, we provide a tractable computational algorithm that produces the exact optimal solution for codespace of dimension 2. Moreover, this algorithm is easily extended to cover the general class of codespaces, in which case the solution is suboptimal in the sense that the suboptimized output purity serves as a lower bound of the exact optimal purity. The algorithm consists of a sequence of semidefinite programmings and can be performed easily. Two typical quantum error channels are investigated to illustrate the effectiveness of our method. | |
dc.publisher | American Physical Society | |
dc.source | Physical Review A: Atomic, Molecular and Optical Physics | |
dc.subject | Keywords: Algorithms; Computational methods; Constraint theory; Error analysis; Optimization; Problem solving; Decohering channel; Minimum output purity; Purity optimization; Quantum encoder design; Quantum theory | |
dc.title | Computational approach to quantum encoder design for purity optimization | |
dc.type | Journal article | |
local.description.notes | Imported from ARIES | |
local.identifier.citationvolume | 76 | |
dc.date.issued | 2007 | |
local.identifier.absfor | 100503 - Computer Communications Networks | |
local.identifier.ariespublication | u3379551xPUB170 | |
local.type.status | Published Version | |
local.contributor.affiliation | Yamamoto, Naoki, College of Engineering and Computer Science, ANU | |
local.contributor.affiliation | Fazel, Maryam, California Institute of Technology | |
local.description.embargo | 2037-12-31 | |
local.bibliographicCitation.issue | 1 | |
local.bibliographicCitation.startpage | 012327-1-/012327-13 | |
local.identifier.doi | 10.1103/PhysRevA.76.012327 | |
local.identifier.absseo | 890399 - Information Services not elsewhere classified | |
dc.date.updated | 2015-12-09T07:27:27Z | |
local.identifier.scopusID | 2-s2.0-34547409473 | |
Collections | ANU Research Publications |
Download
File | Description | Size | Format | Image |
---|---|---|---|---|
01_Yamamoto_Computational_approach_to_2007.pdf | 199.2 kB | Adobe PDF |
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.
Updated: 17 November 2022/ Responsible Officer: University Librarian/ Page Contact: Library Systems & Web Coordinator