#6219. Non-Markovian memory strength bounds quantum process recoverability

September 2026publication date
Proposal available till 18-05-2025
4 total number of authors per manuscript0 $

The title of the journal is available only for the authors who have already paid for
Journal’s subject area:
Computer Science (miscellaneous);
Statistical and Nonlinear Physics;
Computational Theory and Mathematics;
Computer Networks and Communications;
Places in the authors’ list:
place 1place 2place 3place 4
FreeFreeFreeFree
2350 $1200 $1050 $900 $
Contract №6219.1 Contract №6219.2 Contract №6219.3 Contract №6219.4
1 place - free (for sale)
2 place - free (for sale)
3 place - free (for sale)
4 place - free (for sale)

Abstract:
Generic non-Markovian quantum processes have infinitely long memory, implying an exact description that grows exponentially in complexity with observation time. Here, we present a finite memory ansatz that approximates (or recovers) the true process with errors bounded by the strength of the non-Markovian memory. The introduced memory strength is an operational quantity and depends on the way the process is probed. Remarkably, the recovery error is bounded by the smallest memory strength over all possible probing methods. This allows for an unambiguous and efficient description of non-Markovian phenomena, enabling compression and recovery techniques pivotal to near-term technologies. We highlight the implications of our results by analyzing an exactly solvable model to show that memory truncation is possible even in a highly non-Markovian regime.
Keywords:
+

Contacts :
0