Calibrated hypergraph states: II calibrated hypergraph state construction and applications

Roberto Zucchini

REVIEW 2 major objections 4 minor 64 references

Calibrated hypergraph states: II calibrated hypergraph state construction and applications

T0 review · 2 major / 4 minor · reviewed 2026-08-09 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Calibrated hypergraph states: every calibration over a Galois ring defines a locally maximally entangleable stabilizer state, with weighted hypergraph states recovered as a special case.

desk verdict The calibration construction is a genuine extension and the higher-qudit examples are solid, but Theorem 1.4.1's covariance proof rests on the companion paper and cannot be checked from this posting alone. read the letter →

arxiv 2501.18968 v1 pith:PFH52ZFA submitted 2025-01-31 quant-ph math-phmath.MP

Roberto Zucchini This is my paper · ORCID

classification quant-phmath-phmath.MP MSC 05C6581P9981Q99

keywords calibratedhypergraphstatesGaloisringsquditstabilizerlocallymaximallyentangleablecyclicitymonoidweightedgradedmonadscontrolled-Zgates

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper constructs a broad generalization of weighted hypergraph states: a hypergraph whose hyperedges carry calibrations, i.e. functions assigning weights to exponent functions on the edge's vertices, encodes a multipartite qudit state. The construction works whenever the qudit labels form a Galois ring, and it is engineered to be covariant under vertex relabelings and compatible with disjoint union and tensor product, making the state map a morphism of the monadic structures developed in the companion paper. The main theorems assert that every calibrated hypergraph state is a stabilizer state and is locally maximally entangleable, and that weighted hypergraph states are included as a special case. In the qubit case the construction collapses to ordinary weighted hypergraph states, while for higher qudits it produces genuinely new examples, including qutrit states used in teleportation protocols. If correct, the paper gives a uniform, construction-first framework for hypergraph states whose form is dictated by covariance rather than by ad hoc phase choices.

What carries the argument

The load-bearing object is the phase function (1.4.6) together with the cyclicity monoid exponentiation rule (2.2.7). For a Galois ring R, the cyclicity monoid Z = ⊕_{x∈R} Z_x packages the cyclic submonoids of R into one exponent monoid, and the rule x^u = $x^{{u_x}}$ computes the power of x using only the u_x component of the exponent tuple. This unusual convention is what makes every exponent function produce a well-defined monomial in the Galois variables, and the phase function then takes values in the prime subring P through the trace map tr: R → P. The Fourier transform F_l turns the diagonal phase into an operator on the Hadamard basis, and the covariance identity HE_f |(H,ρ)⟩ = |GC_f(H,ρ)⟩ is the structural constraint that forces the calibration data to take exactly this form; together with the disjoint-union and tensor-product compatibility, it makes the state map a morphism of graded Ω monads.

What would settle it

Directly verify the covariance identity HE_f |(H,ρ)⟩ = |GC_f(H,ρ)⟩ for a non-injective relabeling f that identifies two vertices of a hyperedge, using the trace pairing (2.3.1) and the exponent rule (2.2.7) over a Galois ring that is not a field, such as Z_4; a single mismatch between σ_{(GC_f(H,ρ))}(y) and σ_{(H,ρ)}(E_f^t y) would refute Theorem 1.4.1. A second check is to compute the commutators of the operators K(a) = D X(a) D^† for the qutrit states of Example 3.1.2 and confirm that they stabilize the stated state, as Proposition 3.2.4 asserts they commute.

Watch

Extended reading notes

Core claim

The central claim is that the calibrated hypergraph state map defined by expressions (1.4.4)-(1.4.6) satisfies covariance and monadic composition, and that the resulting states are locally maximally entangleable stabilizer states. Concretely, a calibrated hypergraph (H, ρ) over a Galois ring R produces the state |(H, ρ)⟩ = D_{(H,ρ)}|0_l⟩, where D_{(H,ρ)} is a Fourier-conjugated diagonal phase operator with phase function σ_{(H,ρ)}(x) = Σ_{X∈H} Σ_{w∈Z^X} ρ_X(w) tr(∏_{r∈X} $x_r^{{w(r)}}$), using the cyclicity-monoid exponent rule x^u = $x^{{u_x}}$. The paper proves covariance (HE_f |(H,ρ)⟩ = |GC_f(H,ρ)⟩), compatibility with disjoint union and tensor product, the stabilizer property with explicit operators K_{(H,ρ)}(a) = D_{(H,ρ)} X_l(a) D_{(H,ρ)}^†, and local maximal entangleability via the orthonormal basis |(H,ρ), a⟩ = D_{(H,ρ)}|a⟩. It further proves that weighted hypergraph states are contained in the calibrated class, that for qubits calibrated states reduce to weighted states up to sign, and that for higher qudits the class is strictly larger, as shown by the qutrit examples and by marked hypergraph states built from controlled-Z gates.

