Operator spreading in random circuits with orthogonal or symplectic symmetry
- URL: http://arxiv.org/abs/2606.03956v1
- Date: Tue, 02 Jun 2026 17:45:55 GMT
- Title: Operator spreading in random circuits with orthogonal or symplectic symmetry
- Abstract summary: We find that the ensemble-averaged Pauli-string weights relax to a ternary-valued structure, instead of the binary structure of unitary-invariant circuits.<n>For qudit size $q=2$, the butterfly velocity can exceed that of the Haar-random ensemble.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We investigate operator spreading in random quantum circuits with gates drawn from orthogonal-invariant or symplectic-invariant ensembles, revealing several key distinctions from the well-studied unitary-invariant case. We find that the ensemble-averaged Pauli-string weights relax to a ternary-valued structure, instead of the binary structure of unitary-invariant circuits. For orthogonal- or symplectic-invariant circuits, the domain wall separating trivial and scrambled regions has a finite width even for Haar-random gates, whereas domain walls are sharp for Haar-distributed random unitary circuits. We further find a fundamental dichotomy between random circuits with two-qubit gates from the two disconnected components of the orthogonal group: While the butterfly velocity for the special orthogonal ensemble lies between zero and the Haar value, the negative-determinant sector exhibits a non-zero lower bound for any gate distribution. Moreover, for qudit size $q=2$, the butterfly velocity can exceed that of the Haar-random ensemble.
Related papers
- Open-boundary integrable quantum circuits with different geometries [0.0]
We conjecture that time-periodic quantum circuits are integrable whenever the local bulk and boundary gates satisfy the Yang-Baxter equation.<n>Our construction is fully general and applies to regular $R$-matrices, both of difference and non-difference type, together with their associated boundary matrices.
arXiv Detail & Related papers (2026-07-02T12:31:43Z) - Unitary Designs from Doped Matchgate Circuits [0.0]
We study a controlled route by doping matchgate circuits with non-Gaussian gates-physically.<n>We find approximate parity-preserving $2$-designs in polylogarithmic depth with a sparse non-Gaussian gate count.<n>Our results establish doped matchgate circuits as a controlled, analytically tractable route from free fermions to interaction-generated quantum designs.
arXiv Detail & Related papers (2026-06-22T18:00:04Z) - Symmetry-protected topology and deconfined solitons in a multi-link $\mathbb{Z}_2$ gauge theory [45.88028371034407]
We study a $mathbbZ$ lattice gauge theory defined on a multi-graph with links that can be visualized as great circles of a spherical shell.<n>We show that this leads to state-dependent tunneling amplitudes underlying a phenomenon analogous to the Peierls instability.<n>By performining a detailed analysis based on matrix product states, we prove that charge deconfinement emerges as a consequence of charge-fractionalization.
arXiv Detail & Related papers (2026-03-02T22:59:25Z) - Operator Spreading in Random Unitary Circuits with Unitary-invariant Gate Distributions [0.0]
We investigate operator spreading in random unitary circuits in which the elementary gate operations are drawn from general unitary-invariant ensembles.<n>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.
arXiv Detail & Related papers (2025-01-07T19:00:04Z) - Topological nature of edge states for one-dimensional systems without symmetry protection [46.87902365052209]
We numerically verify and analytically prove a winding number invariant that correctly predicts the number of edge states in one-dimensional, nearest-neighbor (between unit cells)<n>Our winding number is invariant under unitary or similarity transforms.
arXiv Detail & Related papers (2024-12-13T19:44:54Z) - 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.<n>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) - Symmetry-restricted quantum circuits are still well-behaved [45.89137831674385]
We show that quantum circuits restricted by a symmetry inherit the properties of the whole special unitary group $SU(2n)$.
It extends prior work on symmetric states to the operators and shows that the operator space follows the same structure as the state space.
arXiv Detail & Related papers (2024-02-26T06:23:39Z) - 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) - Adaptive constant-depth circuits for manipulating non-abelian anyons [65.62256987706128]
Kitaev's quantum double model based on a finite group $G$.
We describe quantum circuits for (a) preparation of the ground state, (b) creation of anyon pairs separated by an arbitrary distance, and (c) non-destructive topological charge measurement.
arXiv Detail & Related papers (2022-05-04T08:10:36Z) - 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)
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.