Skip to main content
QUICK REVIEW

[论文解读] Bridging Commutant and Polynomial Methods for Hilbert Space Fragmentation

Bo-Ting Chen, Yu-Ping Wang|arXiv (Cornell University)|Jan 1, 2026
Quantum Computing Algorithms and ArchitectureComputer Science被引用 0
一句话总结

本工作将互换代数(CA)与整数特征多项式分解(ICPF)方法用于识别希尔伯特空间分裂(HSF)联系起来,在有理运算符哈密顿量的情形下证明 ICPF ⪰ CA,并探讨两者何时会不同。

ABSTRACT

A quantum model exhibits Hilbert space fragmentation (HSF) if its Hilbert space decomposes into exponentially many dynamically disconnected subspaces, known as Krylov subspaces. A model may however have different HSFs depending on the method for identifying them. Here we establish a connection between two vastly distinct methods recently proposed for identifying HSF: the commutant algebra (CA) method and integer characteristic polynomial factorization (ICPF) method. For a Hamiltonian consisting of operators admitting rational number matrix representations, we prove a theorem that, if its center of commutant algebra have all eigenvalues being rational, the HSF from the ICPF method must be equal to or finer than that from the CA method. We show that this condition is satisfied by most known models exhibiting HSF, for which we demonstrate the validity of our theorem. We further discuss representative models for which ICPF and CA methods yield different HSFs. Our results may facilitate the exploration of a unified definition of HSF.

研究动机与目标

  • Motivate and formalize a connection between two HSF identification methods: CA and ICPF.
  • Show that, under rational operator Hamiltonians with rational center eigenvalues, ICPF yields equal or finer fragmentation than CA.
  • Identify when ICPF and CA agree or differ, and relate differences to Hamiltonian-coefficient dependence and basis structure.

提出的方法

  • Define HSF and summarize CA and ICPF identification schemes.
  • Prove a theorem: if the center of the commutant algebra has all rational eigenvalues, then ICPF ⪰ CA.
  • Show that Pλ projections are rational under the rational eigenvalue condition, enabling rational-factorization of the full characteristic polynomial.
  • Use a partial-order relation to compare ICPF and CA fragmentation across models.
  • Corroborate with numerical analysis on representative models (PF, TL, QB, FM).

实验结果

研究问题

  • RQ1How are HSFs from CA and ICPF related for Hamiltonians built from rational operators?
  • RQ2Under what conditions does ICPF yield equal or finer fragmentation than CA, and when can CA be finer?
  • RQ3Do ICPF Krylov bases depend on Hamiltonian coefficients, and how does this affect CA–ICPF agreement?
  • RQ4Can the theoretical connection be verified across representative models and what are the implications for a unified HSF definition?

主要发现

  • For Hamiltonians with rational operator components, if all center eigenvalues are rational, ICPF ⪰ CA (ICPF yields equal or finer fragmentation).
  • In many known HSF models, the center eigenvalues are rational, validating the theorem across PF, TL, QB, and t-Jz examples.
  • When ICPF ≻ CA, at least one ICPF Krylov subspace basis depends on Hamiltonian coefficients {Jη}.
  • PF, TL, and t-Jz show ICPF = CA with Hamiltonian-basis (cHSF) fragmentation, while QB shows ICPF ≻ CA with coefficient-dependent ICPF subspaces (qHSF under ICPF).
  • The FM model provides a counterexample where Basis(Z) eigenvalues are irrational, leading to ICPF ≺ CA and non-applicability of the main theorem.
  • The work suggests a route toward a unified HSF notion by relating CA and ICPF perspectives and highlights parameter dependence of Krylov subspaces.

阅读本论文

在 Nubint 阅读器中打开原文,边读边就任意段落提问。

在 Nubint 中阅读本论文

本解读由 AI 根据论文原文生成,引用前请核对原文。