Back to open problems
QuantumQuantum complexity theory
Complexity of the separability problem
A quantum complexity problem asking for the true computational complexity of deciding whether a bipartite mixed state is separable or far from separable.
Contact
Henry Yuen
Added
2023
Last progress
No update listed
Silicio brief
In Silicio terms, this is an open problem in quantum complexity theory. A quantum complexity problem asking for the true computational complexity of deciding whether a bipartite mixed state is separable or far from separable.
Use the source page for the full statement, references, and updates.
IQOQI Vienna · Open Quantum Problems