Generalized graph states based on Hadamard matrices
From MaRDI portal
Publication:5500751
Abstract: Graph states are widely used in quantum information theory, including entanglement theory, quantum error correction, and one-way quantum computing. Graph states have a nice structure related to a certain graph, which is given by either a stabilizer group or an encoding circuit, both can be directly given by the graph. To generalize graph states, whose stabilizer groups are abelian subgroups of the Pauli group, one approach taken is to study non-abelian stabilizers. In this work, we propose to generalize graph states based on the encoding circuit, which is completely determined by the graph and a Hadamard matrix. We study the entanglement structures of these generalized graph states, and show that they are all maximally mixed locally. We also explore the relationship between the equivalence of Hadamard matrices and local equivalence of the corresponding generalized graph states. This leads to a natural generalization of the Pauli pairs, which characterizes the local symmetries of these generalized graph states. Our approach is also naturally generalized to construct graph quantum codes which are beyond stabilizer codes.
Recommendations
- A graph theoretical approach to states and unitary operations
- Graph states and local unitary transformations beyond local Clifford operations
- scientific article; zbMATH DE number 62137
- Graph states in phase space
- Quantum discord of states arising from graphs
- Entanglement and separability of graph Laplacian quantum states
- Quantum channels over graph states using generalized measurement-based quantum computation framework
- Generation of multi-qubit graph states via spin networks
- From graph states to two-graph states
- Quantum graphs and random-matrix theory
Cites work
- A Concise Guide to Complex Hadamard Matrices
- A monomial matrix formalism to describe quantum many-body states
- A non-commuting stabilizer formalism
- All degree 6 local unitary invariants of \(k\) qudits
- All teleportation and dense coding schemes
- Codeword Stabilized Quantum Codes
- Codeword stabilized quantum codes: algorithm and structure
- Finitely correlated states on quantum spin chains
- Generalized cluster states based on finite groups
- Graph concatenation for quantum codes
- Graph-based classification of self-dual additive codes over finite fields
- Hadamard matrices and their applications
- Multiparty entanglement in graph states
- PEPS as unique ground states of local Hamiltonians
- Stabilizer codes can be realized as graph codes
- Symmetry protection of measurement-based quantum computation in ground states
Cited in
(16)- Shaded tangles for the design and verification of quantum programs (extended abstract)
- Randomized entangled mixed states from phase states
- Shaded tangles for the design and verification of quantum circuits
- DeterminingX-chains in graph states
- Vector representations of graphs and distinguishing quantum product states with one-way LOCC
- Generalized cluster states based on finite groups
- Quantum states associated to mixed graphs and their algebraic characterization
- Spectrally Bounded Sequences, Codes, and States: Graph Constructions and Entanglement
- Graph states and the variety of principal minors
- Stabilizer codes and equientangled bases from phase states
- Absolutely maximally entangled states from phase states
- Quantum Hall ground states and regular graphs
- \(k\)-uniform maximally mixed states from multi-qudit phase states
- Efficient entanglement measure for graph states
- Generalized cluster states from Hopf algebras: non-invertible symmetry and Hopf tensor network representation
- A graph theoretical approach to states and unitary operations
This page was built for publication: Generalized graph states based on Hadamard matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5500751)
