Out-of-time-order (OTO) operators have recently become popular diagnostics of quantum chaos in many-body systems. The usual way they are introduced is via a quantization of classical Lyapunov growth, which measures the divergence of classical trajectories in phase space due to the butterfly effect. However, it is not obvious how exactly they capture the sensitivity of a quantum system to its initial conditions beyond the classical limit. In this paper, we analyze sensitivity to initial conditions in the quantum regime by recasting OTO operators for many-body systems using various formulations of quantum mechanics. Notably, we utilize the Wigner phase space formulation to derive an -expansion of the OTO operator for spatial degrees of freedom, and a large spin 1/sexpansion for spin degrees of freedom. We find in each case that the leading term is the Lyapunov growth for the classical limit of the system and argue that quantum corrections become dominant at around the scrambling time, which is also when we expect the OTO operator to saturate. We also express the OTO operator in terms of propagators and see from a different point of view how it is a quantum generalization of the divergence of classical trajectories.
One way to diagnose chaos in bipartite unitary channels is via the tripartite information of the corresponding Choi state, which for certain choices of the subsystems reduces to the negative conditional mutual information (CMI). We study this quantity from a quantum information-theoretic perspective to clarify its role in diagnosing scrambling. When the CMI is zero, we find that the channel has a special normal form consisting of local channels between individual inputs and outputs. However, we find that arbitrarily low CMI does not imply arbitrary proximity to a channel of this form, although it does imply a type of approximate recoverability of one of the inputs. When the CMI is maximal, we find that the residual channel from an individual input to an individual output is completely depolarizing when the other input is maximally mixed. However, we again find that this result is not robust. We also extend some of these results to the multipartite case and to the case of Haar-random pure input states. Finally, we look at the relationship between tripartite information and its Rényi-2 version which is directly related to out-of-time-order correlation functions. In particular, we demonstrate an arbitrarily large gap between the two quantities.
We develop an algorithmic framework for contracting tensor networks and demonstrate its power by classically simulating quantum computation of sizes previously deemed out of reach. Our main contribution, index slicing, is a method that efficiently parallelizes the contraction by breaking it down into much smaller and identically structured subtasks, which can then be executed in parallel without dependencies. We benchmark our algorithm on a class of random quantum circuits, achieving greater than 105 times acceleration over the original estimate of the simulation cost. We then demonstrate applications of the simulation framework for aiding the development of quantum algorithms and quantum error correction. As tensor networks are widely used in computational science, our simulation framework may find further applications.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.