Operator Spreading in Random Unitary Circuits with Unitary-invariant Gate Distributions

• URL: http://arxiv.org/abs/2501.04091v2
• Date: Fri, 10 Jan 2025 09:51:20 GMT
• Title: Operator Spreading in Random Unitary Circuits with Unitary-invariant Gate Distributions
• Authors: Zhiyang Tan, Piet W. Brouwer,
• Abstract summary: We investigate operator spreading in random unitary circuits in which the elementary gate operations are drawn from general unitary-invariant ensembles. Similar to the Haar-distributed case, the long-time behavior of operator spreading with the more general unitary-invariant gate distribution is governed by drift-diffusion equations.
• Score: 0.0
• License:
• Abstract: Random unitary circuits have become a model system to investigate information scrambling in quantum systems. In the literature, mostly random circuits with Haar-distributed gate operations have been considered. In this work, we investigate operator spreading in random unitary circuits in which the elementary gate operations are drawn from general unitary-invariant ensembles, which include the well-studied Haar-distributed random unitary circuits as a special case. Similar to the Haar-distributed case, the long-time behavior of operator spreading with the more general unitary-invariant gate distribution is governed by drift-diffusion equations characterized by the butterfly velocity $v_{\rm B}$ and a diffusion constant $\mathcal{D}$. Differences with the Haar-random case are (i) that it takes a finite time $\tau_{\rm b}$ until ensemble-averaged Pauli-string weights take a ``binary'' form, in which they depend only on whether Pauli operators inside the support of the Pauli strong are equal to the identity matrix, and (ii) that the operator spreading is characterized by a finite ``domain-wall width'' $n_{\rm DW}$ separating regions with a random-matrix-like Pauli-string distribution. To illustrate these findings, we perform explicit calculations for random unitary circuits distributed according to the Poisson kernel, which interpolates between the trivial and Haar-distributed circuits.

Related papers

• More global randomness from less random local gates [0.26388783516590225]
  We prove that one-dimensional structured random circuits with non-Haar random local gates can exhibit substantially more global randomness compared to Haar random circuits with the same underlying circuit architecture. Our findings have applications in improving circuit depth bounds for randomized benchmarking and the generation of approximate unitary 2-designs from shallow random circuits.
  arXiv  Detail & Related papers  (2024-10-31T16:51:52Z)
• Probabilistic Representation of Commutative Quantum Circuit Models [1.2733144214254712]
  In commuting quantum circuits, the Fourier series of the pairwise fidelity can be expressed as the characteristic function of random variables. We generalize this construction to any commuting set of Pauli operators.
  arXiv  Detail & Related papers  (2024-10-24T22:02:44Z)
• Architectures and random properties of symplectic quantum circuits [0.0]
  Parametrized and random unitary $n$-qubit circuits play a central role in quantum information. We present a universal set of generators $mathcalG$ for the symplectic algebra $imathfraksp(d/2)$. We find that the operators in $mathcalG$ cannot generate arbitrary local symplectic unitaries. We then review the Schur-Weyl duality between the symplectic group and the Brauer algebra, and use tools from Weingarten calculus to prove that Pauli measurements can converge
  arXiv  Detail & Related papers  (2024-05-16T17:15:39Z)
• Adaptive Annealed Importance Sampling with Constant Rate Progress [68.8204255655161]
  Annealed Importance Sampling (AIS) synthesizes weighted samples from an intractable distribution. We propose the Constant Rate AIS algorithm and its efficient implementation for $alpha$-divergences.
  arXiv  Detail & Related papers  (2023-06-27T08:15:28Z)
• Policy Evaluation in Distributional LQR [70.63903506291383]
  We provide a closed-form expression of the distribution of the random return. We show that this distribution can be approximated by a finite number of random variables. Using the approximate return distribution, we propose a zeroth-order policy gradient algorithm for risk-averse LQR.
  arXiv  Detail & Related papers  (2023-03-23T20:27:40Z)
• Dual unitary circuits in random geometries [0.0]
  We show that regularity of the lattice circuit is not crucial for exact solvability. We consider a circuit where random 2-qubit dual unitary gates sit at intersections of random arrangements straight lines in two dimensions.
  arXiv  Detail & Related papers  (2022-06-20T09:11:43Z)
• Random quantum circuits transform local noise into global white noise [118.18170052022323]
  We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime. For local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between the output distribution $p_textnoisy$ of a generic noisy circuit instance shrink exponentially. If the noise is incoherent, the output distribution approaches the uniform distribution $p_textunif$ at precisely the same rate.
  arXiv  Detail & Related papers  (2021-11-29T19:26:28Z)
• Quantum simulation of $\phi^4$ theories in qudit systems [53.122045119395594]
  We discuss the implementation of quantum algorithms for lattice $Phi4$ theory on circuit quantum electrodynamics (cQED) system. The main advantage of qudit systems is that its multi-level characteristic allows the field interaction to be implemented only with diagonal single-qudit gates.
  arXiv  Detail & Related papers  (2021-08-30T16:30:33Z)
• Random quantum circuits anti-concentrate in log depth [118.18170052022323]
  We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated. Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform. In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
  arXiv  Detail & Related papers  (2020-11-24T18:44:57Z)
• Coherent randomized benchmarking [68.8204255655161]
  We show that superpositions of different random sequences rather than independent samples are used. We show that this leads to a uniform and simple protocol with significant advantages with respect to gates that can be benchmarked.
  arXiv  Detail & Related papers  (2020-10-26T18:00:34Z)
• Scrambling in Random Unitary Circuits: Exact Results [0.0]
  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'enyi-$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.
  arXiv  Detail & Related papers  (2020-04-28T17:52:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.