Load-bearing premise

The construction depends on the generalized exponent rule x^u = $x^{{u_x}}$ of Section 2.2, where the power of a ring element x is computed using only the u_x component of the exponent tuple; if this exponentiation fails to satisfy the identities $x^{{u+v}}$ = x^u x^v and $x^{0}$ = 1 within the cyclicity monoid, the phase function (1.4.6) would not be covariant under vertex relabelings and the state map would not be a monad morphism.

Editorial extensions

If this is right

Weighted hypergraph states are recovered as a special case, so existing applications in error correction, measurement-based computation, and nonlocality carry over to the larger calibrated class.
For qubits no new states appear: every calibrated hypergraph state equals a weighted hypergraph state up to a sign, leaving the known qubit classification unchanged.
For qudits over F_p with p > 2, marked hypergraph states built from controlled-Z gates are calibrated but generally not weighted, giving explicit new examples with polynomial phase functions of degree up to p − 1.
The effective/primitive/congruence simplification of Section 3.4 reduces the classification problem: every state has an effective representative, and every effective state is equivalent up to relabeling to a primitive core, so classification can be restricted to primitively effective states up to congruence.
The monad-morphism property means calibrated hypergraph states organize into a graded Ω monad CE_Ω, providing a compositional calculus for building multipartite states by disjoint union and tensor product.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The paper leaves entanglement classification open; the existence of non-weighted qutrit examples suggests that new local-unitary or stochastic-LOCC equivalence classes may appear, which could be tested by comparing the qutrit states of Example 3.1.2 with weighted ones under local Clifford operations.
Covariance and monadic composition can be read as a design principle: any phase function that respects vertex relabelings and disjoint union must be a sum of calibration-weighted trace monomials. This suggests a converse theorem, not stated in the paper, that these properties uniquely characterize the calibrated form.
For non-field Galois rings, the polynomial representation of powers fails, so the phase function is not a genuine polynomial; it would be informative to ask whether such states still admit a gate decomposition beyond controlled-Z gates, since the paper does not address that question.
The cyclicity-monoid exponent rule, which makes the exponent u_x depend on the base element x, is an algebraic device that could be reused in other settings where monomial functions on finite rings are needed, independently of hypergraph states.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Two things to know. The core idea is real: calibrations—maps from exponent functions on a hyperedge to the prime subring—genuinely extend the weightings of earlier qudit hypergraph state constructions, and Section 4.1 gives explicit higher-qudit states that are calibrated but not weighted. The second: the central covariance theorem, Theorem 1.4.1, cannot be checked from this posting alone. The proof leans on push-forward identities and definitions from the companion paper I, which is not included.

Credit where earned. The construction is concrete: a phase function built from the cyclicity monoid of a Galois ring and the trace pairing, producing a state via a Fourier-diagonal operator. The stabilizer analysis (Sec. 3.2) and LME proof (Sec. 3.3) are detailed and mostly self-contained. Theorem 1.4.3 embeds weighted states into calibrated ones; Theorem 1.4.4 collapses the class back to weighted states over F2. Section 3.6's observation that weighted states form a monad only over injective maps while calibrated states achieve full covariance is a real structural insight. The examples—Bell states, the five 3-qutrit states from ref. [59], F4 and Z4 cases—are explicit enough to check by hand.

Soft spots, in proportion. The main one is the companion-paper dependency. Prop. 3.1.2 invokes identities (3.2.2) and (3.2.22) of paper I; Prop. 3.1.3 invokes three more. The push-forward of a calibration under a vertex map—exactly what distinguishes calibrated from weighted states—is defined in I, not here. A referee cannot verify Theorem 1.4.1 from this manuscript alone. This is load-bearing but disclosed and structural to a two-part paper, not an internal inconsistency. The fix: make paper I available or reproduce the essential definitions and identities.

I part ways with the reader's emphasis on the exponentiation rule (2.2.7). Since addition in the cyclicity monoid is componentwise in each Z_x, x^{u+v}=x^u x^v holds by construction. The convention is nonstandard and the phase functions are polynomial only in a generalized sense—the paper says as much—but it is not load-bearing. The typos are real but minor: duplicated calibration entries in Example 3.1.2 and incorrect cyclic monoid labels (Z1 = H0,0 should be Z0 = H1,1, Z2 = H0,2).

This paper is for the hypergraph-state subfield: researchers on qudit stabilizer states and categorical treatments of quantum states. It does not settle whether new entanglement classes emerge, and says so itself. Send it to referees; require access to paper I or a companion summary as a condition of acceptance.

