How long can it take for a quantum channel to forget everything?

preprint2012arXivOpen access

Abstract

We investigate quantum channels, which after a finite number kk of repeated applications erase all input information, i.e., channels whose kk-th power (but no smaller power) is a completely depolarizing channel. We show that on a system with Hilbert space dimension dd, the order is bounded by k≤d2−1k\leq d^2-1, and give an explicit construction scheme for such channels. We also consider strictly forgetful memory channels, i.e., channels with an additional input and output in every step, which after exactly kk steps retain no information about the initial memory state. We establish an explicit representation for such channels showing that the same bound applies for the memory depth kk in terms of the memory dimension dd.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.