Classical deterministic complexity of Edmonds' Problem and quantum entanglement
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Quantum Computation and Quantum Information: 10th Anniversary Edition
Quantum Computation and Quantum Information: 10th Anniversary Edition
Hi-index | 0.00 |
Determining whether a quantum state is separable or entangled is a problem of fundamental importance in quantum information science. This is a brief review in which we consider the problem for states in infinite dimensional Hilbert spaces. We show how the problem becomes tractable for a class of Gaussian states.