Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > quant-ph > arXiv:2309.04776

Help | Advanced Search

Quantum Physics

arXiv:2309.04776 (quant-ph)
[Submitted on 9 Sep 2023 ]

Title: Correlations in Disordered Solvable Tensor Network States

Title: 无序可解张量网络态中的关联性

Authors:Daniel Haag, Richard M. Milbradt, Christian B. Mendl
Abstract: Solvable matrix product and projected entangled pair states evolved by dual and ternary-unitary quantum circuits have analytically accessible correlation functions. Here, we investigate the influence of disorder. Specifically, we compute the average behavior of a physically motivated two-point equal-time correlation function with respect to random disordered solvable tensor network states arising from the Haar measure on the unitary group. By employing the Weingarten calculus, we provide an exact analytical expression for the average of the $k$th moment of the correlation function. The complexity of the expression scales with $k!$ and is independent of the complexity of the underlying tensor network state. Our result implies that the correlation function vanishes on average, while its covariance is nonzero.
Abstract: 可解矩阵乘积和由双元和三元酉量子电路演化的投影纠缠对态具有解析可访问的相关函数。 在这里,我们研究无序的影响。 具体来说,我们计算一个物理上有意义的两点等时相关函数在来自酉群上哈尔测度的随机无序可解张量网络态下的平均行为。 通过使用 韦因加滕微积分,我们提供了相关函数的$k$阶矩的平均值的精确解析表达式。 该表达式的复杂度与$k!$相关,并且与底层张量网络态的复杂度无关。 我们的结果表明,相关函数在平均意义上消失,而其协方差不为零。
Comments: 28 pages, 2 figures, comments welcome
Subjects: Quantum Physics (quant-ph) ; Statistical Mechanics (cond-mat.stat-mech)
Cite as: arXiv:2309.04776 [quant-ph]
  (or arXiv:2309.04776v1 [quant-ph] for this version)
  https://doi.org/10.48550/arXiv.2309.04776
arXiv-issued DOI via DataCite

Submission history

From: Daniel Haag [view email]
[v1] Sat, 9 Sep 2023 12:31:22 UTC (710 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
quant-ph
< prev   |   next >
new | recent | 2023-09
Change to browse by:
cond-mat
cond-mat.stat-mech

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号