Referee Report

2 major / 4 minor

Summary. The paper defines calibrated hypergraph states for multi-qudit systems over a generic Galois ring. A calibrated hypergraph is a hypergraph whose hyperedges carry functions from an exponent monoid into the prime subring of the Galois ring; the associated state is obtained from the Fourier-transformed vacuum by a diagonal phase operator whose phase function (1.4.6) contains generalized powers x^{w(r)} computed with the cyclicity monoid convention (2.2.7). The central claim is Theorem 1.4.1: this state map is a morphism of the calibrated-hypergraph and multi-qudit-state graded Ω-monads, i.e. it is covariant under all vertex maps and compatible with monadic composition and units. The paper further proves that all such states are locally maximally entangleable stabilizer states (Theorem 1.4.2), that calibrated states contain weighted hypergraph states (Theorem 1.4.3), and that for qubits the two families coincide up to a global sign (Theorem 1.4.4). Section 4 gives a polynomial form for finite-field qudits using the power matrix and basic power matrix, and shows that marked-hypergraph states built from controlled-Z gates are calibrated hypergraph states.

Significance. If Theorem 1.4.1 is correct, the paper provides an explicit, natural construction of a broad class of multipartite stabilizer states whose covariance under arbitrary vertex maps is guaranteed by construction, and it places weighted hypergraph states as a special case. The stabilizer and local-maximal-entangleability proofs in §3.2–§3.3 are self-contained once the calibrated-hypergraph definitions are accepted, and the finite-field polynomial machinery in §4.1 is concrete and well illustrated by the F3 and F4 examples. The paper makes no claim to have solved the entanglement-classification problem and explicitly defers that question; this restraint is appropriate. The main weakness is that the central covariance theorem is proved by importing definitions and identities from a companion paper that is not included in the posting, so the construction cannot be fully checked from this manuscript alone. No fitted parameters or fitted predictions appear; the paper's checks are worked examples.

major comments (2)

[§3.1, Prop. 3.1.2 and Prop. 3.1.3 (Theorem 1.4.1)] The central covariance proof is not checkable from this manuscript alone. In (3.1.12), the rewriting of σ(H,ρ)(E_f^t y) as σ(GC_f(H,ρ))(y) uses the push-forward f_H*ρ of a calibration, which is never defined in this posting, together with identities (3.2.2) and (3.2.22) of the companion paper I. Similarly, Prop. 3.1.3 invokes (3.2.38), (3.2.41), and (3.2.52) of I, and the monadic concatenation (H,ρ)⌣(K,ς) is only described informally. Because covariance under arbitrary, including non-injective, vertex maps is precisely the property that distinguishes calibrated from weighted hypergraph states, an error or a differing convention in any of those companion-paper identities would invalidate Theorem 1.4.1. The revision should make the paper self-contained at least with respect to these specific definitions and identities, either by reproducing them in an appendix or by making part I available with the exact statements used in (3.1.12)–(3.1.18).
[§3.6, proof of Prop. 3.6.1] The proof that the calibrated hypergraph states form a graded Ω-monad contains an invalid step in the injectivity argument. From σ(H,ρ)(E_f^t y) = σ(H,ρ)(E_g^t y) for all calibrated hypergraphs, the proof derives tr(y_{f(r)}) = tr(y_{g(r)}) for all y and then claims f(r) = g(r) because the trace is linear and non-vanishing. This inference is false: a Galois trace map has a nonzero kernel, so tr(a) = tr(b) can hold for a ≠ b; for example, in F4 with trace tr(x0 + x1 θ) = x1, one has tr(θ) = tr(0) = 0. Thus the argument as written does not establish injectivity of f ↦ CE_f. This issue does not affect Theorem 1.4.1, but Prop. 3.6.1 is a stated technical result of the paper and needs a corrected proof or a modified argument that uses the full phase-function data rather than only the trace of a single component.

minor comments (4)

[Example 3.1.2 and §2.2] In Example 3.1.2 the cyclicity monoid of F3 is misreported: the text lists 'Z0 = H1,1, Z1 = H0,0, Z1 = H0,2', which duplicates Z1 and omits Z2; for F3 the correct entries are Z0 = H1,1, Z1 = H0,1, and Z2 = H0,2.
[Throughout] There are several typographical and OCR-style errors, such as 'calibrated hypergraphs states' in the heading of §3.3 and 'compati blyly' in §3.2; these should be corrected in a final pass.
[§2.2 and §3.1] The generalized exponent convention (2.2.7) is central to the phase function (3.1.2), and the paper explains it carefully. It would help the reader if a one-line remark explicitly recalled, at the first occurrence of x^{w(r)} in (3.1.2), that the exponent used is the w(r)_x component of the tuple w(r), since this is the nonstandard feature of the construction.
[§3.1, after Def. 3.1.1] The set A appearing in (3.1.2) is introduced as a submonoid of Z and then fixed to be A = Z 'unless otherwise stated'. It would be clearer to state the default A = Z at the definition itself, rather than in the preceding paragraph, since all later formulas are written with A.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the calibrated hypergraph state map is defined explicitly and its covariance/composition are proved from the companion paper's parameter-free definitions, not from the claims themselves.

