Certifying Quantum Separability with Adaptive Polytopes

Abstract

The concept of entanglement and separability of quantum states is relevant for several fields in physics. Still, there is a lack of effective operational methods to characterise these features. We propose a method to certify quantum separability of two- and multiparticle quantum systems based on an adaptive polytope approximation. This leads to an algorithm which, for practical purposes, conclusively recognises two-particle separability for small and medium-size dimensions. For multiparticle systems, the approach allows to characterise full separability for up to five qubits or three qutrits; in addition, different classes of entanglement can be distinguished. Finally, our methods allow to identify systematically quantum states with interesting entanglement properties, such as maximally robust states which are separable for all bipartitions, but not fully separable.

arXiv commentSubmission to SciPost, 9 + 12p pages, 8 figures

References in corpus (42)

• Quantum entanglement
• Separability of Mixed States: Necessary and Sufficient Conditions
• Area laws for the entanglement entropy - a review
• Entanglement detection
• Separability criterion and inseparable mixed states with positive partial transposition
• Building up spacetime with quantum entanglement
• Holographic quantum error-correcting codes: Toy models for the bulk/boundary correspondence
• Unextendible Product Bases and Bound Entanglement
• Robustness of entanglement
• Classification of mixed three-qubit states
• A complete family of separability criteria
• Entanglement Certification $-$ From Theory to Experiment
• Taming multiparticle entanglement
• Separability criteria for genuine multiparticle entanglement
• Entanglement entropy: holography and renormalization group
• Separability and distillability of multiparticle quantum systems
• Quantifying Entanglement with Witness Operators
• Experimental multiparticle entanglement dynamics induced by decoherence
• Generating random density matrices
• Genralized Robustness of Entanglement
• Genuine multiparticle entanglement of permutationally invariant states
• Estimating entanglement monotones with a generalization of the Wootters formula
• A Robust Semidefinite Programming Approach to the Separability Problem
• Detecting and quantifying entanglement on near-term quantum devices
• Witnessed Entanglement
• Detecting entanglement in quantum many-body systems via permutation moments
• A complete hierarchy for the pure state marginal problem in quantum mechanics
• Entanglement detection with imprecise measurements
• Convex optimization over classes of multiparticle entanglement
• A complete criterion for separability detection
• Building separable approximations for quantum states via neural networks
• Algorithm for characterizing stochastic local operations and classical communication classes of multiparticle entanglement
• Fundamental Limitation on the Detectability of Entanglement
• Bound entangled states fit for robust experimental verification
• Convex separation from convex optimization for large-scale problems
• Entanglement and the truncated moment problem
• Simple and maximally robust processes with no classical common-cause or direct-cause explanation
• A Variational Approach to the Quantum Separability Problem
• Quantum-Inspired Hierarchy for Rank-Constrained Optimization
• Genuine multipartite entanglement is not a precondition for secure conference key agreement
• Criteria for non-$k$-separability of $n$-partite quantum states
• Construction of three-qubit biseparable states distinguishing kinds of entanglement in a partial separability classification

Cited by in corpus (6)

• Semidefinite programming relaxations for quantum correlations
• Characterising the Hierarchy of Multi-time Quantum Processes with Classical Memory
• Hybrid of Gradient Descent And Semidefinite Programming for Certifying Multipartite Entanglement Structure
• Geometry of two-body correlations in three-qubit states
• Entanglement Superactivation in Multiphoton Distillation Networks
• Certifying the activation of Bell nonlocality with finite data