Two-colorable graph states with maximal Schmidt measure

DOI10.1016/J.PHYSLETA.2006.03.026zbMATH Open1160.81347arXivquant-ph/0511147OpenAlexW2046158165MaRDI QIDQ1017249FDOQ1017249

Authors: Simone Severini 

Publication date: 18 May 2009

Published in: Physics Letters. A (Search for Journal in Brave)

Abstract: The Schmidt measure was introduced by Eisert and Briegel for quantifying the degree of entanglement of multipartite quantum systems [Phys. Rev. A 64, 022306 (2001)]. Although generally intractable, it turns out that there is a bound on the Schmidt measure for two-colorable graph states [Phys. Rev. A 69, 062311 (2004)]. For these states, the Schmidt measure is in fact directly related to the number of nonzero eigenvalues of the adjacency matrix of the associated graph. We remark that almost all two-colorable graph states have maximal Schmidt measure and we construct specific examples. These involve perfect trees, line graphs of trees, cographs, graphs from anti-Hadamard matrices, and unyciclic graphs. We consider some graph transformations, with the idea of transforming a two-colorable graph state with maximal Schmidt measure into another one with the same property. In particular, we consider a transformation introduced by Francois Jaeger, line graphs, and switching. By making appeal to a result of Ehrenfeucht et al. [Discrete Math. 278 (2004)], we point out that local complementation and switching form a transitive group acting on the set of all graph states of a given dimension.

Full work available at URL: https://arxiv.org/abs/quant-ph/0511147

Recommendations

• Multiparty entanglement in graph states
• Highly efficient estimation of entanglement measures for large experimentally created graph states via simple measurements
• Entropic measure and hypergraph states
• Entanglement in eight-qubit graph states
• Direct evaluation of pure graph state entanglement

Mathematics Subject Classification ID

Quantum computation (81P68) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Cites Work

• Title not available (Why is that?)
• Normal hypergraphs and the perfect graph conjecture
• Title not available (Why is that?)
• On the nullity of unicyclic graphs
• On the nullity of line graphs of trees
• Title not available (Why is that?)
• Multiparty entanglement in graph states
• On the Probability That a Random ± 1-Matrix Is Singular
• A new 5‐arc‐transitive cubic graph
• Topological approach to the chemistry of conjugated molecules
• Anti-Hadamard matrices
• Graphes de cordes et espaces graphiques
• Reducing the adjacency matrix of a tree
• On deciding switching equivalence of graphs
• Coding and Cryptography
• Stabilizer codes can be realized as graph codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Transitivity of local complementation and switching on graphs.
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

• A characterization of graphs with rank 4
• Efficient entanglement measure for graph states
• Entanglement of multi-qubit states representing directed networks and its detection with quantum computing
• Research problems from the Aveiro workshop on graph spectra
• Evaluation of entanglement measures for hypergraph states up to four qubits
• Entanglement in eight-qubit graph states
• Classification of 4-qubit entangled graph states according to bipartite entanglement, multipartite entanglement and non-local properties

This page was built for publication: Two-colorable graph states with maximal Schmidt measure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1017249)