Strong NP-hardness of the quantum separability problem
From MaRDI portal
Recommendations
Cited in
(76)- Epsilon-net method for optimizations over separable states
- Computational complexity of the quantum separability problem
- Pairwise completely positive matrices and conjugate local diagonal unitary invariant quantum states
- Classical complexity and quantum entanglement
- On the mixed-unitary rank of quantum channels
- Preparing tunable Bell-diagonal states on a quantum computer
- Computing quantum discord is NP-complete
- Calculation of quantum discord in higher dimensions for \(X\)- and other specialized states
- Shorter unentangled proofs for ground state connectivity
- Entanglement criterion via general symmetric informationally complete measurements
- Optimization flow for approximating a matrix state involving orthonormal constraints
- Limitations of semidefinite programs for separable states and entangled games
- Quantum \(J\)-channels on Krein spaces
- Rank-1 approximation for entangled multipartite real systems
- Nonlinear Power-Like and SVD-Like Iterative Schemes with Applications to Entangled Bipartite Rank-1 Approximation
- Faithful squashed entanglement
- Geometry of entanglement and separability in Hilbert subspaces of dimension up to three
- ANN-enhanced detection of multipartite entanglement in a three-qubit NMR quantum processor
- Efficient swap test method for enhanced multipartite entanglement quantification
- Entangled edge states of corank one with positive partial transposes
- Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling
- Quantum magnonics: when magnon spintronics meets quantum information science
- A universal framework for entanglement detection under group symmetry
- Useful variants and perturbations of completely entangled subspaces and spans of unextendible product bases
- Product vectors in the ranges of multi-partite states with positive partial transposes and permanents of matrices
- Mapping cone of k-entanglement breaking maps
- The inverse eigenvalue problem for entanglement witnesses
- Can quantum entanglement detection schemes improve search?
- Separability of heterogeneous quantum systems using multipartite concurrence and tangle
- Non-unitarity maximizing unraveling of open quantum dynamics
- Quantum entanglement \& purity testing: a graph zeta function perspective
- scientific article; zbMATH DE number 1530002 (Why is no real title available?)
- Many bounded versions of undecidable problems are \textsf{NP}-hard
- Entanglement criterion and strengthened Bell inequalities based on the Pearson correlation
- Entanglement witnesses based on symmetric informationally complete measurements
- Operator theory and quantum information theory -- POVM and entangled state
- Bounding the separable rank via polynomial optimization
- An algorithm based on negative probabilities for a separability criterion
- Spectral properties of symmetric quantum states and symmetric entanglement witnesses
- Quasi-polynomial time algorithms for free quantum games in bounded dimension
- Generalized entanglement of purification criteria for 2-producible states in multipartite systems
- Entanglement in cyclic sign invariant quantum states
- Detecting genuine multipartite entanglement in three-qubit systems with eternal non-Markovianity
- Construction of genuinely entangled multipartite subspaces from bipartite ones by reducing the total number of separated parties
- k-extendibility of high-dimensional bipartite quantum states
- Looking for Pairs that Hard to Separate: A Quantum Approach
- Decomposition of completely symmetric states
- k-positive maps: new characterizations and a generation method
- Entanglement quantification from collective measurements processed by machine learning
- Nonlinear Power-Like and SVD-Like Iterative Schemes with Applications to Entangled Bipartite Rank-1 Approximation
- Characterizing multipartite entanglement classes via higher-dimensional embeddings
- Computable lower bounds on the entanglement cost of quantum channels
- Dvoretzky's theorem and the complexity of entanglement detection
- Quantum one-way permutation over the finite field of two elements
- Combo separability criteria and lower bound on concurrence
- Halos and undecidability of tensor stable positive maps
- Epsilon-net method for optimizations over separable states
- A traversable wormhole teleportation protocol in the SYK model
- An improved semidefinite programming hierarchy for testing entanglement
- Hardness and Ease of Curing the Sign Problem for Two-Local Qubit Hamiltonians
- Characterization of equivariant maps and application to entanglement detection
- The entanglement criteria via a broad class of symmetric informationally complete measurements
- Quantum state tomography, entanglement detection and Bell violation prospects in weak decays of massive particles
- scientific article; zbMATH DE number 7640512 (Why is no real title available?)
- Analysing quantum systems with randomised measurements
- Low-rank approximation to entangled multipartite quantum systems
- Geometry and optimization in quantum information. Abstracts from the workshop held October 3--9, 2021 (hybrid meeting)
- Lower bounds for testing complete positivity and quantum separability
- Multipartite entanglement detection via projective tensor norms
- Robust entanglement measure for mixed quantum states
- Matrix factorization ranks via polynomial optimization
- Quantitative bounds to propagation of quantum correlations in many-body systems
- Approximating the set of separable states using the positive partial transpose test
- Negativity spectra in random tensor networks and holography
- A complex-valued gradient flow for the entangled bipartite low rank approximation
- Quantum interactive proofs and the complexity of separability testing
This page was built for publication: Strong NP-hardness of the quantum separability problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3172441)