full rationale

The paper defines the calibrated hypergraph state map by explicit formulas (1.4.4)-(1.4.6) and then proves Theorem 1.4.1 (covariance and monadic composition) in Props. 3.1.2 and 3.1.3. The proofs do not assume the target identities; they compute sigma(H,rho)(E_f^t y) and reduce it to sigma(GC_f(H,rho))(y) using the push-forward and monoidal-product identities (3.2.2), (3.2.22), (3.2.38), (3.2.41), and (3.2.52) of the companion paper I. Those companion identities are parameter-free definitions of calibration push-forward and of the monadic multiplication of calibrations; they do not include the calibrated hypergraph state map or the covariance statement as an assumption. Similarly, the stabilizer and local-maximal-entangleability proofs (Props. 3.2.4, 3.2.7, and 3.3.2) are carried out in this manuscript using the explicit formulas for D and K, with no fitted parameters. The qubit reduction (Prop. 3.5.3) is an independent calculation using the cyclicity monoid of F_2. The only self-citation is the companion paper I, which provides the monadic framework; this is a normal two-part structure, not an unverified assumption of the result. No circular step can be exhibited, because the central claims are derived from explicit definitions rather than being restatements of the inputs.

Assumptions & free parameters 0 free parameters · 4 assumptions · 1 invented entities

No free parameters enter the construction; all constants are fixed by the Galois ring and the trace map. The main creditor is the companion paper's monadic framework, which this paper treats as an axiom, plus the purpose-built calibration structure.

assumptions (4)

domain assumption Existence and properties of the graded Ω monadic framework of calibrated hypergraphs and multi-qudit states as developed in the companion paper I (monadic products, push-forward of calibrations).
Section 1.3 and Section 3.1 repeatedly cite results from paper I (e.g., eqs. (3.2.2), (3.2.22), (4.2.11) of I) that define the categories and monads on which the construction is built. This is the author's own prior framework, not independently verified here.
standard math Cyclicity monoid theory of finite rings: every element has a finite cyclic submonoid with index and period, and the generalized exponentiation rule (2.2.7) satisfies x^{u+v}=x^u x^v and x^0=1.
Section 2.2 uses standard semigroup theory [60,61] and provides proofs for the needed identities. This is a mathematical derivation, not an empirical postulate.
standard math Galois ring classification, trace map properties (P-linearity, surjectivity, non-singularity), and the structure of the prime subring.
Section 2.1 and Appendix A rely on standard Galois ring theory [56,57]. The non-singularity of the trace pairing is proved in Prop. 2.3.2 and used in the covariance proof.
standard math Unitarity and orthonormal basis properties of the quantum Fourier transform and Pauli operators over Galois rings, including the character orthogonality relation (2.4.15).
Section 2.4 reviews standard material [27,28,62] and uses it for the stabilizer and local-maximal-entanglement proofs.

invented entities (1)

calibration (hyperedge map from exponent functions to the prime subring P)
purpose: generalizes hyperedge weights by assigning a phase contribution to every exponent function on a hyperedge, enabling arbitrary powers of qudit variables in phase functions
Introduced in this work (Section 3.1, eq. (3.1.2)) as the central new structure; no independent empirical handle. It is a mathematical definition, not a physical entity.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Calibrated hypergraph states: II calibrated hypergraph state construction and applications." pith.science (2026). https://pith.science/paper/PFH52ZFA

@misc{pith2026250118968,
  author       = {Pith},
  title        = {Pith review of: Calibrated hypergraph states: II calibrated hypergraph state construction and applications},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/PFH52ZFA}},
  note         = {Machine review of arXiv:2501.18968}
}

abstract

