A graph theoretical approach to states and unitary operations
arXiv:1502.07821 · doi:10.1007/s11128-016-1250-y
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.
arXiv comment20 pages, version very similar to the one published in quantum information processing
References in corpus (5)
- Entanglement of Formation of an Arbitrary State of Two Qubits
- Quantum Mechanics helps in searching for a needle in a haystack
- Elementary gates for quantum computation
- The laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
- Conditions for separability in generalized Laplacian matrices and nonnegative matrices as density matrices
Cited by in corpus (6)
- Quantum Experiments and Hypergraphs: Multi-Photon Sources for Quantum Interference, Quantum Computation and Quantum Entanglement
- Bipartite separability and non-local quantum operations on graphs
- Quantum discord of states arising from graphs
- Condition for zero and non-zero discord in graph Laplacian quantum states
- Multipartite separability of density matrices of graphs
- Quantum state transfer and periodicity in discrete-time quantum walks under non--Markovian dephasing noise