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 Renyi-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.
Investigating the influence of quantum information (QI) scrambling on quantum correlations in a physical system is an interesting problem. In this article we establish the mathematical connections among the quantifiers known as quantum information scrambling, Uhlmann fidelity, Bures metric and bipartite concurrence. We study these relations via four point out-of-time-order correlation (OTOC) function used for quantum information scrambling. Further we study the dynamics of all the quantifiers and investigate the influence of QI scrambling on entanglement in two qubits prepared in Bell states. …
Efficient verification of quantum states and gates is crucial to the development of quantum technologies. Although the sample complexities of quantum state verification and quantum gate verification have been studied by many researchers, the number of experimental settings has received little attention and is poorly understood. In this work we study systematically quantum state verification and quantum gate verification with a focus on the number of experimental settings. We show that any bipartite pure state can be verified by only two measurement settings based on local projective measuremen…
We develop a connection between tripartite information $I_3$, secret sharing protocols and multi-unitaries. This leads to explicit ((2,3)) threshold schemes in arbitrary dimension minimizing tripartite information $I_3$. As an application we show that Page scrambling unitaries simultaneously work for all secrets shared by Alice. Using the $I_3$-Ansatz for imperfect sharing schemes we discover examples of VIP sharing schemes.
We analyze implementations of bipartite unitaries by means of local operations and classical communication (LOCC) assisted by shared entanglement. We employ concepts and techniques developed in quantum Shannon theory to study an asymptotic scenario, in which two distant parties perform the same bipartite unitary on infinitely many pairs of inputs. We analyze minimum cost of entanglement and classical communication per copy. For two-round LOCC protocols, we derive a single-letter formula for the minimum cost of entanglement and classical communication, under an additional requirement that the e…
In recent years, the out-of-time-order correlator (OTOC) has emerged as a diagnostic tool for information scrambling in quantum many-body systems. Here, we present exact analytical results for the OTOC for a typical pair of random local operators supported over two regions of a bipartition. Quite remarkably, we show that this "bipartite OTOC" is equal to the operator entanglement of the evolution and we determine its interplay with entangling power. Furthermore, we compute long-time averages of the OTOC and reveal their connection with eigenstate entanglement. For Hamiltonian systems, we uncov…
Out-of-time-order correlators (OTOC), vigorously being explored as a measure of quantum chaos and information scrambling, is studied here in the natural and simplest multi-particle context of bipartite systems. We show that two strongly chaotic and weakly interacting subsystems display two distinct phases in the growth of OTOC.The first is dominated by intra-subsystem scrambling, when an exponential growth with a positive Lyapunov exponent is observed till the Ehrenfest time. This phase is essentially independent of the interaction, while the second phase is an interaction dominated exponentia…
Out-of-time-ordered correlators (OTOCs) have been extensively studied in recent years as a diagnostic of quantum information scrambling. In this paper, we study quantum information-theoretic aspects of the regularized finite-temperature OTOC. We introduce analytical results for the bipartite regularized OTOC (BROTOC): the regularized OTOC averaged over random unitaries supported over a bipartition. We show that the BROTOC has several interesting properties, for example, it quantifies the purity of the associated thermofield double state and the operator purity of the analytically continued tim…
We study quantum information scrambling in spin models with both long-range all-to-all and short-range interactions. We argue that a simple global, spatially homogeneous interaction together with local chaotic dynamics is sufficient to give rise to fast scrambling, which describes the spread of quantum information over the entire system in a time that is logarithmic in the system size. This is illustrated in two tractable models: (1) a random circuit with Haar random local unitaries and a global interaction and (2) a classical model of globally coupled non-linear oscillators. We use exact nume…
Out-of-time-ordered correlators (OTOCs) have been extensively used over the last few years to study information scrambling and quantum chaos in many-body systems. In this paper, we extend the formalism of the averaged bipartite OTOC of Styliaris et al [Phys. Rev. Lett. 126, 030601 (2021)] to the case of open quantum systems. The dynamics is no longer unitary but it is described by more general quantum channels (trace preserving, completely positive maps). This "open bipartite OTOC" can be treated in an exact analytical fashion and is shown to amount to a distance between two quantum channels. …
Classifying locally equivalent graph states, and stabilizer states more broadly, is a significant problem in the theories of quantum information and multipartite entanglement. A special focus is given to those graph states for which equivalence through local unitaries implies equivalence through local Clifford unitaries (LU $\Leftrightarrow$ LC). Identification of locally equivalent states in this class is facilitated by a convenient transformation rule on the underlying graphs and an efficient algorithm. Here we investigate the question of local equivalence of the graph states behind the all-…
We investigate the propagation of local bipartite quantum correlations, along with the tripartite mutual information to characterize the information scrambling through dynamical evolution of spin chains. Starting from an initial state with the first pair of spins in a Bell state, we study how quantum correlations spread to other parts of the system, using different representative spin Hamiltonians, viz. the Heisenberg Model, a spin-conserving model, the transverse-field XY model, a non-conserving but integrable model, and the kicked Harper model, a spin conserving but nonintegrable model. We s…
Institute for Quantum Optics and Quantum Information of the Austrian Academy of Sciences（奥地利科学院量子光学和量子信息研究所）；Faculty of Physics, University of Warsaw（华沙大学物理系）；Qilimanjaro Quantum Tech（基利马扎罗量子技术）
Maximally entangled bipartite unitary operators or gates find various applications from quantum information to being building blocks of minimal models of many-body quantum chaos, and have been referred to as "dual unitaries". Dual unitary operators that can create the maximum average entanglement when acting on product states have to satisfy additional constraints. These have been called "2-unitaries" and are examples of perfect tensors that can be used to construct absolutely maximally entangled states of four parties. Hitherto, no systematic method exists, in any local dimension, which resul…
Topological Control of Quantum Chaos Diagnostics: OTOCs, Spectral Statistics, and Information Scrambling in Ising Model
School of Quantum Physics and Matter Institute for Research in Fundamental Sciences (IPM)（量子物理与物质学院，基础科学研究院（IPM））；Ershad Damavand, Institute of Higher Education (EDI)（厄尔沙德达马万德高等教育研究所（EDI））；Department of Mathematics and Computer Science, Amirkabir University of Technology（阿米尔卡比尔理工大学数学与计算机科学系）；Department of Mathematics, Faculty of Mathematical Sciences, Alzahra University（阿尔扎哈拉大学数学科学学院数学系）；Department of Physics, CT.C, Islamic Azad University（伊斯兰阿扎德大学CT.C物理学系）；Institute of Biosocial and Quantum Science and Technologies, CT.C, Islamic Azad University（伊斯兰阿扎德大学CT.C生物社会与量子科学与技术研究所）
Entanglement assistance is known to reduce the quantum communication complexity of evaluating functions with distributed inputs. But does the type of entanglement matter, or are EPR pairs always sufficient? This is a natural question because in several other settings maximally entangled states are known to be less useful as a resource than some partially entangled state. These include non-local games, tasks with quantum communication between players and referee, and simulating bipartite unitaries or communication channels. By contrast, we prove that the bounded-error entanglement-assisted quan…
Masking quantum information, which is impossible without randomness as a resource, is a task that encodes quantum information into bipartite quantum state while forbidding local parties from accessing to that information. In this work, we disprove the geometric conjecture about unitarily maskable states [K. Modi et al., Phys. Rev. Lett. 120, 230501 (2018)], and make an algebraic analysis of quantum masking. First, we show a general result on quantum channel mixing that a subchannel's mixing probability should be suppressed if its classical capacity is larger than the mixed channel's capacity. …
