2005/04/06 by Piotr Badziag, Piotr Badziąg, Badziag, Piotr +5 · 1 citation
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph) #quant-ph
paper · pdf · doi:10.48550/arxiv.quant-ph/0504041
5 pages, no figures
arxiv created 2005/04/06 · openalex publication_date 2005/04/06 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 × n dimensions to solving a set of linear equations in about \binommn+D-1D 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.