A quasipolynomial-time algorithm for the quantum separability problem.
Fernando G. S. L. BrandãoMatthias ChristandlJon YardPublished in: CoRR (2010)
Keyphrases
- dynamic programming
- detection algorithm
- times faster
- experimental evaluation
- preprocessing
- significant improvement
- learning algorithm
- convex hull
- optimization algorithm
- particle swarm optimization
- simulated annealing
- high accuracy
- worst case
- probabilistic model
- computational cost
- segmentation algorithm
- recognition algorithm
- objective function
- convergence rate
- improved algorithm
- classification algorithm
- np hard
- computational complexity
- clustering algorithm