Quantum Defragmentation Algorithm

Abstract

In this addendum of 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. Our result also implies that the reduced dynamics in any noisy system can be simulated with finitely many resources.

2 pages, 1 figure

References in corpus (9)

• Quantum Communication through Spin Chain Dynamics: an Introductory Overview
• Full control by locally induced relaxation
• Local controllability of quantum networks
• Improved transfer of quantum information using a local memory
• State Transfer and Spin Measurement
• Optimal quantum chain communication by end gates
• Universal quantum interfaces
• Iterative quantum state transfer along a chain of nuclear spin qubits
• The Computational Power of Symmetric Hamiltonians