Hybrid of Gradient Descent And Semidefinite Programming for Certifying Multipartite Entanglement Structure

Abstract

Multipartite entanglement is a crucial resource for a wide range of quantum information processing tasks, including quantum metrology, quantum computing, and quantum communication. The verification of multipartite entanglement, along with an understanding of its intrinsic structure, is of fundamental importance, both for the foundations of quantum mechanics and for the practical applications of quantum information technologies. Nonetheless, detecting entanglement structures remains a significant challenge, particularly for general states and large-scale quantum systems. To address this issue, we develop an efficient algorithm that combines semidefinite programming with a gradient descent method. This algorithm is designed to explore the entanglement structure by examining the inner polytope of the convex set that encompasses all states sharing the same entanglement properties. Through detailed examples, we demonstrate the superior performance of our approach compared to many of the best-known methods available today. Our method not only improves entanglement detection but also provides deeper insights into the complex structures of many-body quantum systems, which is essential for advancing quantum technologies

7 pages, 3 figures, part of arXiv:2406.07274

References in corpus (39)

• Entanglement detection
• Quantum Fisher information matrix and multiparameter estimation
• Fisher information and multiparticle entanglement
• Multipartite entanglement and high precision metrology
• Entanglement and Extreme Spin Squeezing
• Taming multiparticle entanglement
• Bell-type inequalities to detect true n-body non-separability
• Device-independent witnesses of genuine multipartite entanglement
• Detection of high-dimensional genuine multi-partite entanglement of mixed states
• Multipartite entanglement in spin chains
• Absolutely maximally entangled states of seven qubits do not exist
• A multinode quantum network over a metropolitan area
• Spin squeezing inequalities for arbitrary spin
• On the permutationally invariant part of a density matrix and nonseparability of N-qubit states
• Family of Bell-like inequalities as device-independent witnesses for entanglement depth
• Metrological Detection of Multipartite Entanglement from Young Diagrams
• Entanglement Witnesses for Graph States: General Theory and Examples
• Wigner-Yanase skew information as tests for quantum entanglement
• Efficient entanglement criteria for discrete, continuous, and hybrid variables
• Device-independent witnesses of entanglement depth from two-body correlators
• Detecting multipartite entanglement structure with minimal resources
• A Robust Semidefinite Programming Approach to the Separability Problem
• Genuine multipartite entanglement measure
• Convex optimization over classes of multiparticle entanglement
• A complete criterion for separability detection
• Detection of $k$-partite entanglement and $k$-nonseparability of multipartite quantum states
• k-stretchability of entanglement, and the duality of k-separability and k-producibility
• Optimization of device-independent witnesses of entanglement depth from two-body correlators
• Building separable approximations for quantum states via neural networks
• Entanglement Witness $2.0$: Compressed/Mirrored Entanglement Witnesses
• Entanglement and the truncated moment problem
• Exploring Bell inequalities for the device-independent certification of multipartite entanglement depth
• A Variational Approach to the Quantum Separability Problem
• Construction of genuine multipartite entangled states
• Necessary and sufficient criterion for k-separability of N-qubit noisy GHZ states
• Certifying Quantum Separability with Adaptive Polytopes
• Dichotomy of entanglement depth for symmetric states
• Can multipartite entanglement be characterized by two-point connected correlation functions ?
• Linear maps as sufficient criteria for entanglement depth and compatibility in many-body systems