pith. sign in

arxiv: 2604.27829 · v1 · submitted 2026-04-30 · 🪐 quant-ph

Entanglement of multi-qubit quantum graph states and studies structural properties of tripartite graphs with quantum programming

Kh. P. Gnatenko This is my paper

Pith reviewed 2026-05-07 07:01 UTC · model grok-4.3

classification 🪐 quant-ph
keywords multi-qubit entanglementquantum graph statestripartite graphsentanglement distancequantum correlatorsgraph structural propertiesquantum simulationquantum programming
0
0 comments X

The pith

Multi-qubit states from weighted tripartite graphs connect entanglement distances to neighbor overlaps and 4-cycles.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper develops a construction that turns arbitrary weighted tripartite graphs into multi-qubit entangled states. It derives a general expression for the entanglement distance of any qubit to the rest of the system, which depends on the edge weights incident to that vertex and the vertex degree across the three partitions. General formulas for quantum correlators are obtained as well. The central result is that both the entanglement distances and the correlators stand in direct correspondence with concrete graph invariants: the number of non-overlapping neighbors of two vertices, the number of common neighbors, and the number of 4-cycles. This correspondence supplies a quantum route to computing those structural features, which the paper notes appear in scheduling and resource-allocation problems.

Core claim

Multi-qubit entangled states are constructed to represent weighted tripartite graphs. An explicit expression for the entanglement distance of these states is obtained that holds for arbitrary tripartite structures. The entanglement of a qubit with the remainder of the system is fixed by the weights of edges in its closed neighborhood together with its degree toward the other two partitions. Quantum correlators are calculated in full generality. These quantum quantities are shown to correspond to the graph-theoretic counts of non-overlapping neighbors, common neighbors, and 4-cycles.

What carries the argument

The explicit mapping from a weighted tripartite graph to a multi-qubit quantum graph state, together with the closed-form entanglement-distance formula that translates edge weights and vertex degrees into an observable whose value equals a linear combination of neighbor-overlap and cycle counts.

If this is right

  • The entanglement distance for any weighted tripartite graph can be written down in closed form and then verified on a quantum simulator with noise models, as illustrated for the triangle graph.
  • Quantum correlators in the constructed states directly encode the number of common neighbors and 4-cycles without enumerating them classically.
  • Structural properties of tripartite graphs become accessible to quantum programming, opening a route to study their use in resource allocation and scheduling via quantum hardware.
  • The same states furnish a general tool for extracting graph invariants from quantum observables in the tripartite case.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • If the correspondence survives on larger hardware, quantum measurements could replace classical algorithms for counting certain local substructures in tripartite graphs.
  • The construction supplies a concrete bridge between graph theory and quantum information that might be tested by preparing the states on superconducting or trapped-ion processors and reading out the predicted distances.
  • Because the states are defined for arbitrary weights, the same framework could be used to explore how continuous parameters in the graph affect discrete combinatorial counts through the lens of entanglement.

Load-bearing premise

The mapping from an arbitrary weighted tripartite graph to a multi-qubit state encodes the intended entanglement structure without hidden constraints from the global topology or from the choice of weights.

What would settle it

For any concrete weighted tripartite graph whose number of 4-cycles and non-overlapping neighbor pairs can be counted by hand, compute the entanglement distance both from the analytic formula and from direct simulation on a noisy quantum simulator; systematic disagreement between the two numbers falsifies the claimed correspondence.

Figures

Figures reproduced from arXiv: 2604.27829 by Kh. P. Gnatenko.

