A graph theoretical approach to states and unitary operations
From MaRDI portal
(Redirected from Publication:296156)
Abstract: Building upon our previous work, on graphical representation of a quantum state by signless Laplacian matrix, we pose the following question. If a local unitary operation is applied to a quantum state, represented by a signless Laplacian matrix, what would be the corresponding graph and how does one implement local unitary transformations graphically? We answer this question by developing the notion of local unitary equivalent graphs. We illustrate our method by a few, well known, local unitary transformations implemented by single-qubit Pauli and Hadamard gates. We also show how graph switching can be used to implement the action of the CNOT gate, resulting in a graphical description of Bell state generation.
Recommendations
- Graph states and local unitary transformations beyond local Clifford operations
- Graphical description of unitary transformations on hypergraph states
- Quantum state representation based on combinatorial Laplacian matrix of star-relevant graph
- From graph states to two-graph states
- Generalized graph states based on Hadamard matrices
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 3482386 (Why is no real title available?)
- A combinatorial approach for studying local operations and classical communication transformations of multipartite states
- A construction of cospectral graphs for the normalized Laplacian
- A note about cospectral graphs for the adjacency and normalized Laplacian matrices
- Book review of: T. Mitsa, Temporal data mining.
- Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
- Conditions for separability in generalized Laplacian matrices and diagonally dominant matrices as density matrices
- Entanglement of formation of an arbitrary state of two qubits
- Interpreting the von Neumann entropy of graph Laplacians, and coentropic graphs
- Quantum cryptography: public key distribution and coin tossing
- Signless Laplacians and line graphs
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
Cited in
(16)- Geometric properties of evolutionary graph states and their detection on a quantum computer
- Graph states and local unitary transformations beyond local Clifford operations
- DeterminingX-chains in graph states
- Vector representations of graphs and distinguishing quantum product states with one-way LOCC
- Graphical description of unitary transformations on hypergraph states
- Condition for zero and nonzero discord in graph Laplacian quantum states
- Combinatorial entanglement
- Self-Testing Graph States
- Entanglement and separability of graph Laplacian quantum states
- Which Graph States are Useful for Quantum Information Processing?
- Generalized graph states based on Hadamard matrices
- Laplacian matrices of weighted digraphs represented as quantum states
- scientific article; zbMATH DE number 7561601 (Why is no real title available?)
- Multipartite separability of density matrices of graphs
- Symmetric Laplacians, quantum density matrices and their von-Neumann entropy
- Quantum discord of states arising from graphs
This page was built for publication: A graph theoretical approach to states and unitary operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q296156)
