Randomized hypergraph states and their entanglement properties
arXiv:2506.20075 · doi:10.1002/andp.202500622
Abstract
We study the entanglement properties of randomized mixed hypergraph states, extending the concept of randomized mixed graph states to encompass hypergraph-based quantum states. In our model, imperfect generalized multi-qubit 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 multi-qubit states. Numerical results for various hypergraph configurations with up to four qubits reveal rich, 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 understanding entanglement resilience under gate imperfections, providing insight into the experimental implementation of hypergraph states in noisy quantum devices.
14 pages, 9 figures, 2 tables, matches published version
References in corpus (37)
- The logarithmic negativity: A full entanglement monotone that is not convex
- Graph States for Quantum Secret Sharing
- Stabilizer Formalism for Operator Quantum Error Correction
- Taming multiparticle entanglement
- Entanglement Detection in the Stabilizer Formalism
- Repeat-Until-Success Quantum Computing
- All Entangled Quantum States Are Nonlocal
- Quantifying Entanglement with Witness Operators
- Bell Inequalities for Graph States
- Multi-partite entanglement speeds up quantum key distribution in networks
- Quantum Hypergraph States
- Repeat-Until-Success quantum computing using stationary and flying qubits
- Multi-qubit gates and Schrödinger cat states in an optical clock
- Hierarchy of universal entanglement in 2D measurement-based quantum computation
- Entanglement Witnesses for Graph States: General Theory and Examples
- Universal quantum operations and ancilla-based readout for tweezer clocks
- Efficient Verification of Hypergraph States
- Entanglement and nonclassical properties of hypergraph states
- Encoding Hypergraphs into Quantum States
- Dense coding with multipartite quantum states
- Extreme violation of local realism in quantum hypergraph states
- Optimal preparation of graph states
- Changing the circuit-depth complexity of measurement-based quantum computation with hypergraph states
- Quantum Experiments and Hypergraphs: Multi-Photon Sources for Quantum Interference, Quantum Computation and Quantum Entanglement
- Multipartite entanglement detection for hypergraph states
- Local unitary symmetries of hypergraph states
- Magic of quantum hypergraph states
- Efficient verification of continuous-variable quantum states and devices without assuming identical and independent operations
- Randomized Graph States and their Entanglement Properties
- Entanglement of random hypergraph states
- Hypergraph states in Grover's quantum search algorithm
- Signless Normalized Laplacian for Hypergraphs
- Analysis of quantum error correction with symmetric hypergraph states
- Quantum Hypergraph States in Continuous Variables
- Symmetric hypergraph states: Entanglement quantification and robust Bell nonlocality
- Entanglement Purification of Hypergraph States
- Multipartite entanglement sudden death and birth in randomized hypergraph states