Graph explorer

Hamiltonian Purification

The problem of Hamiltonian purification introduced by Burgarth et al. [D. K. Burgarth et al., Nat. Commun. 5, 5173 (2014)] is formalized and discussed. Specifically, given a set of non-commuting Hamiltonians {h1, . . ., hm} operating on a d-dimensional quantum system Hd, the problem consists in identifying a set of commuting Hamiltonians {H1,...,Hm} operating on a larger dE-dimensional system H_{dE} which embeds H_d as a proper subspace, such that hj = PHjP with P being the projection which allows one to recover Hd from HdE . The notions of spanning-set purification and generator purification of an algebra are also introduced and optimal solutions for u(d) are provided.

11 nodes10 linksoverview mapHamiltonian Purification
11 nodes10 links
Hamiltonian Purification11 visible / 11 total nodes / 31 links
Co-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipCo-authorshipAuthorshipAuthorshipAuthorshipAuthorshipTopic signalTopic signalTopic signalAuthorshipAuthorshipAuthorshipWHamiltonian Purificationpreprint / 2014ADavide OrsucciResearcherADaniel BurgarthResearcherAPaolo FacchiResearcherAHiromichi NakazatoResearcherTquant-ph17817 worksTmath-ph7974 worksTmath.MP7972 worksASaverio PascazioResearcherAKazuya YuasaResearcherAVittorio GiovannettiResearcher
PaperSignal 1010 links

Hamiltonian Purification

preprint / 2014

Open