We introduce two information-theoretical invariants for the projective unitary group acting on a finite-dimensional complex Hilbert space: PVM- and POVM-dynamical (quantum) entropies. They quantify the randomness of the successive quantum measurement results in the case where the evolution of the system between each two consecutive measurements is described by a given unitary operator. We study the class of chaotic unitaries, i.e., the ones of maximal entropy or, equivalently, such that they can be represented by suitably rescaled complex Hadamard matrices in some orthonormal bases. We provide necessary conditions for a unitary operator to be chaotic, which become also sufficient for qubits and qutrits. These conditions are expressed in terms of the relation between the trace and the determinant of the operator. We also compute the volume of the set of chaotic unitaries in dimensions two and three, and the average PVM-dynamical entropy over the unitary group in dimension two. We prove that this mean value behaves as the logarithm of the dimension of the Hilbert space, which implies that the probability that the dynamical entropy of a unitary is almost as large as possible approaches unity as the dimension tends to infinity.
We introduce the concept of K-th order chaoticity of unitaries, and analyze it for the case of two-level quantum systems. This property is relevant in a certain quantum random number generation scheme. We show that no unitaries exist with an arbitrary order of chaoticity.
Quasi-Monte Carlo Method for Linear Combination Unitaries via Classical Post-Processing
Graduate School of Engineering Science, The University of Osaka（大阪大学工学研究科）；Center for Quantum Information and Quantum Biology, The University of Osaka（大阪大学量子信息与量子生物学中心）；RIKEN Center for Quantum Computing (RQC)（理化学研究所量子计算中心）
We have implemented a Walsh-Hadamard gate, which performs a quantum Fourier transform, in a superconducting qutrit. The qutrit is encoded in the lowest three energy levels of a capacitively shunted flux device, operated at the optimal flux-symmetry point. We use an efficient decomposition of the Walsh-Hadamard gate into two unitaries, generated by off-diagonal and diagonal Hamiltonians respectively. The gate implementation utilizes simultaneous driving of all three transitions between the three pairs of energy levels of the qutrit, one of which is implemented with a two-photon process. The gat…
We present the quantum computation of nuclear observables where the operators of interest are first decomposed in terms of the linear combination of unitaries. Then we utilise the Hadamard test and the linear combination of unitaries (LCU) based methods to compute the expectation values. We apply these methods to calculate the electric quadrupole moment of deuteron. The results are compared for the Jordan-Wigner transformation and Gray code encoding. We discuss the versatility of our approach that can be utilized in general to calculate several observables on a quantum computer.
The Clifford group plays a central role in quantum randomized benchmarking, quantum tomography, and error correction protocols. Here we study the structural properties of this group. We show that any Clifford operator can be uniquely written in the canonical form $F_1HSF_2$, where $H$ is a layer of Hadamard gates, $S$ is a permutation of qubits, and $F_i$ are parameterized Hadamard-free circuits chosen from suitable subgroups of the Clifford group. Our canonical form provides a one-to-one correspondence between Clifford operators and layered quantum circuits. We report a polynomial-time algori…
In certain analytically-tractable quantum chaotic systems, the calculation of out-of-time-order correlation functions, entanglement entropies after a quench, and other related dynamical observables, reduces to an effective theory of an ``entanglement membrane'' in spacetime. These tractable systems involve an average over random local unitaries defining the dynamical evolution. We show here how to make sense of this membrane in more realistic models, which do not involve an average over random unitaries. Our approach relies on introducing effective pairing degrees of freedom in spacetime, desc…
Unitary designs from perturbed time evolutions of a chaotic Hamiltonian
International Center for Quantum Materials, School of Physics, Peking University（北京大学物理学院量子材料中心）；Wilczek Quantum Center, Shanghai Institute for Advanced Studies, University of Science and Technology of China（中国科学院大学上海高等研究院吴文俊亚洲数学中心）；Hefei National Laboratory（合肥国家实验室）；Beijing Key Laboratory of Quantum Devices, Peking University（北京大学量子器件北京市重点实验室）
We study random quantum circuits with symmetry, where the local 2-site unitaries are drawn from a quotient or subgroup of the full unitary group $U(d)$. Random quantum circuits are minimal models of local quantum chaotic dynamics and can be used to study operator growth and the emergence of diffusive hydrodynamics. We derive the transition probabilities for the stochastic process governing the growth of operators in four classes of symmetric random circuits. We then compute the butterfly velocities and diffusion constants for a spreading operator by solving a simple random walk in each class o…
University of California, Berkeley（加州大学伯克利分校）；Lawrence Berkeley National Laboratory（劳伦斯伯克利国家实验室）；St. Kliment Ohridski University of Sofia（圣基里尔·奥赫里德斯基索菲亚大学）
The quantum alternating operator ansatz (QAOA) is a prominent example of variational quantum algorithms. We propose a generalized QAOA called CD-QAOA, which is inspired by the counterdiabatic driving procedure, designed for quantum many-body systems and optimized using a reinforcement learning (RL) approach. The resulting hybrid control algorithm proves versatile in preparing the ground state of quantum-chaotic many-body spin chains by minimizing the energy. We show that using terms occurring in the adiabatic gauge potential as generators of additional control unitaries, it is possible to achi…
We study the consequences of having translational invariance in space and in time in many-body quantum chaotic systems. We consider an ensemble of random quantum circuits, composed of single-site random unitaries and nearest neighbour couplings, as a minimal model of translational invariant many-body quantum chaotic systems. We evaluate the spectral form factor (SFF) as a sum over many-body Feynman diagrams, which simplifies in the limit of large local Hilbert space dimension $q$. At sufficiently large $t$, diagrams corresponding to rigid translations dominate, reproducing the chaotic behavior…
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 use simple deterministic dynamical systems as coins in studying quantum walks. These dynamical systems can be chosen to display, in the classical limit, a range of behaviors from the integrable to chaotic, or deterministically random. As an example of an integrable coin we study the Fourier walk that generalizes the Hadamard walk and show that the walker slows down with coin dimensionality, which controls the effective Planck constant. Introducing multi-Harper maps as deterministic models of random walks we study the effect of coin chaos on the quantum walk. We also demonstrate that breakin…
Recent works have investigated the emergence of a new kind of random matrix behaviour in unitary dynamics following a quantum quench. Starting from a time-evolved state, an ensemble of pure states supported on a small subsystem can be generated by performing projective measurements on the remainder of the system, leading to a projected ensemble. In chaotic quantum systems it was conjectured that such projected ensembles become indistinguishable from the uniform Haar-random ensemble and lead to a quantum state design. Exact results were recently presented by Ho and Choi [Phys. Rev. Lett. 128, 0…
The concept of quantum complexity has far-reaching implications spanning theoretical computer science, quantum many-body physics, and high energy physics. The quantum complexity of a unitary transformation or quantum state is defined as the size of the shortest quantum computation that executes the unitary or prepares the state. It is reasonable to expect that the complexity of a quantum state governed by a chaotic many-body Hamiltonian grows linearly with time for a time that is exponential in the system size; however, because it is hard to rule out a short-cut that improves the efficiency of…
In this paper we describe an algebraic/geometrical approach to quantum scrambling. Generalized quantum subsystems are described by an hermitian-closed unital subalgebra $\cal A$ of operators evolving through a unitary channel. Qualitatively, quantum scrambling is defined by how the associated physical degrees of freedom get mixed up with others by the dynamics. Quantitatively, this is accomplished by introducing a measure, the geometric algebra anti-correlator (GAAC), of the self-orthogonalization of the commutant of $\cal A$ induced by the dynamics. This approach extends and unifies averaged …
Bridging Classical and Quantum Information Scrambling with the Operator Entanglement Spectrum
University of Colorado, Boulder（科罗拉多大学博尔德分校）；Ames National Laboratory（艾姆斯国家实验室）；Purdue University（普渡大学）；Louisiana State University（路易斯安那州立大学）；Iowa State University（爱荷华州立大学）；The Pennsylvania State University（宾夕法尼亚州立大学）
We address the difference between integrable and chaotic motion in quantum theory as manifested by the complexity of the corresponding evolution operators. Complexity is understood here as the shortest geodesic distance between the time-dependent evolution operator and the origin within the group of unitaries. (An appropriate `complexity metric' must be used that takes into account the relative difficulty of performing `nonlocal' operations that act on many degrees of freedom at once.) While simply formulated and geometrically attractive, this notion of complexity is numerically intractable sa…
Practical block encodings of matrix polynomials that can also be trivially controlled
Technical University of Munich（慕尼黑工业大学）；KU Leuven, University of Leuven（荷语鲁汶大学）；Lawrence Berkeley National Laboratory（劳伦斯伯克利国家实验室）；Google Quantum AI（谷歌量子人工智能）
Dynamical simulations of many-body quantum chaos on a quantum computer
IBM Quantum, IBM Research Europe – Zurich（IBM量子，IBM欧洲苏黎世研究院）；École Polytechnique Fédérale de Lausanne（洛桑联邦理工学院）；Algorithmiq Ltd（Algorithmiq有限公司）；IBM Quantum, IBM Research - Cambridge（IBM量子，IBM剑桥研究院）；IBM Quantum, IBM Research Europe - Dublin（IBM量子，IBM欧洲都柏林研究院）；School of Physics, Trinity College Dublin（都柏林三一学院物理系）；Dipartimento di Fisica “Aldo Pontremoli”, Università degli Studi di Milano（米兰大学阿尔多·庞特莫利物理系）；IBM Quantum, IBM T.J. Watson Research Center（IBM量子，IBM托马斯·J·沃森研究中心）
Deterministic classical dynamical systems have an ergodic hierarchy, from ergodic through mixing, to Bernoulli systems that are "as random as a coin-toss". Dual-unitary circuits have been recently introduced as solvable models of many-body nonintegrable quantum chaotic systems having a hierarchy of ergodic properties. We extend this to include the apex of a putative quantum ergodic hierarchy which is Bernoulli, in the sense that correlations of single and two-particle observables vanish at space-time separated points. We derive a condition based on the entangling power $e_p(U)$ of the basic tw…
Random quantum circuits yield minimally structured models for chaotic quantum dynamics, able to capture for example universal properties of entanglement growth. We provide exact results and coarse-grained models for the spreading of operators by quantum circuits made of Haar-random unitaries. We study both 1+1D and higher dimensions, and argue that the coarse-grained pictures carry over to operator spreading in generic many-body systems. In 1+1D, we demonstrate that the out-of-time-order correlator (OTOC) satisfies a biased diffusion equation, which gives exact results for the spatial profile …
