Graph-State Circuit Blocks control Entanglement and Scrambling Velocities

• URL: http://arxiv.org/abs/2605.11076v1
• Date: Mon, 11 May 2026 18:00:03 GMT
• Title: Graph-State Circuit Blocks control Entanglement and Scrambling Velocities
• Abstract summary: We show that the internal structure of multipartite circuit primitives can significantly influence entanglement rates.<n>We study an exactly simulable family of Clifford quantum circuits built from fixed $n$-qubit graph-state preparation unitaries.
• Score: 0.009020554443775785
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Random circuit models often describe local dynamics using generic two-qubit gates, which have proven successful in capturing entanglement growth and operator spreading in many contexts. This approach naturally leads to the expectation that detailed gate structure plays only a limited role in coarse-grained entanglement and scrambling diagnostics. We show that the internal structure of multipartite circuit primitives can significantly influence these dynamical rates, even within a fixed random-circuit architecture. To investigate this, we study an exactly simulable family of Clifford quantum circuits built from fixed $n$-qubit graph-state preparation unitaries, which we treat as elementary building blocks. Specifically, we consider a one-dimensional chain of $N$ qubits initialized in a product state and evolved by layers in which nonoverlapping length-$n$ blocks are placed at uniformly random positions with sparsity $α$. We find that different choices of graph-state building blocks lead to strongly varying dynamical rates. Graph states that are inequivalent under local Clifford (LC) transformations generate sharply different entanglement velocities $v_E$ and butterfly velocities $v_B$, even though the circuits are drawn from the same ensemble with identical architecture and randomness parameters. We further show that this hierarchy is captured by two complementary block-level characteristics: the distribution of entanglement across internal bipartitions of the graph state, which correlates with $v_E$, and a graph-theoretic connectivity profile across bipartitions, which correlates with $v_B$. Neither descriptor alone fully determines the dynamics; rather, entanglement growth and operator spreading are controlled by distinct structural features of the local circuit blocks. Notably, AME states appear among the fastest scrambling building blocks within the ensembles studied here.

Related papers

• Ultra-Precise Quantum Projective Designs in Constant Depth [8.23817891945353]
  We introduce an explicit sparse commuting circuit ensemble on $n$ qubits that reproduces low-order Haar moments in the stringent relative-error sense.<n>Our results show that precise Haar-like statistics can emerge from sparse commuting dynamics with remarkably low quantum resources.
  arXiv  Detail & Related papers  (2026-09-03T14:38:21Z)
• Nonlocality-induced critical-length hierarchy from non-Hermitian competition [48.9823527611878]
  In short-range systems formed by two coupled chains, competition leads to the critical-length law $N_csimln D$.<n>Here we show that long-range hoppings fundamentally reorganizes this critical behavior, producing a hierarchy of distinct scaling laws.<n>Our results offer a platform-independent framework testable in programmable topoelectrical circuits, photonic lattices and digital quantum simulators.
  arXiv  Detail & Related papers  (2026-08-03T18:00:18Z)
• 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)
• Structured-Sparse Attention for Entity Tracking with Subquadratic Sequence Complexity [45.829192030010006]
  We show that most mass concentrates in local block-diagonal neighborhoods with a light cross-block residue.<n>We derive a blockwise evaluation of a resolvent-style operator that keeps within-block interactions exact and routes cross-block interactions through a reduced system.<n>Our method matches the dense operator's accuracy while reducing wall-clock time by $12-29%$ under a standardized measurement protocol.
  arXiv  Detail & Related papers  (2026-05-21T13:35:48Z)
• Explicit Block Encodings of Discrete Laplacians with Mixed Boundary Conditions [45.88028371034407]
  Block encoding provides the standard method for accessing matrix data within quantum circuits.<n>We present a unified framework for efficiently block encoding finite-difference discretizations of the Laplacian.
  arXiv  Detail & Related papers  (2026-03-12T19:35:16Z)
• A Scalable Distributed Quantum Optimization Framework via Factor Graph Paradigm [46.08923284345648]
  We introduce a structure-aware framework for distributed quantum optimization.<n>We find that for a search space of size $N$, our framework achieves $O(sqrtN)$ query complexity up to processors and separator dependent factors.<n>We show that structure-aware decomposition delivers a practical path to scalable distributed quantum optimization on quantum networks.
  arXiv  Detail & Related papers  (2026-03-08T15:15:52Z)
• Construction and Rigorous Analysis of Quantum-Like States [0.0]
  This work adds mathematical rigor to the analysis of single Quantum-Like (QL) bits constructed by eigenvectors of the adjacency matrices of such networks.<n>We show that symmetric construction of such networks leads to an equal superposition of the $|+rangle, |-rangle$ Hadamard states.<n>We also prove two methods to construct any arbitrary single qubit state $|psirangle = a|0rangle + b|1rangle,, |a|2+|b|2=1$.
  arXiv  Detail & Related papers  (2025-07-28T19:22:32Z)
• Unveiling Induction Heads: Provable Training Dynamics and Feature Learning in Transformers [54.20763128054692]
  We study how a two-attention-layer transformer is trained to perform ICL on $n$-gram Markov chain data. We prove that the gradient flow with respect to a cross-entropy ICL loss converges to a limiting model.
  arXiv  Detail & Related papers  (2024-09-09T18:10:26Z)
• Operator space fragmentation in perturbed Floquet-Clifford circuits [0.0]
  Floquet quantum circuits are able to realise a wide range of non-equilibrium quantum states. We investigate the stability of operator localisation and emergence of chaos in random Floquet-Clifford circuits.
  arXiv  Detail & Related papers  (2024-08-02T19:18:30Z)
• Automatically Identifying Local and Global Circuits with Linear Computation Graphs [45.760716193942685]
  We introduce our circuit discovery pipeline with Sparse Autoencoders (SAEs) and a variant called Transcoders. Our methods do not require linear approximation to compute the causal effect of each node. We analyze three kinds of circuits in GPT-2 Small: bracket, induction, and Indirect Object Identification circuits.
  arXiv  Detail & Related papers  (2024-05-22T17:50:04Z)
• Understanding Heterophily for Graph Neural Networks [42.640057865981156]
  We present theoretical understandings of the impacts of different heterophily patterns for Graph Neural Networks (GNNs) We show that the separability gains are determined by the normalized distance of the $l$-powered neighborhood distributions. Experiments on both synthetic and real-world data verify the effectiveness of our theory.
  arXiv  Detail & Related papers  (2024-01-17T11:01:28Z)
• Onset of scrambling as a dynamical transition in tunable-range quantum circuits [0.0]
  We identify a dynamical transition marking the onset of scrambling in quantum circuits with different levels of long-range connectivity. We show that as a function of the interaction range for circuits of different structures, the tripartite mutual information exhibits a scaling collapse. In addition to systems with conventional power-law interactions, we identify the same phenomenon in deterministic, sparse circuits.
  arXiv  Detail & Related papers  (2023-04-19T17:37:10Z)
• From dual-unitary to quantum Bernoulli circuits: Role of the entangling power in constructing a quantum ergodic hierarchy [0.0]
  We study the apex of a putative quantum ergodic hierarchy which is Bernoulli. We derive a condition based on the entangling power $e_p(U)$ of the basic two-particle unitary building block. We construct a coupled quantum cat map which is dual-unitary for all local dimensions and a 2-unitary or perfect tensor for odd local dimensions.
  arXiv  Detail & Related papers  (2021-01-12T16:21:50Z)

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.