Efficient computation of average subsystem Bures distance in transverse field Ising chain

• URL: http://arxiv.org/abs/2508.09417v1
• Date: Wed, 13 Aug 2025 01:29:56 GMT
• Title: Efficient computation of average subsystem Bures distance in transverse field Ising chain
• Authors: Zhouhao Guo, M. A. Rajabpour, Jiaju Zhang,
• Abstract summary: In this paper, we calculate the average subsystem Bures distance in the spin-1/2 transverse-field Ising chain.<n>We develop an efficient algorithm to evaluate the Bures distance between two Gaussian states.<n>We demonstrate that the distinct scaling behaviors of the average subsystem trace and Bures distances in chaotic versus integrable systems stem from discontinuities of local conserved charges.
• Score: 0.06554326244334867
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The average subsystem trace distance has been proposed as an indicator of quantum many-body chaos and integrability. In integrable systems, evaluating the trace distance faces two challenges: the computational cost for large systems and ambiguities in defining and ordering eigenstates. In this paper, we calculate the average subsystem Bures distance in the spin-1/2 transverse-field Ising chain. We develop an efficient algorithm to evaluate the Bures distance between two Gaussian states, which allows us to access larger system sizes. To address the degeneracy issue, we consider simultaneous eigenstates of all local conserved charges and use these charges to systematically order degenerate states. The results align with the conjectured linear increase with subsystem size. We demonstrate that the distinct scaling behaviors of the average subsystem trace and Bures distances in chaotic versus integrable systems stem from discontinuities of local conserved charges across the spectrum in integrable systems. Additionally, we investigate the average subsystem distances between random pure Gaussian states but do not observe a linear increase.

Related papers

• Calculating trace distances of bosonic states in Krylov subspace [0.0]
  We show how to compute the trace distance between a pure and a mixed Gaussian state based on a generalized Lanczos algorithm.<n>We also show how it can yield lower bounds on the trace distance between mixed Gaussian states, offering a practical tool for state certification and learning in continuous-variable quantum systems.
  arXiv  Detail & Related papers  (2026-03-05T18:59:06Z)
• Dissipative State Engineering of Complex Entanglement with Markovian Dynamics [0.0]
  We investigate the dissipative generation of a complex entanglement structure as in a cluster state through engineered Markovian dynamics in the spin systems.<n>We find that the cluster state emerges as the steady state when the engineered Liouvillian dissipation dominates over the local Ising interaction between spins.
  arXiv  Detail & Related papers  (2026-01-14T16:14:14Z)
• Kernel Representation and Similarity Measure for Incomplete Data [55.62595187178638]
  Measuring similarity between incomplete data is a fundamental challenge in web mining, recommendation systems, and user behavior analysis.<n>Traditional approaches either discard incomplete data or perform imputation as a preprocessing step, leading to information loss and biased similarity estimates.<n>This paper presents a new similarity measure that directly computes similarity between incomplete data in kernel feature space without explicit imputation in the original space.
  arXiv  Detail & Related papers  (2025-10-15T09:41:23Z)
• Quantum complexity and generalized area law in fully connected models [0.276240219662896]
  The area law for entanglement entropy reflects the complexity of quantum many-body systems.<n>In this work, we establish a generalized area law up to a polylogarithmic factor in system size.
  arXiv  Detail & Related papers  (2024-11-04T14:57:52Z)
• Inferring Kernel $ε$-Machines: Discovering Structure in Complex Systems [49.1574468325115]
  We introduce causal diffusion components that encode the kernel causal-state estimates as a set of coordinates in a reduced dimension space. We show how each component extracts predictive features from data and demonstrate their application on four examples.
  arXiv  Detail & Related papers  (2024-10-01T21:14:06Z)
• Optimization of Time-Dependent Decoherence Rates and Coherent Control for a Qutrit System [77.34726150561087]
  Incoherent control makes the decoherence rates depending on time in a specific controlled manner. We consider the problem of maximizing the Hilbert-Schmidt overlap between the system's final state $rho(T)$ and a given target state $rho_rm target.
  arXiv  Detail & Related papers  (2023-08-08T01:28:50Z)
• GRAPE optimization for open quantum systems with time-dependent decoherence rates driven by coherent and incoherent controls [77.34726150561087]
  The GRadient Ascent Pulse Engineering (GRAPE) method is widely used for optimization in quantum control. We adopt GRAPE method for optimizing objective functionals for open quantum systems driven by both coherent and incoherent controls. The efficiency of the algorithm is demonstrated through numerical simulations for the state-to-state transition problem.
  arXiv  Detail & Related papers  (2023-07-17T13:37:18Z)
• Dealing with Collinearity in Large-Scale Linear System Identification Using Gaussian Regression [3.04585143845864]
  We consider estimation of networks consisting of several interconnected dynamic systems. We develop a strategy cast in a Bayesian regularization framework where any impulse response is seen as realization of a zero-mean Gaussian process. We design a novel Markov chain Monte Carlo scheme able to reconstruct the impulse responses posterior by efficiently dealing with collinearity.
  arXiv  Detail & Related papers  (2023-02-21T19:35:47Z)
• Signatures of the interplay between chaos and local criticality on the dynamics of scrambling in many-body systems [0.0]
  We study the interplay between local criticality and chaos right at the intricate phase space region where the integrability-chaos transition first appears. Our aim is to investigate the dependence of the exponential growth of the OTOCs, defining the quantum Lyapunov exponent $lambda_textrmq$ on quantities derived from the classical system.
  arXiv  Detail & Related papers  (2022-11-22T10:26:17Z)
• Trace distance between fermionic Gaussian states from a truncation method [0.087024326813104]
  We propose a novel truncation method for determining the trace distance between two Gaussian states in fermionic systems. Our method exhibits notable efficacy in two distinct scenarios. We successfully compute the subsystem trace distances between low lying eigenstates of Ising and XX spin chains, even for significantly large subsystem sizes.
  arXiv  Detail & Related papers  (2022-10-21T10:38:12Z)
• On optimization of coherent and incoherent controls for two-level quantum systems [77.34726150561087]
  This article considers some control problems for closed and open two-level quantum systems. The closed system's dynamics is governed by the Schr"odinger equation with coherent control. The open system's dynamics is governed by the Gorini-Kossakowski-Sudarshan-Lindblad master equation.
  arXiv  Detail & Related papers  (2022-05-05T09:08:03Z)
• Direct Measure Matching for Crowd Counting [59.66286603624411]
  We propose a new measure-based counting approach to regress the predicted density maps to the scattered point-annotated ground truth directly. In this paper, we derive a semi-balanced form of Sinkhorn divergence, based on which a Sinkhorn counting loss is designed for measure matching.
  arXiv  Detail & Related papers  (2021-07-04T06:37:33Z)
• Numerical estimation of reachable and controllability sets for a two-level open quantum system driven by coherent and incoherent controls [77.34726150561087]
  The article considers a two-level open quantum system governed by the Gorini--Kossakowski--Lindblad--Sudarshan master equation. The system is analyzed using Bloch parametrization of the system's density matrix.
  arXiv  Detail & Related papers  (2021-06-18T14:23:29Z)

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.