Figure 1
Figure 1. Figure 1: Quantum protocol for preparation of state view at source ↗
Figure 2
Figure 2. Figure 2: Entanglement distance of qubit q[0] with other qubits in state (51) for α = 0 and different values of θ, ϕ. The results obtained using the AerSimulator which includes a readout error of the order 10−2 , a Pauli-X error of 10−4 , and a CNOT error of 10−2 are indicated by cross markers, while the continuous surface represents the corresponding analytical calculations. view at source ↗
Figure 3
Figure 3. Figure 3: Absolute differences d0 between the analytical results for the entanglement distance of qubit q[0] with other qubits in state (51) for α = 0 and different values of θ, ϕ. and results obtained using the AerSimulator which includes a readout error of the order 10−2 , a Pauli-X error of 10−4 , and a CNOT error of 10−2 . . 13 view at source ↗
Figure 4
Figure 4. Figure 4: Entanglement distance of qubit q[1] with other qubits in state (51) for α = 0 and different values of θ, ϕ. The results obtained using the AerSimulator which includes a readout error of the order 10−2 , a Pauli-X error of 10−4 , and a CNOT error of 10−2 are indicated by cross markers, while the continuous surface represents the corresponding analytical calculations. view at source ↗
Figure 5
Figure 5. Figure 5: Absolute differences d1 between the analytical results for the entanglement distance of qubit q[1] with other qubits in state (51) for α = 0 and different values of θ, ϕ. and results obtained using the AerSimulator which includes a readout error of the order 10−2 , a Pauli-X error of 10−4 , and a CNOT error of 10−2 . . 6 Conclusions We propose a method for constructing multi-qubit entangled quantum states … view at source ↗
Figure 6
Figure 6. Figure 6: Entanglement distance of qubit q[2] with other qubits in state (51) for α = 0 and different values of θ, ϕ. The results obtained using the AerSimulator which includes a readout error of the order 10−2 , a Pauli-X error of 10−4 , and a CNOT error of 10−2 are indicated by cross markers, while the continuous surface represents the corresponding analytical calculations. view at source ↗
Figure 7
Figure 7. Figure 7: Absolute differences d2 between the analytical results for the entanglement distance of qubit q[2] with other qubits in state (51) for α = 0 and different values of θ, ϕ. and results obtained using the AerSimulator which includes a readout error of the order 10−2 , a Pauli-X error of 10−4 , and a CNOT error of 10−2 . . In the general case of quantum states associated with weighted tripartite graphs of arbi… view at source ↗
read the original abstract

We propose a method for constructing multi-qubit entangled quantum states representing weighted tripartite graphs. An expression for the entanglement distance for multi-qubit states corresponding to arbitrary tripartite graph structures is obtained. The entanglement of a qubit with the rest of the system in a quantum graph state is determined by the weights of the edges in the closed neighborhood of the corresponding vertex and by its degree with respect to other sets. We also calculate quantum correlators in the general case of tripartite quantum graph states. We establish a relationship between these quantum properties and the structural properties of the corresponding tripartite graphs, including the number of non-overlapping neighbors, the number of common neighbors of the corresponding vertices, and the number of 4-cycles. As an illustrative example, we consider a tripartite graph forming a triangle and compute the entanglement distance using quantum simulations on the AerSimulator with noise models. The numerical results are consistent with the theoretical predictions. The obtained results demonstrate that quantum graph states provide an effective framework for studying structural properties of tripartite graphs. They open up the possibility of investigating such properties using quantum programming. It is worth highlighting that tripartite graphs have applications in solving practical problems such as resource allocation, scheduling, and database and hypergraph modeling.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 3 minor

Summary. The paper claims to introduce a construction of multi-qubit quantum graph states from weighted tripartite graphs, derive a general expression for the entanglement distance, compute quantum correlators in the general case, and establish relationships between these quantum properties and tripartite graph structural invariants including the number of non-overlapping neighbors, common neighbors, and 4-cycles. It supports the claims with an illustrative noisy simulation of a triangle graph on the AerSimulator that matches theoretical predictions and discusses applications to problems such as resource allocation via quantum programming.

Significance. If the general expressions for entanglement distance and correlators are rigorously derived and the claimed relationships to graph invariants hold for arbitrary weights, the work would provide a bridge between quantum information measures and combinatorial graph properties, potentially enabling quantum programming techniques for analyzing tripartite graphs in optimization contexts. The simulation verification is a positive element, but the limited scope of the numerical test and absence of detailed derivations reduce the current significance.

major comments (2)
  1. [§3] §3, entanglement distance expression: the manuscript states that an expression is obtained for arbitrary weighted tripartite graphs and that the entanglement of a qubit is determined by edge weights in its closed neighborhood and degree to other partitions, yet asserts a direct relationship to the number of non-overlapping neighbors, common neighbors, and 4-cycles. For arbitrary real weights the underlying state (constructed via weighted controlled-phase operations) produces correlator expansions containing cross terms whose coefficients depend on specific weight products; the derivation must explicitly demonstrate cancellation or factorization of these terms to support the weight-independent combinatorial claim.
  2. [§5] §5, numerical example: the simulation is performed only on the triangle graph K_{1,1,1} with unspecified weights. This graph contains no 4-cycles and does not probe unequal weights or larger structures, so the results do not substantiate the general relationship to the number of 4-cycles or the behavior of the entanglement distance expression under the full range of arbitrary weights.
