Qudit hypergraph states

2016/12/31 by F. E. S. Steinhoff, Frank E. S. Steinhoff, Christina Ritz +2
Computer Science · Mathematics · Physics and Astronomy · #Centralizer and normalizer #Class (philosophy) #Combinatorics #Computer science #Discrete mathematics #Equivalence (formal languages) #Hierarchy #Hypergraph #Law #Mathematics #Multipartite #Physics #Political science #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum mechanics #Simple (philosophy) #quant-ph

paper · pdf · doi:10.1103/physreva.95.052340

published as Phys. Rev. A 95, 052340 (2017) · 14 pages, 4 figures

arxiv created 2017/01/20 · openalex publication_date 2017/05/22 · arxiv updated 2017/06/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/06

Abstract

We generalize the class of hypergraph states to multipartite systems of qudits, by means of constructions based on the d-dimensional Pauli group and its normalizer. For simple hypergraphs, the different equivalence classes under local operations are shown to be governed by a greatest-common-divisor hierarchy. Moreover, the special cases of three qutrits and three ququarts is analyzed in detail.

Citations

• Geometric measure of entanglement and applications to bipartite and multipartite quantum states
• Local Unitary Equivalence of Multipartite Pure States
• Inductive classification of multipartite entanglement under stochastic local operations and classical communication
• Universal simulation of Hamiltonian dynamics for quantum systems with finite-dimensional state spaces
• Purification to locally maximally entangleable states
• Generalized Ardehali-Bell inequalities for graph states
• Separability Criterion for Density Matrices
• Stabilizer states and Clifford operations for systems of arbitrary dimensions and modular arithmetic
• Quantum systems with finite Hilbert space
• Quantum-error-correcting codes using qudit graph states
• Measurement-based quantum computation with cluster states
• Hidden Variables and the Two Theorems of John Bell
• Anyons in an exactly solved model and beyond
• Separability of mixed states: necessary and sufficient conditions
• Semidefinite Programming
• Quantum entanglement
• Entanglement detection
• On Composite Numbers P Which Satisfy the Fermat Congruence a P-1 ≡1 mod P
• Stabilizer Codes and Quantum Error Correction