Symmetric and Antisymmetric Quantum States from Graph Structure and Orientation
Preprint
Abstract
Graph states provide a powerful framework for describing multipartite entanglement in quantum information science. In their standard formulation, graph states are generated by controlled-$Z$ interactions and naturally encode symmetric exchange properties. Here we establish a precise correspondence between graph topology and exchange symmetry by proving that a graph state is fully symmetric under particle permutations if and only if the underlying graph is complete. We then introduce a generalized graph-based construction using a non-commutative two-qudit gate, denoted $GR$, which requires directed edges and an explicit vertex ordering. We show that complete directed graphs endowed with appropriate orientations, for an odd number of qudits generate fully antisymmetric multipartite states. Together, these results provide a unified graph-theoretic description of bosonic and fermionic exchange symmetry based on graph completeness and edge orientation.
Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Deterministic Generation of Concatenated Graph Codes from Quantum EmittersPRX Quantum, 2025
- Entanglement of nanophotonic quantum memory nodes in a telecom networkNature, 2024
- A recipe for speedNature Physics, 2024
- Multipartite entanglement sudden death and birth in randomized hypergraph statesPhysical Review A, 2024
- Efficient generation of entangled multiphoton graph states from a single atomNature, 2022
- Extreme Violation of Local Realism in Quantum Hypergraph StatesPhysical Review Letters, 2016
- Bell Inequalities for Graph StatesPhysical Review Letters, 2005
- Measurement-based quantum computation on cluster statesPhysical Review A, 2003
- Parametric down‐conversion experiments with stationary fieldsFortschritte der Physik, 2003
- A One-Way Quantum ComputerPhysical Review Letters, 2001