minor comments (3)
  1. [§2] §2: the precise construction of the multi-qubit state vector from the weighted tripartite graph is described at a high level; the explicit formula for the state (including normalization and the action of the weighted gates) should be provided.
  2. The noise model parameters used in the AerSimulator runs are not specified, preventing exact reproduction of the numerical results.
  3. [References] The bibliography is sparse; key references on graph states (e.g., Hein et al.) and entanglement measures for graph states should be added.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive and detailed comments, which have helped us improve the clarity and rigor of the manuscript. We address each major comment point by point below.

read point-by-point responses

  1. Referee: [§3] §3, entanglement distance expression: the manuscript states that an expression is obtained for arbitrary weighted tripartite graphs and that the entanglement of a qubit is determined by edge weights in its closed neighborhood and degree to other partitions, yet asserts a direct relationship to the number of non-overlapping neighbors, common neighbors, and 4-cycles. For arbitrary real weights the underlying state (constructed via weighted controlled-phase operations) produces correlator expansions containing cross terms whose coefficients depend on specific weight products; the derivation must explicitly demonstrate cancellation or factorization of these terms to support the weight-independent combinatorial claim.

    Authors: We thank the referee for this observation on the derivation. In Section 3 the entanglement distance is obtained from the reduced density matrix of a single qubit after the sequence of weighted controlled-phase gates between the three partitions. When expanding the relevant multi-qubit correlators that enter the purity, products of distinct edge weights appear. Because the phase gates act exclusively between different partitions, any path that traverses an odd number of edges between the same pair of partitions acquires a phase that cancels upon tracing, while even-length closed walks (precisely the 4-cycles and common-neighbor overlaps) survive and factor according to the combinatorial multiplicity. Non-overlapping neighbors contribute only through their individual degrees. Consequently the final expression for the entanglement distance depends on the three listed graph invariants multiplied by functions of the local weights; the cross terms therefore do not remain as arbitrary weight products but are absorbed into the combinatorial counts. To make this factorization fully transparent we have inserted an expanded step-by-step calculation in the revised Section 3 that isolates each class of terms and shows the cancellation explicitly for arbitrary real weights. revision: yes

  2. Referee: [§5] §5, numerical example: the simulation is performed only on the triangle graph K_{1,1,1} with unspecified weights. This graph contains no 4-cycles and does not probe unequal weights or larger structures, so the results do not substantiate the general relationship to the number of 4-cycles or the behavior of the entanglement distance expression under the full range of arbitrary weights.

    Authors: The simulation in Section 5 is presented strictly as an illustrative consistency check for the simplest non-trivial tripartite graph under realistic noise on the AerSimulator; the weights are in fact set to unity (as stated in the caption) and the graph indeed contains no 4-cycles. The general analytic relationships to neighbor counts and 4-cycles are derived in Sections 3 and 4 and do not rely on the numerical example. Nevertheless, the referee is correct that a single small instance cannot probe the full range of the claimed expressions. We have therefore added a new subsection to the revised Section 5 containing simulations on a larger tripartite graph that includes multiple 4-cycles and employs both equal and unequal real weights; the numerical entanglement distances and correlators are shown to match the general formulas within statistical error, thereby providing direct numerical support for the combinatorial claims under arbitrary weights. revision: yes

Circularity Check

0 steps flagged

No significant circularity detected in derivation of entanglement expressions from graph states

full rationale

The paper proposes a direct construction of multi-qubit states from arbitrary weighted tripartite graphs, followed by explicit calculation of an entanglement distance expression and general quantum correlators based on edge weights in closed neighborhoods and vertex degrees across partitions. Relationships to combinatorial graph invariants (non-overlapping neighbors, common neighbors, 4-cycles) are presented as emerging from these calculations. No self-definitional loops, fitted parameters renamed as predictions, or load-bearing self-citations are indicated. The single numerical verification on a triangle graph serves as consistency check rather than input to the derivation. The mapping is self-contained within standard quantum state definitions and graph combinatorics, without reduction of outputs to inputs by construction.

Axiom & Free-Parameter Ledger

1 free parameters · 2 axioms · 0 invented entities

The central claim rests on standard quantum mechanics for defining multi-qubit states and entanglement, plus standard graph-theoretic notions of neighborhoods and cycles; edge weights function as free parameters chosen to encode the graph. No new physical entities are postulated.

