A graph theoretical approach to states and unitary operations

DOI10.1007/S11128-016-1250-YzbMATH Open1338.81211arXiv1502.07821OpenAlexW3103033167MaRDI QIDQ296156FDOQ296156

Authors: Supriyo Dutta, Bibhas Adhikari, Subhashish Banerjee 

Publication date: 14 June 2016

Published in: Quantum Information Processing (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1502.07821

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

zbMATH Keywords

Pauli matricesgraph switchinglocal unitary operatorssignless Laplacian of a combinatorial graph

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)

Cites Work

• Title not available (Why is that?)
• Quantum cryptography: public key distribution and coin tossing
• Entanglement of Formation of an Arbitrary State of Two Qubits
• Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• Book review of: T. Mitsa, Temporal data mining.
• 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 diagonally dominant matrices as density matrices
• A note about cospectral graphs for the adjacency and normalized Laplacian matrices
• A construction of cospectral graphs for the normalized Laplacian
• Interpreting the von Neumann entropy of graph Laplacians, and coentropic graphs
• A combinatorial approach for studying local operations and classical communication transformations of multipartite states
• Title not available (Why is that?)
• Signless Laplacians and line graphs

Cited In (15)

• Vector representations of graphs and distinguishing quantum product states with one-way LOCC
• Laplacian matrices of weighted digraphs represented as quantum states
• Which Graph States are Useful for Quantum Information Processing?
• Entanglement and separability of graph Laplacian quantum states
• Combinatorial entanglement
• Self-Testing Graph States
• Limitations of quantum coset states for graph isomorphism
• DeterminingX-chains in graph states
• Multipartite separability of density matrices of graphs
• Condition for zero and nonzero discord in graph Laplacian quantum states
• Title not available (Why is that?)
• Symmetric Laplacians, quantum density matrices and their von-Neumann entropy
• Quantum discord of states arising from graphs
• Generalized graph states based on Hadamard matrices
• Geometric properties of evolutionary graph states and their detection on a quantum computer

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)