Hypergraph states are a special kind of multipartite states encoded by hypergraphs relevant in quantum error correction, measurement--based quantum computation, quantum non locality and entanglement. In a series of two papers, we introduce and investigate calibrated hypergraph states, an extension of weighted hypergraph states codified by hypergraphs equipped with calibrations, a broad generalization of weightings. The guiding principle informing our approach is that a constructive theory of hypergraph states must be based on a categorical framework for both hypergraphs and multi qudit states constraining hypergraph states enough to render the determination of their general structure possible. In this second paper, we build upon the graded $\varOmega$ monadic framework worked out in the companion paper, focusing on qudits over a generic Galois ring. We explicitly construct a calibrated hypergraph state map as a special morphism of the calibrated hypergraph and multi qudit state $\varOmega$ monads. We further prove that the calibrated hypergraph states so yielded are locally maximally entangleable stabilizer states, elucidate their relationship to weighted hypergraph states, show that they reduce to the weighted ones in the familiar qubit case and prove through examples that this is no longer the case for higher qudits.

Figures

Figures reproduced from arXiv: 2501.18968 by the authors.

**Figure 1.** Hypergraphs can be rendered pictorially by representing vertices as dots (blue) and hyperedges as closed lines encircling the dots corresponding to their vertices (red). Panel paq shows a weighted hypergraph encoding a weighted hypergraph state. The integer juxtaposed to each hyperedge (orange) indicates its weight. Panel pbq shows a calibrated hypergraph encoding a calibrated hypergraph state. The symbols attached … view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

64 extracted references · 7 canonical work pages

[59]

Quantum teleportation of a qutrit state via a hypergraph state in a noisy environment

S. Giri and S. Dutta, Quantum teleportation of a qutrit state via a hypergraph sta te in a noisy environment, arXiv:2409.05675 [quant-ph]

work page Pith review arXiv
[1]

Berge, Graphs and hypergraphs, North-Holland Mathematical Library 6 (1973)

C. Berge, Graphs and hypergraphs, North-Holland Mathematical Library 6 (1973)

1973
[2]

Ouvrard, Hypergraphs: an introduction and review , arXiv:2002.05014 [cs.DM]

X. Ouvrard, Hypergraphs: an introduction and review , arXiv:2002.05014 [cs.DM]

arXiv 2002
[3]

Schlingemann, Cluster states, algorithms and graphs , Quant

D. Schlingemann, Cluster states, algorithms and graphs , Quant. Inf. Comput. 4 (4) (2004), 287 , [arXiv:quant-ph/0305170]

arXiv 2004
[4]

M. Hein, J. Eisert and H. J. Briegel. Multi-party entanglement in graph states , Phys. Rev. A 69 (2004), 062311 , [arXiv:quant-ph/0307130]

arXiv 2004
[5]

Schlingemann and R

D. Schlingemann and R. F. Werner, Quantum error-correcting codes associated with graphs, Phys. Rev. A 65 (2001), 012308 , [arXiv:quant-ph/0012111]

arXiv 2001
[6]

Bausch and F

J. Bausch and F. Leditzky, Error thresholds for arbitrary Pauli noise , SIAM J. Comput. 50 (4) (2021), 1410 , [arXiv:1910.00471 [quant-ph]]

arXiv 2021
[7]

Raussendorf and H

R. Raussendorf and H. J. Briegel, A one-way quantum computer , Phys. Rev. Lett. 86 (2001), 5188

2001

Show all 64 references

[8]

Markham and B

D. Markham and B. C. Sanders, Graph states for quantum secret sharing , Phys. Rev. A 78 (2008), 042309 , [arXiv:0808.1532 [quant-ph]]

2008 arXiv
[9]

Scarani, A

V. Scarani, A. Acín, E. Schenck and M. Aspelmeyer, Nonlocality of cluster states of qubits, Phys. Rev. A 71 (2005), 042325 , [arXiv:quant-ph/0405119]

2005 arXiv
[10]

Gühne, G

O. Gühne, G. Tóth, P. Hyllus, H. J. Briegel, Bell inequalities for graph states , Phys. Rev. Lett. 95 (2005), 120405 , REFERENCES 94 [arXiv:quant-ph/0410059]

2005 arXiv
[11]

Baccari, R

F. Baccari, R. Augusiak, I. Šupić, J. Tura and A. Acín, Scalable Bell inequalities for qubit graph states and robust self-testing , Phys. Rev. Lett. 124 (2020), 020402 , [arXiv:1812.10428 [quant-ph]]

2020 arXiv
[12]

Kruszynska, A

C. Kruszynska, A. Miyake, H. J. Briegel and W. Dúr Entanglement puriﬁcation protocols for all graph states , Phys. Rev. A 74 (2006), 052316 , [arXiv:quant-ph/0606090]

2006 arXiv
[13]

G. Tóth, O. Gühne, Entanglement detection in the stabilizer formalism , Phys. Rev. A 72 (2008), 022340 , [arXiv:quant-ph/0501020]

2008 arXiv
[14]

Jungnitsch, T

