Computational complexity of the quantum separability problem
From MaRDI portal
Recommendations
Cited in
(35)- Convexity and the separability problem of quantum mechanical density matrices
- Classical complexity and quantum entanglement
- Combinatorial entanglement
- Lower bounds for testing complete positivity and quantum separability
- On the mixed-unitary rank of quantum channels
- Quantum de Finetti theorems under local measurements with applications
- Entanglement of the antisymmetric state
- A successive approximation method for quantum separability
- Epsilon-net method for optimizations over separable states
- Entanglement and the shareability of quantum states
- Quantum interactive proofs and the complexity of separability testing
- Computational Depth Complexity of Measurement-Based Quantum Computation
- Computational Complexity of Projected Entangled Pair States
- Strong NP-hardness of the quantum separability problem
- Computational Complexity of Quantum Satisfiability
- Quantum Hamiltonian Complexity
- Dvoretzky's theorem and the complexity of entanglement detection
- Epsilon-net method for optimizations over separable states
- Quantum entanglement, sum of squares, and the log rank conjecture
- An elementary introduction to the geometry of quantum states with pictures
- Computing quantum discord is NP-complete
- Algorithms and Computation
- Approximating the set of separable states using the positive partial transpose test
- An improved semidefinite programming hierarchy for testing entanglement
- Complexity classification of two-qubit commuting Hamiltonians
- A quasipolynomial-time algorithm for the quantum separability problem
- scientific article; zbMATH DE number 5049912 (Why is no real title available?)
- Nullspaces of entanglement breaking channels and applications
- Commuting quantum circuits and complexity of Ising partition functions
- Operator algebra generalization of a theorem of Watrous and mixed unitary quantum channels
- Faithful squashed entanglement
- Numerical approaches to entangling dynamics from variational principles
- An algorithm based on negative probabilities for a separability criterion
- On the geometric probability of entangled mixed states
- The complexity of relating quantum channels to master equations
This page was built for publication: Computational complexity of the quantum separability problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522629)
