Quick Navigation

Topics

Quantum Machine Learning

On the construction of graph models realizing given entropy vectors

arXiv
Authors: Veronika E. Hubeny, Massimiliano Rota

Year

2025

Paper ID

36446

Status

Preprint

Abstract Read

~2 min

Abstract Words

92

Citations

N/A

Abstract

We present an efficient algorithm for the construction of a holographic simple tree graph model that realizes a given entropy vector, subject to a specific "chordality" condition first introduced in arXiv:2412.18018. We further develop the toolkit of the correlation hypergraph, particularly in relation to coarse-graining and fine-graining of subsystems. We then use these techniques to take the first steps towards the generalization of this new algorithm to arbitrary (not necessarily simple) holographic tree graph models, and the "detection" of unrealizability of an entropy vector independently from the knowledge of holographic entropy inequalities.

Why This Paper Matters

  • This paper contributes to the Quantum Machine Learning research area in the Quantum Articles archive.
  • It adds a 2025 reference point for readers tracking recent quantum research.
  • We present an efficient algorithm for the construction of a holographic simple tree graph model that realizes a given entropy vector, subject to a specific "chordality"...

Paper Tools

Become a member to use research tools

Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.

Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

Local Citation Graph (Related-Paper Links)

Current Paper #36446 #78828 Verifiable Sampling for Delegat... #78813 Large-Scale Benchmarking of Qua... #78775 On linearity or non-linearity i...

External citation index: OpenAlex citation signal

Community Reactions

Quick sentiment from readers on this paper.

Score: 0
Likes: 0 Dislikes: 0

Sign in to react to this paper.

Discussion & Reviews (Moderated)

Average Rating: 0.0 / 5 (0 ratings)

No written reviews yet.