Quantum entanglement \& purity testing: a graph zeta function perspective

DOI10.1016/J.PHYSLETA.2023.128993MaRDI QIDQ6166587zbMATH OpenOpenAlexFDO

Authors Zachary P. Bradshaw, Margarite L. LaBorde

Publication date 3 August 2023

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

graph theoryseparabilityquantum entanglementspecial functionspurityfunctiograph zeta function

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Singularities in algebraic geometry (14B05) Symmetric groups (20B30) Quantum coherence, entanglement, quantum correlations (81P40) Quantum state spaces, operational and probabilistic concepts (81P16) Entanglement measures, concurrencies, separability criteria (81P42) Zeta functions and (L)-functions of function fields (11R59)

Abstract: We assign an arbitrary density matrix to a weighted graph and associate to it a graph zeta function that is both a generalization of the Ihara zeta function and a special case of the edge zeta function. We show that a recently developed bipartite pure state separability algorithm based on the symmetric group is equivalent to the condition that the coefficients in the exponential expansion of this zeta function are unity. Moreover, there is a one-to-one correspondence between the nonzero eigenvalues of a density matrix and the singularities of its zeta function. Several examples are given to illustrate these findings.

Recommendations

• The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
• A combinatorial approach to multipartite quantum systems: basic formulation
• Separability of density matrices of graphs for multipartite systems
• The tripartite separability of density matrices of graphs
• Combinatorial laplacians and positivity under partial transpose

Cites work

• scientific article; zbMATH DE number 4165188 (Why is no real title available?)
• scientific article; zbMATH DE number 192909 (Why is no real title available?)
• scientific article; zbMATH DE number 1970438 (Why is no real title available?)
• scientific article; zbMATH DE number 1495995 (Why is no real title available?)
• A combinatorial approach to multipartite quantum systems: basic formulation
• An application of Bell's inequalities to a quantum state extension problem
• Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
• Combinatorial laplacians and positivity under partial transpose
• Riemann's zeta function
• Separability Criterion for Density Matrices
• Separability of mixed states: necessary and sufficient conditions.
• Stabilization of Quantum Computations by Symmetrization
• Strong NP-hardness of the quantum separability problem
• THE IHARA-SELBERG ZETA FUNCTION OF A TREE LATTICE
• The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
• What are zeta functions of graphs and what are they good for?
• Zeta functions of graphs. A stroll through the garden

Cited in

(1)

• Efficient Quantum Algorithms for Testing Symmetries of Open Quantum Systems

This page was built for publication: Quantum entanglement \& purity testing: a graph zeta function perspective

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