k-Uniform complete hypergraph states stabilizers in terms of local operators

• URL: http://arxiv.org/abs/2511.15911v1
• Date: Wed, 19 Nov 2025 22:30:31 GMT
• Title: k-Uniform complete hypergraph states stabilizers in terms of local operators
• Authors: Gabriel M. Arantes, Vinícius Salem, Danilo Cius, Bárbara Amaral,
• Abstract summary: We present a novel method to express the stabilizer of a k-uniform complete hypergraph state as a linear combination of local operators.<n>Our formulation provides an explicit description of the stabilizers for k-uniform complete hypergraphs.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this work, we present a novel method to express the stabilizer of a k-uniform complete hypergraph state as a linear combination of local operators. Quantum hypergraph states generalize graph states and exhibit properties that are not shared by their graph counterparts, most notably, their stabilizers are intrinsically nonlocal, as hyperedges can involve arbitrary subsets of vertices. Our formulation provides an explicit description of the stabilizers for k-uniform complete hypergraphs and may offer new insights for exploring these states within the stabilizer formalism. In particular, this approach could facilitate the construction of new Bell inequalities or find applications in quantum error correction.

Related papers

• Random-Matrix-Induced Simplicity Bias in Over-parameterized Variational Quantum Circuits [72.0643009153473]
  We show that expressive variational ansatze enter a Haar-like universality class in which both observable expectation values and parameter gradients concentrate exponentially with system size.<n>As a consequence, the hypothesis class induced by such circuits collapses with high probability to a narrow family of near-constant functions.<n>We further show that this collapse is not unavoidable: tensor-structured VQCs, including tensor-network-based and tensor-hypernetwork parameterizations, lie outside the Haar-like universality class.
  arXiv  Detail & Related papers  (2026-01-05T08:04:33Z)
• Freeness Reined in by a Single Qubit [36.94429692322632]
  We find that, even in this setting, the correlation functions predicted by free probability theory receive corrections of order $O(1)$.<n>We trace their origin to non-uniformly distributed stationary quantum states, which we characterize analytically and confirm numerically.
  arXiv  Detail & Related papers  (2025-12-15T19:00:09Z)
• Hypergraph Contrastive Learning for both Homophilic and Heterophilic Hypergraphs [36.44792866509702]
  Hypergraph neural networks (HNNs) have been widely used to capture complex high-order relationships.<n>We propose textbfHONOR, a novel unsupervised textbfHypergraph ctextbfONtrastive learning framework suitable for both homtextbfOphilic and hetetextbfRophilic hypergraphs.
  arXiv  Detail & Related papers  (2025-11-24T05:35:46Z)
• Graph Few-Shot Learning via Adaptive Spectrum Experts and Cross-Set Distribution Calibration [28.335765586298347]
  Graph few-shot learning has attracted increasing attention due to its ability to rapidly adapt models to new tasks with only limited labeled nodes.<n>We propose GRACE, a novel Graph few-shot leaRning framework that integrates Adaptive spectrum experts with Cross-sEt distribution calibration techniques.
  arXiv  Detail & Related papers  (2025-10-14T04:39:03Z)
• Hypergraph Neural Sheaf Diffusion: A Symmetric Simplicial Set Framework for Higher-Order Learning [0.0]
  We introduce Hypergraph Neural Sheaf Diffusion (HNSD), the first principled extension of neural sheaf diffusion to hypergraphs.<n>HNSD operates via normalized degree zero sheaf Laplacian over symmetric simplicial lifting, resolving orientation ambiguity and adjacency sparsity inherent to hypergraph learning.
  arXiv  Detail & Related papers  (2025-05-09T00:26:38Z)
• Nonclassical Nullifiers for Quantum Hypergraph States [0.0]
  Quantum hypergraph states form a generalisation of the graph state formalism.<n>Networks of such states are able to achieve universality for continuous variable measurement based quantum computation.
  arXiv  Detail & Related papers  (2025-02-04T11:06:19Z)
• Non-symmetric GHZ states: weighted hypergraph and controlled-unitary graph representations [0.0]
  We show that non-symmetric GHZ states can be efficiently stabilized using local operations and a single ancilla.<n>Our results provide a systematic approach to characterizing and stabilizing non-symmetric multipartite entanglement in both qubit and qudit systems.
  arXiv  Detail & Related papers  (2024-08-05T18:00:18Z)
• Exploiting hidden structures in non-convex games for convergence to Nash equilibrium [62.88214569402201]
  A wide array of modern machine learning applications can be formulated as non-cooperative Nashlibria. We provide explicit convergence guarantees for both deterministic and deterministic environments.
  arXiv  Detail & Related papers  (2023-12-27T15:21:25Z)
• Lorentz Equivariant Model for Knowledge-Enhanced Hyperbolic Collaborative Filtering [19.57064597050846]
  We introduce prior auxiliary information from the knowledge graph (KG) to assist the user-item graph. We propose a rigorously Lorentz group equivariant knowledge-enhanced collaborative filtering model (LECF) We show that LECF remarkably outperforms state-of-the-art methods.
  arXiv  Detail & Related papers  (2023-02-09T10:20:23Z)
• Hyperspectral Image Denoising Using Non-convex Local Low-rank and Sparse Separation with Spatial-Spectral Total Variation Regularization [49.55649406434796]
  We propose a novel non particular approach to robust principal component analysis for HSI denoising. We develop accurate approximations to both rank and sparse components. Experiments on both simulated and real HSIs demonstrate the effectiveness of the proposed method.
  arXiv  Detail & Related papers  (2022-01-08T11:48:46Z)
• Multi-fidelity Stability for Graph Representation Learning [38.31487722188051]
  We introduce a weaker uniform generalization termed emphmulti-fidelity stability and give an example. We present lower bounds for the discrepancy between the two types of stability, which justified the multi-fidelity design.
  arXiv  Detail & Related papers  (2021-11-25T01:33:41Z)
• A Gap Between the Hypergraph and Stabilizer Entropy Cones [0.20999222360659606]
  We show that the stabilizer and hypergraph entropy cones coincide for four parties, leading to a conjecture of their equivalence at higher party numbers. We improve the characterization of stabilizer entropies and show that all linear rank inequalities at five parties, except for classical monotonicity, form facets of the stabilizer cone.
  arXiv  Detail & Related papers  (2020-06-29T18:08:37Z)
• Hypergraph min-cuts from quantum entropies [1.6312226592634047]
  We prove that the min-cut function of any weighted hypergraph can be approximated by the entropies of quantum states known as stabilizer states. It shows that the recently defined hypergraph cones are contained in the quantum stabilizer entropy cones.
  arXiv  Detail & Related papers  (2020-02-27T19:19:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.