Entanglement of random hypergraph states
arXiv:2110.07158 · doi:10.1103/PhysRevA.106.012410
Abstract
Random quantum states and operations are of fundamental and practical interests. In this work, we investigate the entanglement properties of random hypergraph states, which generalize the notion of graph states by applying generalized controlled-phase gates on an initial reference product state. In particular, we study the two ensembles generated by random Controlled-Z(CZ) and Controlled-Controlled-Z(CCZ) gates, respectively. By applying tensor network representation and combinational counting, we analytically show that the average subsystem purity and entanglement entropy for the two ensembles feature the same volume law, but greatly differ in typicality, namely the purity fluctuation is small and universal for the CCZ ensemble while it is large for the CZ ensemble. We discuss the implications of these results for the onset of entanglement complexity and quantum chaos.
14+8 pages,9 figures,published version
References in corpus (19)
- Black holes as mirrors: quantum information in random subsystems
- Multi-party entanglement in graph states
- Evenly distributed unitaries: on the structure of unitary designs
- Aspects of generic entanglement
- Bipartite entanglement and entropic boundary law in lattice spin systems
- Stabilizer Rényi entropy
- Multipartite entanglement in spin chains
- Many-body quantum magic
- Quantum Chaos is Quantum
- Both Toffoli and Controlled-NOT need little help to do universal quantum computation
- Entanglement and nonclassical properties of hypergraph states
- Encoding Hypergraphs into Quantum States
- The Clifford group fails gracefully to be a unitary 4-design
- Irreversibility and Entanglement Spectrum Statistics in Quantum Circuits
- Efficient algorithm for multi-qudit twirling for ensemble quantum computation
- Diagonal quantum circuits: their computational power and applications
- Quantum State Complexity in Computationally Tractable Quantum Circuits
- Local unitary symmetries of hypergraph states
- Locally inequivalent four qubit hypergraph states
Cited by in corpus (7)
- Nonstabilizerness determining the hardness of direct fidelity estimation
- Magic of quantum hypergraph states
- Multipartite entanglement sudden death and birth in randomized hypergraph states
- Randomized hypergraph states and their entanglement properties
- Symmetry-Accelerated Classical Simulation of Clifford-Dominated Circuits
- Scattering entropies of quantum graphs with several channels
- Phase Transitions and Noise Robustness of Quantum Graph States