B. Jungnitsch, T. Moroder and O. Gühne, Entanglement witnesses for graph states: general theory and examples , Phys. Rev. A 84 (2011), 032310 , [arXiv:1106.1114 [quant-ph]]

2011 arXiv
[15]

M. Hein, W. Dür, J. Eisert, R. Raussendorf, M. Van den Nes t, H.-J. Briegel, Entangle- ment in graph states and its applications , Proc. Internat. School Phys. Enrico Fermi (2008), 115 , [arXiv:quant-ph/0602096]

2008 arXiv
[16]

R. Qu, J. Wang, Z.-S. Li and Y.-R. Bao, Encoding hypergraphs into quantum states , Phys. Rev. A 87 (2013), 022311 , [arXiv:1211.3911 [quant-ph]]

2013 arXiv
[17]

Rossi, M

M. Rossi, M. Huber, D. Bruß and C. Macchiavello Quantum hypergraph states , New J. Phys. 15 (2013), 113022 , [arXiv:1211.5554 [quant-ph]]

2013 arXiv
[18]

Wagner, H

T. Wagner, H. Kampermann and D. Bruß, Analysis of quantum error correction with symmetric hypergraph states , J. Phys. A: Math. Theor. 51 (2018), 125302 , [arXiv:1711.00295 [quant-ph]]. REFERENCES 95

2018 arXiv
[19]

Gachechiladze, O

M. Gachechiladze, O. Gühne, and A. Miyake, Changing the circuit-depth complexity of measurement-based quantum computation with hypergraph st ates, Phys. Rev. A 99 (2019), 052304 , [arXiv:1805.12093 [quant-ph]]

2019 arXiv
[20]

Takeuchi, T

Y. Takeuchi, T. Morimae and M. Hayashi, Quantum computational universality of hy- pergraph states with Pauli-X and Z basis measurements , Sci. Rep. 9 (2019), 13585 , [arXiv:1809.07552 [quant-ph]]

2019 arXiv
[21]

Morimae, Y

T. Morimae, Y. Takeuchi and M. Hayashi, Veriﬁcation of hypergraph states , Phys. Rev. A 96 (2017), 062321 , [arXiv:1701.05688 [quant-ph]]

2017 arXiv
[22]

Zhu and M

H.-J. Zhu and M. Hayashi, Eﬃcient veriﬁcation of hypergraph states , Phys. Rev. Applied 12 (2019), 054047 , [arXiv:1806.05565 [quant-ph]]

2019 arXiv
[23]

Gachechiladze, C

M. Gachechiladze, C. Budroni and O. Gühne, Extreme violation of local realism in quan- tum hypergraph states , Phys. Rev. Lett. 116 (2016), 070401 , [arXiv:1507.03570 [quant-ph]]

2016 arXiv
[24]

Gühne, M

O. Gühne, M. Cuquet, F. E. S. Steinhoﬀ, T. Moroder, M. Ros si, D. Bruß, B. Kraus and C. Macchiavello, Entanglement and nonclassical properties of hypergraph st ates, J. Phys. A: Math. Theor. 47 (2014), 335303 , [arXiv:1404.6492 [quant-ph]]

2014 arXiv
[25]

M. Ghio, D. Malpetti, M. Rossi, D. Bruß and C. Macchiavell o, Multipartite entanglement detection for hypergraph states , J. Phys. A: Math. Theor. 51 (2017), 045302 , [arXiv:1703.00429 [quant-ph]]

2017 arXiv
[26]

Gachechiladze, Quantum hypergraph states and the theory of multiparticle e ntangle- ment, Ph

M. Gachechiladze, Quantum hypergraph states and the theory of multiparticle e ntangle- ment, Ph. D. Thesis, University of Siegen University of Siegen Thesis Archive (2019)

2019
[27]

Ashikhmin and E

A. Ashikhmin and E. Knill, Nonbinary quantum stabilizer codes , REFERENCES 96 IEEE Trans. Inf. Theory 47 (7) (2001), 3065 , [arXiv:quant-ph/0005008]

2001 arXiv
[28]

Gheorghiu, Standard form of qudit stabilizer groups , Phys

V. Gheorghiu, Standard form of qudit stabilizer groups , Phys. Lett. A 378 (2014), 505 , [arXiv:1101.1519 [quant-ph]]

2014 arXiv
[29]

Y. Wang, Z. Hu, B. C. Sanders and S. Kais, Qudits and high-dimensional quantum computing, Front. Phys. 8 (2020), 589504 , [arXiv:2008.00959 [quant-ph]]

2020 arXiv
[30]

Helwig, Absolutely maximally entangled qudit graph states , arXiv:1306.2879 [quant-ph]

