Disentangling strategies and entanglement transitions in unitary circuit games with matchgates

• URL: http://arxiv.org/abs/2507.05055v1
• Date: Mon, 07 Jul 2025 14:38:50 GMT
• Title: Disentangling strategies and entanglement transitions in unitary circuit games with matchgates
• Authors: Raúl Morral-Yepes, Marc Langer, Adam Gammon-Smith, Barbara Kraus, Frank Pollmann,
• Abstract summary: In unitary circuit games, two competing parties, an "entangler" and a "disentangler", can induce an entanglement phase transition in a quantum many-body system.<n>We analyze such games within the context of matchgate dynamics, which equivalently corresponds to evolutions of non-interacting fermions.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In unitary circuit games, two competing parties, an "entangler" and a "disentangler", can induce an entanglement phase transition in a quantum many-body system. The transition occurs at a certain rate at which the disentangler acts. We analyze such games within the context of matchgate dynamics, which equivalently corresponds to evolutions of non-interacting fermions. We first investigate general entanglement properties of fermionic Gaussian states (FGS). We introduce a representation of FGS using a minimal matchgate circuit capable of preparing the state and derive an algorithm based on a generalized Yang-Baxter relation for updating this representation as unitary operations are applied. This representation enables us to define a natural disentangling procedure that reduces the number of gates in the circuit, thereby decreasing the entanglement contained in the system. We then explore different strategies to disentangle the systems and study the unitary circuit game in two different scenarios: with braiding gates, i.e., the intersection of Clifford gates and matchgates, and with generic matchgates. For each model, we observe qualitatively different entanglement transitions, which we characterize both numerically and analytically.

Related papers

• Generalized Linear Mode Connectivity for Transformers [87.32299363530996]
  A striking phenomenon is linear mode connectivity (LMC), where independently trained models can be connected by low- or zero-loss paths.<n>Prior work has predominantly focused on neuron re-ordering through permutations, but such approaches are limited in scope.<n>We introduce a unified framework that captures four symmetry classes: permutations, semi-permutations, transformations, and general invertible maps.<n>This generalization enables, for the first time, the discovery of low- and zero-barrier linear paths between independently trained Vision Transformers and GPT-2 models.
  arXiv  Detail & Related papers  (2025-06-28T01:46:36Z)
• Entanglement transition and suppression of critical phase of thermofield double state in monitored quantum circuit with unitary $R$ matrix gates [4.889561507168047]
  We study quantum circuits with gates composed randomly of identity operators, projectors, or a kind of $R$ matrices.<n>This enables us to translate the quantum circuit into a topological object with distinguished overcrossings and undercrossings.
  arXiv  Detail & Related papers  (2025-03-01T08:17:11Z)
• Entangling power, gate typicality, and measurement-induced phase transitions [0.0]
  We study the behavior of measurement-induced phase transition (MIPT) in hybrid quantum circuits with both unitary gates and measurements.<n>We show that the entangling power and gate typicality of the two-qubit local unitaries employed in the circuit can be used to explain the behavior of global bipartite entanglement.
  arXiv  Detail & Related papers  (2024-07-25T05:10:04Z)
• Geometric Quantum Machine Learning with Horizontal Quantum Gates [41.912613724593875]
  We propose an alternative paradigm for the symmetry-informed construction of variational quantum circuits. We achieve this by introducing horizontal quantum gates, which only transform the state with respect to the directions to those of the symmetry. For a particular subclass of horizontal gates based on symmetric spaces, we can obtain efficient circuit decompositions for our gates through the KAK theorem.
  arXiv  Detail & Related papers  (2024-06-06T18:04:39Z)
• Fermionic anyons: entanglement and quantum computation from a resource-theoretic perspective [39.58317527488534]
  We develop a framework to characterize the separability of a specific type of one-dimensional quasiparticle known as a fermionic anyon. We map this notion of fermionic-anyon separability to the free resources of matchgate circuits. We also identify how entanglement between two qubits encoded in a dual-rail manner, as standard for matchgate circuits, corresponds to the notion of entanglement between fermionic anyons.
  arXiv  Detail & Related papers  (2023-06-01T15:25:19Z)
• Entanglement Transitions in Unitary Circuit Games [0.16385815610837165]
  We consider a one-dimensional unitary circuit game in which two players get to place unitary gates on randomly assigned bonds. We find that both the classical and Clifford circuit models exhibit phase transitions as a function of the rate that the disentangler places a gate.
  arXiv  Detail & Related papers  (2023-04-25T16:19:12Z)
• Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent and Incoherent Photons Found with Gradient Search [77.34726150561087]
  We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control. We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
  arXiv  Detail & Related papers  (2023-02-28T07:36:02Z)
• Three-fold way of entanglement dynamics in monitored quantum circuits [68.8204255655161]
  We investigate the measurement-induced entanglement transition in quantum circuits built upon Dyson's three circular ensembles. We obtain insights into the interplay between the local entanglement generation by the gates and the entanglement reduction by the measurements.
  arXiv  Detail & Related papers  (2022-01-28T17:21:15Z)
• 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)
• Accurate methods for the analysis of strong-drive effects in parametric gates [94.70553167084388]
  We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach. We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
  arXiv  Detail & Related papers  (2021-07-06T02:02:54Z)
• Spacetime duality between localization transitions and measurement-induced transitions [0.0]
  Time evolution of quantum many-body systems leads to a state with maximal entanglement allowed by symmetries. Two distinct routes to impede entanglement growth are inducing localization via spatial disorder, or subjecting the system to non-unitary evolution. Here we employ the idea of space-time rotation of a circuit to explore the relation between systems that fall into these two classes.
  arXiv  Detail & Related papers  (2021-03-10T21:59:52Z)
• 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.