Stabilizer Rényi entropy of 3-uniform hypergraph states

• URL: http://arxiv.org/abs/2602.23687v1
• Date: Fri, 27 Feb 2026 05:37:52 GMT
• Title: Stabilizer Rényi entropy of 3-uniform hypergraph states
• Authors: Daichi Kagamihara, Shunji Tsuchiya,
• Abstract summary: Hypergraph states are nonstabilizer generalizations of graph states.<n>Nonstabilizerness, also known as magic, plays a central role in universal quantum computation.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Nonstabilizerness, also known as magic, plays a central role in universal quantum computation. Hypergraph states are nonstabilizer generalizations of graph states and constitute a key class of quantum states in various areas of quantum physics, such as the demonstration of quantum advantage, measurement-based quantum computation, and the study of topological phases. In this work, we investigate nonstabilizerness of 3-uniform hypergraph states, which are solely generated by controlled-controlled-Z gates, in terms of the stabilizer Rényi entropy (SRE). We find that the SRE of 3-uniform hypergraph states can be expressed using the matrix rank, which reduces computational cost from $\mathcal{O}(2^{3N})$ to $\mathcal{O}(N^3 2^{N})$ for $N$-qubit states. Based on this result, we exactly evaluate SREs of one-dimensional hypergraph states. We also present numerical results of SREs of several large-scale 3-uniform hypergraph states. Our results would contribute to an understanding of the role of nonstabilizerness in a wide range of physical settings where hypergraph states are employed.

Related papers

• ENTCALC: Toolkit for calculating geometric entanglement in multipartite quantum systems [43.748379918040854]
  We present entcalc, a Python package for estimating the geometric entanglement of multipartite quantum states.<n>For pure states, it computes the geometric entanglement together with an estimation error.<n>For mixed states, it provides both lower and upper bounds on the geometric entanglement.
  arXiv  Detail & Related papers  (2025-12-11T18:14:43Z)
• Non-stabilizerness of Neural Quantum States [41.94295877935867]
  We introduce a methodology to estimate non-stabilizerness or "magic", a key resource for quantum complexity, with Neural Quantum States (NQS)<n>We study the magic content in an ensemble of random NQS, demonstrating that neural network parametrizations of the wave function capture finite non-stabilizerness besides large entanglement.
  arXiv  Detail & Related papers  (2025-02-13T19:14:15Z)
• Calibrated hypergraph states: II calibrated hypergraph state construction and applications [0.0]
  We introduce and investigate calibrated hypergraph states, an extension of weighted hypergraph states codified by hypergraphs equipped with calibrations.<n>We build upon the graded $varOmega$ monadic framework worked out in the companion paper, focusing on qudits over a generic Galois ring.
  arXiv  Detail & Related papers  (2025-01-31T08:57:56Z)
• 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)
• Magic of quantum hypergraph states [6.3109948645563465]
  We analytically investigate the magic resource of archetypal multipartite quantum states -- quantum hypergraph states. Our study advances the understanding of multipartite quantum magic and could lead to applications in quantum computing and quantum many-body physics.
  arXiv  Detail & Related papers  (2023-08-03T17:21:55Z)
• Quantum State Tomography for Matrix Product Density Operators [28.799576051288888]
  Reconstruction of quantum states from experimental measurements is crucial for the verification and benchmarking of quantum devices. Many physical quantum states, such as states generated by noisy, intermediate-scale quantum computers, are usually structured. We establish theoretical guarantees for the stable recovery of MPOs using tools from compressive sensing and the theory of empirical processes.
  arXiv  Detail & Related papers  (2023-06-15T18:23:55Z)
• Dissipative preparation and stabilization of many-body quantum states in a superconducting qutrit array [55.41644538483948]
  We present and analyze a protocol for driven-dissipatively preparing and stabilizing a manifold of quantum manybody entangled states. We perform theoretical modeling of this platform via pulse-level simulations based on physical features of real devices. Our work shows the capacity of driven-dissipative superconducting cQED systems to host robust and self-corrected quantum manybody states.
  arXiv  Detail & Related papers  (2023-03-21T18:02:47Z)
• Symmetric hypergraph states: Entanglement quantification and robust Bell nonlocality [0.0]
  We quantify entanglement and nonlocality for large classes of quantum hypergraph states. We recognize the resemblance between symmetric graph states and symmetric hypergraph states.
  arXiv  Detail & Related papers  (2023-02-03T12:49:32Z)
• Robust preparation of Wigner-negative states with optimized SNAP-displacement sequences [41.42601188771239]
  We create non-classical states of light in three-dimensional microwave cavities. These states are useful for quantum computation. We show that this way of creating non-classical states is robust to fluctuations of the system parameters.
  arXiv  Detail & Related papers  (2021-11-15T18:20:38Z)
• Improved Graph Formalism for Quantum Circuit Simulation [77.34726150561087]
  We show how to efficiently simplify stabilizer states to canonical form. We characterize all linearly dependent triplets, revealing symmetries in the inner products. Using our novel controlled-Pauli $Z$ algorithm, we improve runtime for inner product computation from $O(n3)$ to $O(nd2)$ where $d$ is the maximum degree of the graph.
  arXiv  Detail & Related papers  (2021-09-20T05:56:25Z)
• 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.