# Learning efficient decoders for quasi-chaotic quantum scramblers

### APA

Leone, L. (2022). Learning efficient decoders for quasi-chaotic quantum scramblers. Perimeter Institute. https://pirsa.org/22110117

### MLA

Leone, Lorenzo. Learning efficient decoders for quasi-chaotic quantum scramblers. Perimeter Institute, Nov. 30, 2022, https://pirsa.org/22110117

### BibTex

@misc{ pirsa_PIRSA:22110117, doi = {10.48660/22110117}, url = {https://pirsa.org/22110117}, author = {Leone, Lorenzo}, keywords = {Quantum Information}, language = {en}, title = {Learning efficient decoders for quasi-chaotic quantum scramblers}, publisher = {Perimeter Institute}, year = {2022}, month = {nov}, note = {PIRSA:22110117 see, \url{https://pirsa.org}} }

Lorenzo Leone University of Massachusetts Boston

## Abstract

**Scrambling of quantum information is an important feature at the root of randomization and benchmarking protocols, the onset of quantum chaos, and black-hole physics.**

**Unscrambling this information is possible given perfect knowledge of the scrambler [ArXiv: 1710.03363].**

**We show that one can retrieve the scrambled information without any previous knowledge of the scrambler, by a learning algorithm that allows the building of an efficient decoder. Surprisingly, complex quantum scramblers admit Clifford decoders: the salient properties of a scrambling unitary can be efficiently described even if exponentially complex, as long as it is not fully chaotic. This is possible because all the redundant complexity can be described as an entropy, and for non-chaotic black holes can be efficiently pushed away, just like in a refrigerator. This entropy is not due to thermal fluctuations but to the non-stabilizer behavior of the scrambler.**