W. Helwig, Absolutely maximally entangled qudit graph states , arXiv:1306.2879 [quant-ph]

arXiv
[31]

A. Keet, B. Fortescue, D. Markham and B. C. Sanders, Quantum secret sharing with qudit graph states , Phys. Rev. A 82 (2010), 062315 , [arXiv:1004.4619 [quant-ph]]

2010 arXiv
[32]

F. E. S. Steinhoﬀ, C. Ritz, N. Miklin and O. Gühne, Qudit hypergraph states , Phys. Rev. A 95 (2017), 052340 , [arXiv:1612.06418 [quant-ph]]

2017 arXiv
[33]

Xiong, Y.-Z

F.-L. Xiong, Y.-Z. Zhen, W.-F. Cao, K. Chen and Z.-B. Chen , Qudit hypergraph states and their properties , Phys. Rev. A 97 (2018), 012323 , [arXiv:1701.07733 [quant-ph]]

2018 arXiv
[34]

S. Y. Looi, L. Yu, V. Gheorghiu and R. B. Griﬃths, Quantum error correcting codes using qudit graph states , Phys. Rev. A 78 (2008), 042303 , [arXiv:0712.1979 [quant-ph]]

2008 arXiv
[35]

Gottesman, Stabilizer codes and quantum error correction , Ph

D. Gottesman, Stabilizer codes and quantum error correction , Ph. D. thesis, California Institute of Technology, arXiv:quant-ph/9705052

arXiv
[36]

H. J. García, I. L. Markov and A. W. Cross, On the geometry of stabilizer states , REFERENCES 97 Quantum Inf. Comput. 14 no. 7-8 (2014), 683 , [arXiv:1711.07848 [quant-ph]]

2014 arXiv
[37]

Kruszynska and B

