Towards efficient algorithm deciding separability of distributed quantum states

Details Towards efficient algorithm deciding separability of distributed quantum states Towards efficient algorithm deciding separability of distributed quantum states

2005-04-06

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

Physics

Quantum Physics

5 pages, no figures

Scientific paper

It is pointed out that separability problem for arbitrary multi-partite states can be fully solved by a finite size, elementary recursive algorithm. In the worse case scenario, the underlying numerical procedure, may grow doubly exponentially with the state's rank. Nevertheless, we argue that for generic states, analysis of concurrence matrices essentially reduces the task of solving separability problem in $m \times n$ dimensions to solving a set of linear equations in about $\binom{mn+D-1}{D}$ variables, where $D$ decreases with $mn$ and for large $mn$ it should not exceed 4. Moreover, the same method is also applicable to multipartite states where it is at least equally efficient.

Affiliated with

Also associated with

No associations

Rating

Towards efficient algorithm deciding separability of distributed quantum 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 Towards efficient algorithm deciding separability of distributed quantum states, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Towards efficient algorithm deciding separability of distributed quantum states will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-38308