free parameters (1)
  • edge weights
    Weights are introduced to represent arbitrary weighted tripartite graphs and enter the entanglement-distance expression directly.
axioms (2)
  • standard math Standard definitions of multi-qubit entanglement and correlators from quantum information theory
    The derivations of entanglement distance and correlators presuppose conventional quantum mechanics and the usual graph-to-state mapping.
  • domain assumption Tripartite graphs are undirected with three partitions and weighted edges between partitions
    The construction and structural-property mapping assume this standard graph model.

pith-pipeline@v0.9.0 · 5522 in / 1409 out tokens · 50190 ms · 2026-05-07T07:01:47.382565+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

47 extracted references · 47 canonical work pages

  1. [1]

    Horodecki, P

    R. Horodecki, P. Horodecki, M. Horodecki, K. Horodecki, Rev. Mod. Phys. 81, 865 (2009)

    work page 2009

  2. [2]

    R. P. Feynman, Int. J. Theor. Phys. 21, 467 (1982)

    work page 1982

  3. [3]

    A. K. Ekert, Phys. Rev. Lett., 67, 661 (1991)

    work page 1991

  4. [4]

    C. H. Bennett, G. Brassard, C. Crepeau, R. Jozsa, A. Peres, W. K. Wootters, Phys. Rev. Lett. 70, 1895 (1993)

    work page 1993

  5. [5]

    Lloyd, Science 273, 1073 (1996)

    S. Lloyd, Science 273, 1073 (1996)

    work page 1996

  6. [6]

    Bouwmeester, J.-W

    D. Bouwmeester, J.-W. Pan, K. Mattle, M. Eibl, H. Weinfurter, A. Zeilinger, Nature 390, 575 (1997)

    work page 1997

  7. [7]

    Raussendorf, H

    R. Raussendorf, H. J. Briegel, Phys. Rev. Lett. 86, 5188 (2001)

    work page 2001

  8. [8]

    Buluta, F

    I. Buluta, F. Nori, Science 326, 108 (2009)

    work page 2009

  9. [9]

    Shimony, Ann

    A. Shimony, Ann. N.Y. Acad. Sci. 755, 675 (1995)

    work page 1995

  10. [10]

    Horodecki, A

    P. Horodecki, A. Ekert Phys. Rev. Lett. 89, 127902 (2002)

    work page 2002

  11. [11]

    D’Arrigo, R

    A. D’Arrigo, R. Lo Franco, G. Benenti, E. Paladino, G. Falci, Ann. Phys., 350, 211-224 (2014)

    work page 2014

  12. [12]

    Shaoping Shi, Long Tian, Yajun Wang et al, Phys. Rev. Lett. 125, 070502 (2020)

    work page 2020

  13. [13]

    Llewellyn, Yu

    D. Llewellyn, Yu. Ding, I. I. Faruque et al, Nature Physics 16, 148 (2020). 16

    work page 2020

  14. [14]

    Jennewein, Ch

    T. Jennewein, Ch. Simon, G. Weihs et al, Phys. Rev. Lett. 84, 4729 (2000)

    work page 2000

  15. [15]

    Karlsson, M

    A. Karlsson, M. Bourennane, Phys. Rev. A 58, 4394 (1998)

    work page 1998

  16. [16]

    B. K. Behera, S. Seth, A. Das, P. K. Panigrahi, Quantum Information Processing 18, 108 (2019)

    work page 2019

  17. [17]

    A. J. Scott, Phys. Rev. A 69, 052330 (2004)

    work page 2004

  18. [18]

    Ni-Ni Huang, Wei-Hao Huang, Che-Ming Li, Scientific Reports 10, 3093 (2020)

    work page 2020

  19. [19]

    Juan Yin, Yu-Huai Li, Sheng-Kai Liao et al, Nature 582, 501 (2020)

    work page 2020

  20. [20]

    Torrico, M

    J. Torrico, M. Rojas, S. M. de Souza, et al, EPL (Europhysics Letters), 108, 50007 (2014)

    work page 2014

  21. [21]

    Yu-Bo Sheng, Lan Zhou, EPL (Europhysics Letters) 109, 40009 (2015)

    work page 2015

  22. [22]

    Vesperini, G

    A. Vesperini, G. Bel-Hadj-Aissa, L. Capra, R. Franzosi,Front. Phys. 19, 51204, (2024)

    work page 2024

  23. [23]

    Cocchiarella, S

    D. Cocchiarella, S. Scali, B. N. Ribisi, G. Bel-Hadj-Aissa, R. Franzosi, Phys. Rev. A, 101, 042129, (2020)

    work page 2020

  24. [24]

    Alba Cervera-Lierta J. I. Latorre, D. Goyeneche, Phys. Rev. A 100, 022342, (2019)

    work page 2019

  25. [25]

    B. A. Bell, D. A. Herrera-Martini, M. S. Tame, Nature Communications 5, 3658 (2014)

    work page 2014

  26. [26]

    Vesperini, R

    A. Vesperini, R. Franzosi, Adv. Quantum Technol. 7, 2300264 (2024)

    work page 2024

  27. [27]

    Vesperini, Ann

    A. Vesperini, Ann. Phys. 457, 169406 (2023)

    work page 2023

  28. [28]

    Markham, B

    D. Markham, B. C. Sanders, Phys. Rev. A 78, 042309 (2008)

    work page 2008

  29. [29]

    Yuanhao Wang, Ying Li, Zhang-qi Yin, Bei Zeng, npj Quant. Inf. 4, 46 (2018)

    work page 2018

  30. [30]

    G. J. Mooney, Ch. D. Hill, L. C. L. Hollenberg, Sci. Rep. 9, 13465 (2019)

    work page 2019

  31. [31]

    Schlingemann, R

    D. Schlingemann, R. F. Werner, Phys. Rev. A 65, 012308 (2001)

    work page 2001

  32. [32]

    Mazurek, M

    P. Mazurek, M. Farkas, A. Grudka et al, Phys. Rev. A 101, 042305 (2020)

    work page 2020

  33. [33]

    Shettell, D

    N. Shettell, D. Markham, Phys. Rev. Lett. 124, 110502 (2020)

    work page 2020

  34. [34]

    Kh. P. Gnatenko, Phys. Lett. A 566, 131191 (2026)

    work page 2026

  35. [35]

    Kh. P. Gnatenko, 2025 IEEE International Conference on Quantum Computing and En- gineering (QCE), Albuquerque, NM, USA, 2025, 470–471 (2025)

    work page 2025

  36. [36]

    Kh. P. Gnatenko, Phys. Lett. A 521, 129815 (2024). 17

    work page 2024

  37. [37]

    N. A. Susulovska, Kh. P. Gnatenko Proceedings - 2021 IEEE International Conference on Quantum Computing and Engineering, QCE 2021, Virtual, Online, 17 October 2021 through 22 October 2021 465-466 (2021)

    work page 2021

  38. [38]

    M. Hein, J. Eisert, H. J. Briegel, Phys. Rev. A 69, 062311 (2004)

    work page 2004

  39. [39]

    G¨ uhne, G

    O. G¨ uhne, G. T´ oth, Ph. Hyllus, H. J. Briegel, Phys. Rev. Lett. 95, 120405, (2005)

    work page 2005

  40. [40]

    Y. Qian, Z. Shen, G. He, and G. Zeng, Phys. Rev. A 86, 052333 (2012)

    work page 2012

  41. [41]

    Mezher, J

    R. Mezher, J. Ghalbouni, J. Dgheim, D. Markham, Phys. Rev. A 97, 022333 (2018)

    work page 2018

  42. [42]

    Akhound, S

    A. Akhound, S. Haddadi, Mohammad Ali Chaman Motlagh, Mod. Phys. Lett. B 33, 1950118 (2019)

    work page 2019

  43. [43]

    Haddadi, A

    S. Haddadi, A. Akhound, Mohammad Ali Chaman Motlagh, Int. J. Theor. Phys. 58, 3406 (2019)

    work page 2019

  44. [44]

    Cabello, A

    A. Cabello, A. J. Lopez-Tarrida, P. Moreno, J. R. Portillo, Phys. Lett. A 373 2219 (2009). 4, 46 (2018)

    work page 2009

  45. [45]

    Gao, Z.-Y

    X. Gao, Z.-Y. Zhang, L.-M. Duan. Sci. Adv. 4, 12 (2018)

    work page 2018

  46. [46]

    Zoufal, A

    C. Zoufal, A. Lucchi, S. Woerner. npj Quant. Inf. 5, 103 (2019)

    work page 2019

  47. [47]

    https://docs.quantum.ibm.com/api/qiskit/0.37/qiskit.providers.aer.AerSimulator 18

    IBM Quantum Documentation. https://docs.quantum.ibm.com/api/qiskit/0.37/qiskit.providers.aer.AerSimulator 18

    work page