Computational Complexity Measures of Multipartite Quantum Entanglement

Details Computational Complexity Measures of Multipartite Quantum Entanglement Computational Complexity Measures of Multipartite Quantum Entanglement

2003-08-13

arxiv.org/abs/quant-ph/0308072v1

Proc. 14th ISAAC. Springer's LNCS, Vol.2906, pp.117-128, 2003

Physics

Quantum Physics

To appear in the Proceedings of the 14th Annual International Conference on Algorithms and Computation, December 2003

Scientific paper

We shed new light on entanglement measures in multipartite quantum systems by taking a computational-complexity approach toward quantifying quantum entanglement with two familiar notions--approximability and distinguishability. Built upon the formal treatment of partial separability, we measure the complexity of an entangled quantum state by determining (i) how hard to approximate it from a fixed classical state and (ii) how hard to distinguish it from all partially separable states. We further consider the Kolmogorovian-style descriptive complexity of approximation and distinction of partial entanglement.

Affiliated with

Also associated with

No associations

Rating

Computational Complexity Measures of Multipartite Quantum Entanglement 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 Computational Complexity Measures of Multipartite Quantum Entanglement, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computational Complexity Measures of Multipartite Quantum Entanglement will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-2559