Computer Science – Computational Complexity
Scientific paper
2006-03-12
Electronic Notes in Theoretical Computer Science, Volume 169 , March 2007, pp. 121-131
Computer Science
Computational Complexity
8 pages
Scientific paper
10.1016/j.entcs.2006.07.034
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.
Mancini Stefano
Severini Simone
No associations
LandOfFree
The Quantum Separability Problem for Gaussian States does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The Quantum Separability Problem for Gaussian States, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Quantum Separability Problem for Gaussian States will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-340082