Quantum defragmentation algorithm

H...............H

Show simple item record

dc.contributor.author Burgarth, Daniel Klaus
dc.contributor.author Giovannetti, Vittorio
dc.date.accessioned 2011-09-26T14:37:48Z
dc.date.available 2011-09-26T14:37:48Z
dc.date.issued 2010-08-19
dc.identifier.citation Burgarth , D K & Giovannetti , V 2010 , ' Quantum defragmentation algorithm ' Physical Review A , vol 82 , no. 2 . en
dc.identifier.issn 1050-2947
dc.identifier.other PURE: 171149
dc.identifier.other dspace: 2160/7597
dc.identifier.uri http://hdl.handle.net/2160/7597
dc.description D. Burgarth and V. Giovannetti, Phys. Rev. A, 82,024302 (2010) en
dc.description.abstract In this addendum to our paper [ D. Burgarth and V. Giovannetti Phys. Rev. Lett. 99 100501 (2007)] we prove that during the transformation that allows one to enforce control by relaxation on a quantum system, the ancillary memory can be kept at a finite size, independently from the fidelity one wants to achieve. The result is obtained by introducing the quantum analog of defragmentation algorithms which are employed for efficiently reorganizing classical information in conventional hard disks. en
dc.language.iso eng
dc.relation.ispartof Physical Review A en
dc.title Quantum defragmentation algorithm en
dc.type Text en
dc.type.publicationtype Article (Journal) en
dc.identifier.doi http://dx.doi.org/10.1103/PhysRevA.82.024302
dc.contributor.institution Quantum Systems, Information and Control en
dc.contributor.institution Institute of Mathematics & Physics (ADT) en
dc.description.status Peer reviewed en


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Cadair


Advanced Search

Browse

My Account