Randomized hypergraph states and their entanglement properties

• URL: http://arxiv.org/abs/2506.20075v1
• Date: Wed, 25 Jun 2025 01:02:22 GMT
• Title: Randomized hypergraph states and their entanglement properties
• Authors: Vinícius Salem, Alison A. Silva, Fabiano M. Andrade,
• Abstract summary: We study the entanglement properties of randomized hypergraph states.<n>We extend the concept of randomized graph states to encompass hypergraph-based quantum states.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study the entanglement properties of randomized hypergraph states, extending the concept of randomized graph states to encompass hypergraph-based quantum states. In our model, imperfect generalized multiqubit gates are applied probabilistically, simulating experimentally realistic noisy gate operations where gate fidelity decreases with increasing hyperedge order. We analyze bipartite and genuine multipartite entanglement of these mixed multiqubit states. Numerical results for various hypergraph configurations up to four qubits reveal rich and sometimes nonmonotonic entanglement behavior, stemming from the interplay between hyperedge structure and gate imperfections. We derive analytical expressions for entanglement witnesses based on randomization overlap for new hypergraph families. Our findings contribute to the understanding of entanglement resilience under gate imperfections, providing insights for the experimental implementation of hypergraph states in noisy quantum devices.

Related papers

• Grassmann Variational Monte Carlo with neural wave functions [45.935798913942904]
  We formalize the framework introduced by Pfau et al.citepfau2024accurate in terms of Grassmann geometry of the Hilbert space.<n>We validate our approach on the Heisenberg quantum spin model on the square lattice, achieving highly accurate energies and physical observables for a large number of excited states.
  arXiv  Detail & Related papers  (2025-07-14T13:53:13Z)
• Community and hyperedge inference in multiple hypergraphs [9.782518418521175]
  We show how to utilize interconnections between multiple hypergraphs to synthesize integrated information from multiple higher-order systems.<n>We propose a model based on the block model, which integrates information from multiple hypergraphs to reveal latent high-order structures.<n>Our work provides a practical and flexible tool for analyzing multiple hypergraphs, greatly advancing the understanding of the organization in real-world high-order systems.
  arXiv  Detail & Related papers  (2025-05-08T05:52:41Z)
• Avoided-crossings, degeneracies and Berry phases in the spectrum of quantum noise through analytic Bloch-Messiah decomposition [49.1574468325115]
  "analytic Bloch-Messiah decomposition" provides approach for characterizing dynamics of quantum optical systems.<n>We show that avoided crossings arise naturally when a single parameter is varied, leading to hypersensitivity of the singular vectors.<n>We highlight the possibility of programming the spectral response of photonic systems through the deliberate design of avoided crossings.
  arXiv  Detail & Related papers  (2025-04-29T13:14:15Z)
• 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)
• 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)
• Hypergraph Transformer for Semi-Supervised Classification [50.92027313775934]
  We propose a novel hypergraph learning framework, HyperGraph Transformer (HyperGT) HyperGT uses a Transformer-based neural network architecture to effectively consider global correlations among all nodes and hyperedges. It achieves comprehensive hypergraph representation learning by effectively incorporating global interactions while preserving local connectivity patterns.
  arXiv  Detail & Related papers  (2023-12-18T17:50:52Z)
• Multipartite entanglement sudden death and birth in randomized hypergraph states [0.0]
  We introduce and analyze the entanglement properties of randomized hypergraph states. We show that entanglement exhibits a non-monotonic behavior in terms of the randomness parameters.
  arXiv  Detail & Related papers  (2023-10-31T12:45:26Z)
• 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)
• Witnessing entanglement in trapped-ion quantum error correction under realistic noise [41.94295877935867]
  Quantum Error Correction (QEC) exploits redundancy by encoding logical information into multiple physical qubits. We present a detailed microscopic error model to estimate the average gate infidelity of two-qubit light-shift gates used in trapped-ion platforms. We then apply this realistic error model to quantify the multipartite entanglement generated by circuits that act as QEC building blocks.
  arXiv  Detail & Related papers  (2022-12-14T20:00:36Z)
• Fast and Accurate Anomaly Detection in Dynamic Graphs with a Two-Pronged Approach [49.25767340466445]
  We propose AnomRank, an online algorithm for anomaly detection in dynamic graphs. AnomRank uses a two-pronged approach defining two novel metrics for anomalousness. We show theoretically and experimentally that the two-pronged approach successfully detects two common types of anomalies.
  arXiv  Detail & Related papers  (2020-11-26T01:38:27Z)
• Efficient construction of tensor-network representations of many-body Gaussian states [59.94347858883343]
  We present a procedure to construct tensor-network representations of many-body Gaussian states efficiently and with a controllable error. These states include the ground and thermal states of bosonic and fermionic quadratic Hamiltonians, which are essential in the study of quantum many-body systems.
  arXiv  Detail & Related papers  (2020-08-12T11:30:23Z)
• Error-correction and noise-decoherence thresholds for coherent errors in planar-graph surface codes [0.0]
  We numerically study coherent errors in surface codes on planar graphs. In particular, we show that a graph class exists where logical-level noise exhibits a decoherence threshold slightly above the error-correction threshold.
  arXiv  Detail & Related papers  (2020-06-23T14:29:25Z)

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.