Bruno Bertini (Author), Lorenzo Piroli (Author)

Abstract

We study the scrambling of quantum information in local random unitary circuits by focusing on the tripartite information proposed by Hosur et al. We provide exact results for the averaged Rényi-2 tripartite information in two cases: (i) the local gates are Haar random and (ii) the local gates are dual-unitary and randomly sampled from a single-site Haar-invariant measure. We show that the latter case defines a one-parameter family of circuits, and prove that for a “maximally chaotic” subset of this family quantum information is scrambled faster than in the Haar-random case. Our approach is based on a standard mapping onto an averaged folded tensor network, that can be studied by means of appropriate recurrence relations. By means of the same method, we also revisit the computation of out-of-time-ordered correlation functions, rederiving known formulas for Haar-random unitary circuits, and presenting an exact result for maximally chaotic random dual-unitary gates.

Keywords

neravnovesna statistična mehanika;kvantni kaos;nonequilibrium statistical mechanics;quantum chaos;

Data

Language: English
Year of publishing:
Typology: 1.01 - Original Scientific Article
Organization: UL FMF - Faculty of Mathematics and Physics
UDC: 536.93
COBISS: 43003139 Link will open in a new window
ISSN: 2469-9950
Views: 265
Downloads: 262
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

Secondary language: Slovenian
Secondary keywords: neravnovesna statistična mehanika;kvantni kaos;
Pages: str. 064305-1-064305-25
Volume: ǂVol. ǂ102
Issue: ǂiss. ǂ6
Chronology: 2020
DOI: 10.1103/PhysRevB.102.064305
ID: 12345753