C. Kruszynska and B. Kraus, Local entanglability and multipartite entanglement , Phys. Rev. A [ 79 (2009), 052304 , [arXiv:0808.3862 [quant-ph]]

2009 arXiv
[38]

Van den Nest, J

M. Van den Nest, J. Dehaene and B. De Moor, Graphical description of the action of local Cliﬀord transformations on graph states , Phys. Rev. A 69 (2004), 022316 , [arXiv:quant-ph/0308151]

2004 arXiv
[39]

Van den Nest, J

M. Van den Nest, J. Dehaene and B. De Moor, An eﬃcient algorithm to recognize local Cliﬀord equivalence of graph states , Phys. Rev. A 70 (2004), 034302 , [arXiv:quant-ph/0405023]

2004 arXiv
[40]

Van den Nest, J

M. Van den Nest, J. Dehaene and B. De Moor, Local unitary versus local Cliﬀord equiv- alence of stabilizer states , Phys. Rev. A 71 (2005), 062323 , [arXiv:quant-ph/0411115]

2005 arXiv
[41]

Bravyi, D

S. Bravyi, D. Fattal and D. Gottesman, GHZ extraction yield for multipartite stabilizer states, J. Math. Phys. 47 (2006), 062106 , [arXiv:quant-ph/0504208]

2006 arXiv
[42]

D. W. Lyons, D. J. Upchurch, S. N. Walck and C D. Yetter, Local unitary symmetries of hypergraph states , J. Phys. A: Math. Theor. 48 (2015), 095301 , [arXiv:1410.3904 [quant-ph]]

2015 arXiv
[43]

Hostens, J

E. Hostens, J. Dehaene and B. De Moor, Stabilizer states and Cliﬀord operations for systems of arbitrary dimensions, and modular arithmetic , Phys. Rev. A 71 (2005), 042315 , [arXiv:quant-ph/0408190]

2005 arXiv
[44]

Bahramgiri and S

M. Bahramgiri and S. Beigi, Graph states under the action of local Cliﬀord group in REFERENCES 98 non-binary case, arXiv:quant-ph/0610267

arXiv
[45]

Ionicioiu and T

R. Ionicioiu and T. P. Spiller, Encoding graphs into quantum states: an axiomatic ap- proach, Phys. Rev. A 85 (2012), 062313 , [arXiv:1110.5681 [quant-ph]]

2012 arXiv
[46]

Mac Lane, Categories for the working mathematician , Grad

S. Mac Lane, Categories for the working mathematician , Grad. Texts in Math. 5, Springer (1978)

1978
[47]

Fong and D

B. Fong and D. I. Spivak, An Invitation to applied category theory , Cambridge University Press (2019)

2019
[48]

MacLane Categorical algebra, Bull

S. MacLane Categorical algebra, Bull. Amer. Math. Soc. 71 (1965), 40

1965
[49]

J. M. Boardman and R. M. Homotopy-everything H-spaces, Bull. Amer. Math. Soc. 74 (1968), 1117

1968
[50]

J. P. May, The geometry of iterated loop space , Lect. Notes Math. 271, Springer (1972)

1972
[51]

Markl, S

M. Markl, S. Shnider and J. Stasheﬀ Operads in algebra, topology and physics , Math. Surveys Monogr. Amer. Math. Soc. 96 (2002)

2002
[52]

Melliès, Parametric monads and enriched adjunctions , Preprint available at the author’s homepage (2012)

P.-A. Melliès, Parametric monads and enriched adjunctions , Preprint available at the author’s homepage (2012)

2012
[53]

Katsumata, Parametric eﬀect monads and semantics of eﬀect systems , Proc

S. Katsumata, Parametric eﬀect monads and semantics of eﬀect systems , Proc. POPL 14, ACM (2014), 633

2014
[54]

Melliès, The parametric continuation monad , Math

P.-A. Melliès, The parametric continuation monad , Math. Struct. in Comp. Science 27 (5) (2017), 651

2017
[55]

Fujii, A 2-categorical study of graded and indexed monads , arXiv:1904.08083 [math.CT]

S. Fujii, A 2-categorical study of graded and indexed monads , arXiv:1904.08083 [math.CT]

1904 arXiv
[56]

Wan, Finite ﬁelds and Galois rings , World Scientiﬁc (2011)

Z.-X. Wan, Finite ﬁelds and Galois rings , World Scientiﬁc (2011) . REFERENCES 99

2011
[57]

Bini and F

G. Bini and F. Flamini, Finite commutative rings and their applications , SECS 680, Springer (2002)

2002
[58]

M. R. Kibler, Galois ﬁelds and Galois rings made easy , Elsevier (2017)

2017
[60]

J. M. Howie, Fundamentals of semigroup theory , London Math. Soc. Monogr. 12, Oxford Univ. Press (1995)

1995
[61]

A. H. Cliﬀord and G. B. Preston, The algebraic theory of semigroups, vol. I , Math. Surveys Monogr. 7 part I, Amer. Math. Soc. (1961)

1961
[62]

Zhang, Quantum Fourier transform over Galois rings , arXiv:0904.2560 [quant-ph]

Y. Zhang, Quantum Fourier transform over Galois rings , arXiv:0904.2560 [quant-ph]

arXiv
[63]

Rao and N

A. Rao and N. Pinnawala, New linear codes over Zps via the trace map , 2006 IEEE ISIT, IEEE (2006)

2006
[64]

K. J. Horadam and A. Rao, Fourier transforms from a calibrated trace map , 2006 IEEE ISIT, IEEE (2006)

2006

Pith tools

Reviewed August 9, 2026 · model on record in the stance chip above.

[1] [59]

Quantum teleportation of a qutrit state via a hypergraph state in a noisy environment

S. Giri and S. Dutta, Quantum teleportation of a qutrit state via a hypergraph sta te in a noisy environment, arXiv:2409.05675 [quant-ph]

work page Pith review arXiv

[2] [1]

Berge, Graphs and hypergraphs, North-Holland Mathematical Library 6 (1973)

C. Berge, Graphs and hypergraphs, North-Holland Mathematical Library 6 (1973)

1973

[3] [2]

Ouvrard, Hypergraphs: an introduction and review , arXiv:2002.05014 [cs.DM]

X. Ouvrard, Hypergraphs: an introduction and review , arXiv:2002.05014 [cs.DM]

arXiv 2002

[4] [3]

Schlingemann, Cluster states, algorithms and graphs , Quant

D. Schlingemann, Cluster states, algorithms and graphs , Quant. Inf. Comput. 4 (4) (2004), 287 , [arXiv:quant-ph/0305170]

arXiv 2004

[5] [4]

M. Hein, J. Eisert and H. J. Briegel. Multi-party entanglement in graph states , Phys. Rev. A 69 (2004), 062311 , [arXiv:quant-ph/0307130]

arXiv 2004

[6] [5]

Schlingemann and R

D. Schlingemann and R. F. Werner, Quantum error-correcting codes associated with graphs, Phys. Rev. A 65 (2001), 012308 , [arXiv:quant-ph/0012111]

arXiv 2001

[7] [6]

Bausch and F

J. Bausch and F. Leditzky, Error thresholds for arbitrary Pauli noise , SIAM J. Comput. 50 (4) (2021), 1410 , [arXiv:1910.00471 [quant-ph]]

arXiv 2021

[8] [7]

Raussendorf and H

R. Raussendorf and H. J. Briegel, A one-way quantum computer , Phys. Rev. Lett. 86 (2001), 5188

2001