Tapping into Permutation Symmetry for Improved Detection of k-Symmetric Extensions

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Li, Youning, Zhang, Chao, Hou, Shi-Yao, Wu, Zipeng, Zhu, Xuanran, Zeng, Bei
Formato: Preprint
Publicado: 2023
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866912287500009472
author Li, Youning
Zhang, Chao
Hou, Shi-Yao
Wu, Zipeng
Zhu, Xuanran
Zeng, Bei
author_facet Li, Youning
Zhang, Chao
Hou, Shi-Yao
Wu, Zipeng
Zhu, Xuanran
Zeng, Bei
contents Symmetric extensions are essential in quantum mechanics, providing a lens to investigate the correlations of entangled quantum systems and to address challenges like the quantum marginal problem. Though semi-definite programming (SDP) is a recognized method for handling symmetric extensions, it grapples with computational constraints, especially due to the large real parameters in generalized qudit systems. In this study, we introduce an approach that adeptly leverages permutation symmetry. By fine-tuning the SDP problem for detecting \( k \)-symmetric extensions, our method markedly diminishes the searching space dimensionality and trims the number of parameters essential for positive definiteness tests. This leads to an algorithmic enhancement, reducing the complexity from \( O(d^{2k}) \) to \( O(k^{d^2}) \) in the qudit \( k \)-symmetric extension scenario. Additionally, our approach streamlines the process of verifying the positive definiteness of the results. These advancements pave the way for deeper insights into quantum correlations, highlighting potential avenues for refined research and innovations in quantum information theory.
format Preprint
id arxiv_https___arxiv_org_abs_2309_04144
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Tapping into Permutation Symmetry for Improved Detection of k-Symmetric Extensions
Li, Youning
Zhang, Chao
Hou, Shi-Yao
Wu, Zipeng
Zhu, Xuanran
Zeng, Bei
Quantum Physics
Symmetric extensions are essential in quantum mechanics, providing a lens to investigate the correlations of entangled quantum systems and to address challenges like the quantum marginal problem. Though semi-definite programming (SDP) is a recognized method for handling symmetric extensions, it grapples with computational constraints, especially due to the large real parameters in generalized qudit systems. In this study, we introduce an approach that adeptly leverages permutation symmetry. By fine-tuning the SDP problem for detecting \( k \)-symmetric extensions, our method markedly diminishes the searching space dimensionality and trims the number of parameters essential for positive definiteness tests. This leads to an algorithmic enhancement, reducing the complexity from \( O(d^{2k}) \) to \( O(k^{d^2}) \) in the qudit \( k \)-symmetric extension scenario. Additionally, our approach streamlines the process of verifying the positive definiteness of the results. These advancements pave the way for deeper insights into quantum correlations, highlighting potential avenues for refined research and innovations in quantum information theory.
title Tapping into Permutation Symmetry for Improved Detection of k-Symmetric Extensions
topic Quantum Physics
url https://arxiv.org/abs/2309.04144