Detecting bipartite entanglement with PnCP maps and non-negative polynomials
quant-ph
Submitted: 2026-05-28
Updated: 2026-11-04
Code: https://github.com/Paulcat/Entanglement-Moments
Terminology
Sources
- Strong NP-Hardness of the Quantum Separability Problem
- The set of separable states has no finite semidefinite representation except in dimension $3\times 2$
- A matrix realignment method for recognizing entanglement
- A Class of Linear Positive Maps in Matrix Algebras
- Positive maps, positive polynomials and entanglement witnesses
- New examples of entangled states on $\mathbb{C}^3 \otimes \mathbb{C}^3$
- Some applications of Choi polynomials of linear maps
- Extremal entanglement witnesses
- Constructions of indecomposable positive maps based on a new criterion for indecomposability
- Separability for Weak Irreducible matrices
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements